Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
DOI10.1023/B:ANOR.0000030687.72169.C7zbMATH Open1056.90063OpenAlexW2008645045MaRDI QIDQ596459FDOQ596459
C. Koulamas, V. A. Strusevich, George J. Kyparisis, Jatinder N. D. Gupta, Chris N. Potts
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cited In (15)
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- A three-agent scheduling problem for minimizing the flow time on two machines
- Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
- Flow shop scheduling with flexible processing times
- Makespan minimization on three-machine flow shop with deteriorating jobs
- Throughput optimization in two-machine flowshops with flexible operations
- A review of TSP based approaches for flowshop scheduling
- Synchronous flow shop scheduling with pliable jobs
- TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
- Shop scheduling problems with pliable jobs
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- 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
This page was built for publication: Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596459)
