Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
From MaRDI portal
Publication:596459
DOI10.1023/B:ANOR.0000030687.72169.c7zbMath1056.90063OpenAlexW2008645045MaRDI QIDQ596459
Christos P. Koulamas, Jatinder N. D. Gupta, Chris N. Potts, Vitaly A. Strusevich, Kyparisis, George J.
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000030687.72169.c7
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Flow shop scheduling with flexible processing times, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption, Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence, Exact solution of the two-machine flow shop problem with three operations, Some results of the worst-case analysis for flow shop scheduling with a learning effect, Throughput optimization in two-machine flowshops with flexible operations, Synchronous flow shop scheduling with pliable jobs, Shop scheduling problems with pliable jobs, A review of TSP based approaches for flowshop scheduling
