Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
From MaRDI portal
Publication:611469
DOI10.1016/j.camwa.2010.06.019zbMath1201.90070OpenAlexW2081821125MaRDI QIDQ611469
Publication date: 14 December 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.06.019
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times ⋮ A survey of scheduling problems with setup times or costs ⋮ Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
Cites Work
- Unnamed Item
- Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times
- Schedule execution for two-machine flow-shop with interval processing times
- A survey of scheduling problems with setup times or costs
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
