One-operator-two-machine flowshop scheduling with setup and dismounting times
From MaRDI portal
Publication:1302722
DOI10.1016/S0305-0548(98)00087-2zbMath0957.90058MaRDI QIDQ1302722
Guoqing Wang, Chelliah Skriskandarajah, Cheng, T. C. Edwin
Publication date: 22 September 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Two-machine flow shop problems with a single server ⋮ A job-shop problem with one additional resource type ⋮ Scheduling the two-machine open shop problem under resource constraints for setting the jobs ⋮ A survey of scheduling problems with setup times or costs ⋮ The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time ⋮ Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic ⋮ Complexity results for flow-shop problems with a single server ⋮ Parallel machine scheduling with multiple unloading servers ⋮ A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
