Lower bounds for minimizing total completion time in a two-machine flow shop

DOI10.1007/s10951-006-8789-xzbMath1154.90459OpenAlexW2086748991MaRDI QIDQ880570

Linda van Norden, Hoogeveen, J. A., Steef L. van de Velde

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-8789-x

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

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 ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ 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

• Unnamed Item
• 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
• Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• A bicriteria approach to the two-machine flow shop scheduling problem
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• Two-machine flowshop scheduling to minimize mean flow time
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯

This page was built for publication: Lower bounds for minimizing total completion time in a two-machine flow shop