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

DOI10.1007/978-3-540-85097-7_40MaRDI QIDQ5505680zbMATH OpenOpenAlexFDO

Authors Yumei Huo, Haibing Li, Hairong Zhao

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)

Recommendations

• Minimizing total completion time in two-machine flow shops with exact delays
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• Two-machine flow-shop scheduling problems with minimizing the total completion times
• Two-machine flow shop scheduling problems with minimal and maximal delays
• Exact method for the two-machine flow-shop problem with time delays
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Minimising Maximum Lateness in a Two-Machine Flowshop
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Two-machine flowshop scheduling to minimize total tardiness

Cites work

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

Cited in

(9)

• Minimizing total completion time in two-machine flow shops with exact delays
• Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag
• Approximating the 2-machine flow shop problem with exact delays taking two values
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
• Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
• Exact method for the two-machine flow-shop problem with time delays

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

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