The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation

DOI10.1016/j.ejor.2016.02.003zbMath1346.90337OpenAlexW2263978826MaRDI QIDQ322969

Boris Detienne, Ruslan Sadykov, Shunji Tanaka

Publication date: 7 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.003

zbMATH Keywords

Lagrangian relaxationschedulingbranch-and-boundflowshop

Mathematics Subject Classification ID

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

Related Items (3)

Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ Exact Multiple Sequence Alignment by Synchronized Decision Diagrams

Cites Work

• Unnamed Item
• An assignment-based lower bound for a class of two-machine flow shop problems
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
• Lower bounds for minimizing total completion time in a two-machine flow shop
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• The two-machine total completion time flow shop problem
• A dynamic programming method for single machine scheduling
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• An exact approach for scheduling jobs with regular step cost functions on a single machine
• Using short-term memory to minimize the weighted number of late jobs on a single machine.
• 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
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• An exact algorithm for single-machine scheduling without machine idle time
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
• Revisiting branch and bound search strategies for machine scheduling problems
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Complexity of Flowshop and Jobshop Scheduling

This page was built for publication: The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation