The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm

DOI10.1016/S0377-2217(03)00415-6zbMath1065.90031OpenAlexW2053133769MaRDI QIDQ1876196

Selçuk Karabatı, Can Akkan

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00415-6

zbMATH Keywords

Lagrangean relaxationBranch-and-boundFlowshop scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (11)

The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation ⋮ An assignment-based lower bound for a class of two-machine flow shop problems ⋮ Lower bounds for minimizing total completion time in a two-machine flow shop ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ A global constraint for total weighted completion time for unary resources ⋮ Mathematical model for cyclic scheduling with work-in-process minimization ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time ⋮ A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

Cites Work

• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• The two-machine total completion time flow shop problem
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item

This page was built for publication: The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm