Exact solution of the two-machine flow shop problem with three operations
From MaRDI portal
Publication:2669696
DOI10.1016/j.cor.2021.105595OpenAlexW3207336199MaRDI QIDQ2669696
Fabio Salassa, Vincent T'kindt, Frederico Della Croce
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105595
Cites Work
- Two-machine flowshop scheduling with flexible operations and controllable processing times
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- Throughput optimization in two-machine flowshops with flexible operations
- Flow shop scheduling with flexible processing times
- A constraint generation approach for two-machine shop problems with jobs selection
- Shop scheduling problems with pliable jobs
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
- Optimal two- and three-stage production schedules with setup times included
This page was built for publication: Exact solution of the two-machine flow shop problem with three operations