Exact solution of the two-machine flow shop problem with three operations

DOI10.1016/J.COR.2021.105595MaRDI QIDQ2669696zbMATH OpenOpenAlexFDO

Authors Fabio Salassa, Vincent T'kindt, F. 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

zbMATH Keywords

exact approachIP modelingtwo-machine flow shop with three operations

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
• Solving constrained flow-shop scheduling problems with three machines
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• A three-machine permutation flow-shop problem with minimum makespan on the second machine
• The three-machine flow-shop problem with arbitrary precedence relations
• Exact method for the two-machine flow-shop problem with time delays
• scientific article; zbMATH DE number 3982900
• The tricriteria two-machine flowshop scheduling problem
• Exact exponential algorithms for 3-machine flowshop scheduling problems
• The two-machine total completion time flow shop problem

Cites work

• A constraint generation approach for two-machine shop problems with jobs selection
• Flow shop scheduling with flexible processing times
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
• Optimal two- and three-stage production schedules with set-up time included
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Shop scheduling problems with pliable jobs
• Throughput optimization in two-machine flowshops with flexible operations
• Two-machine flowshop scheduling with flexible operations and controllable processing times
• Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence

Cited in

(5)

• Exact exponential algorithms for 3-machine flowshop scheduling problems
• A constraint generation approach for two-machine shop problems with jobs selection
• Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
• A distributionally robust approach for the two-machine permutation flow shop scheduling
• Flow shop scheduling with inter-stage flexibility and blocking constraints

This page was built for publication: Exact solution of the two-machine flow shop problem with three operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669696)