A note on minimizing maximum lateness in a two-machine no-wait flowshop
From MaRDI portal
Publication:1879796
DOI10.1016/S0305-0548(03)00162-XzbMath1100.90508OpenAlexW1982292026MaRDI QIDQ1879796
Publication date: 23 September 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00162-x
Related Items
A survey of scheduling problems with setup times or costs, A survey of scheduling problems with no-wait in process, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
Cites Work
- Total flowtime in no-wait flowshops with separated setup times.
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- No-wait flowshops with bicriteria of makespan and total completion time
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- NP-hardness of compact scheduling in simplified open and flow shops.
- A new heuristic and dominance relations for no-wait flowshops with setups
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
