Minimizing total completion time in two-machine flow shops with exact delays

DOI10.1016/j.cor.2008.06.015zbMath1179.90136OpenAlexW2088798907MaRDI QIDQ1000994

Hairong Zhao, Yumei Huo, Haibing Li

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.06.015

zbMATH Keywords

metaheuristicsflow shopNP-hardtotal completion timeexact delaypermutation schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Approximation algorithms for coupled task scheduling minimizing the sum of completion times ⋮ A two-machine flowshop problem with two agents ⋮ Coupled task scheduling with exact delays: literature review and models ⋮ Scheduling coupled tasks with exact delays for minimum total job completion time

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Some no-wait shops scheduling problems: Complexity aspect
• Solving the continuous flow-shop scheduling problem by metaheuristics.
• Approximation algorithms for UET scheduling problems with exact delays
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Some new results in flow shop scheduling
• A note on the flow-shop problem without interruptions in job processing
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Heuristic algorithms for continuous flow-shop problem
• Flowshop scheduling with limited temporary storage
• Unit Execution Time Shop Problems
• Solvable Cases of the No-wait Flow-shop Scheduling Problem
• Tabu Search—Part II
• Optimal flowshop schedules with no intermediate storage space
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Approximation Algorithms for Scheduling Problems with Exact Delays