Shop scheduling problems under precedence constraints
From MaRDI portal
Publication:1357789
DOI10.1023/A:1018997431986zbMath0880.90081OpenAlexW1508461300MaRDI QIDQ1357789
Publication date: 5 February 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018997431986
flow shopopen shopjob shopprecedence constraintspreemptive and non-preemptive casessuper shoptime-optimal schedule
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Two machine open shop scheduling problem with setup, processing and removal times separated, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, An effective heuristic algorithm for the partial shop scheduling problem, Vyacheslav Tanaev: contributions to scheduling and related areas, Complexity of mixed shop scheduling problems: A survey, A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations, Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage, Alternative graph formulation for solving complex factory-scheduling problems, The total completion time open shop scheduling problem with a given sequence of jobs on one machine
