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

DOI10.1007/S10479-018-3082-XMaRDI QIDQ829189zbMATH OpenOpenAlexFDO

Authors Mohamed Amine Mkadem, A. Moukrim, Mehdi Serairi

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

lower boundtime delaymakespanbranch-and-boundtwo-machine flow-shop

Mathematics Subject Classification ID

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

Recommendations

• Lower bounds for the two-machine flow shop problem with time delays
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Minimizing total completion time in two-machine flow shops with exact delays
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• Two-machine flow shop scheduling problems with minimal and maximal delays

Cites work

• scientific article; zbMATH DE number 900396 (Why is no real title available?)
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• A survey of scheduling problems with setup times or costs
• Algorithms and Computation
• Lower bounds for the two-machine flow shop problem with time delays
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Permutation flowshop scheduling problems with maximal and minimal time lags
• Sequencing \(n\) jobs on two machines with arbitrary time lags
• Shop Problems With Two Machines and Time Lags
• UET flow shop scheduling with delays

Cited in

(9)

• Analysis of heuristics for the UET two-machine flow shop problem with time delays
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Scheduling in manufacturing with transportation: classification and solution techniques
• Lower bounds for the two-machine flow shop problem with time delays
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
• Two-machine flow shop scheduling problems with minimal and maximal delays
• Minimizing total completion time in two-machine flow shops with exact delays
• Exact solution of the two-machine flow shop problem with three operations

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

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