Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times
From MaRDI portal
Publication:6157771
Recommendations
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
- Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
Cites work
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
- A survey of scheduling problems with no-wait in process
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Principles of Sequencing and Scheduling
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Stochastic Scheduling with Release Dates and Due Dates
- The third comprehensive survey on scheduling problems with setup times/costs
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
This page was built for publication: Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157771)