A note on minimizing maximum lateness in a two-machine no-wait flowshop
From MaRDI portal
Publication:1879796
DOI10.1016/S0305-0548(03)00162-XzbMATH Open1100.90508OpenAlexW1982292026MaRDI QIDQ1879796FDOQ1879796
Authors: Parthasarati Dileepan
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
Recommendations
- Minimising Maximum Lateness in a Two-Machine Flowshop
- Note on minimizing total tardiness in a two-machine flowshop
- Minimizing total tardiness in no-wait flowshops
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
- A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- Two-machine flow shop scheduling problems with minimal and maximal delays
- An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system
- Two-machine flowshop scheduling to minimize total tardiness
- Minimizing tardiness in a two-machine flow-shop
Cites Work
- Total flowtime in no-wait flowshops with separated setup times.
- No-wait flowshops with bicriteria of makespan and total completion time
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- NP-hardness of compact scheduling in simplified open and flow shops.
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- A new heuristic and dominance relations for no-wait flowshops with setups
Cited In (7)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- A survey of scheduling problems with setup times or costs
- Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines
- Minimizing total tardiness in no-wait flowshops
- Title not available (Why is that?)
- A survey of scheduling problems with no-wait in process
This page was built for publication: A note on minimizing maximum lateness in a two-machine no-wait flowshop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879796)