Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays

DOI10.1007/978-3-540-85097-7_40zbMath1168.90445OpenAlexW2170015528MaRDI QIDQ5505680

Hairong Zhao, Yumei Huo, Haibing Li

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_40

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag

Cites Work

• 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

This page was built for publication: Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays