Exact method for the two-machine flow-shop problem with time delays

DOI10.1007/S10479-018-3082-XzbMath1462.90050OpenAlexW2898514716MaRDI QIDQ829189

Mehdi Serairi, Mohamed Amine Mkadem, Aziz Moukrim

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-3082-x

zbMATH Keywords

time delaybranch-and-boundmakespanlower boundtwo-machine flow-shop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• A survey of scheduling problems with setup times or costs
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Shop Problems With Two Machines and Time Lags
• Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays
• UET flow shop scheduling with delays
• Algorithms and Computation
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays

This page was built for publication: Exact method for the two-machine flow-shop problem with time delays