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

DOI10.1016/J.EJOR.2016.02.003zbMATH Open1346.90337OpenAlexW2263978826MaRDI QIDQ322969FDOQ322969

Authors: 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

Recommendations

• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
• Two-machine flow-shop scheduling problems with minimizing the total completion times
• A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
• A matheuristic approach for the two-machine total completion time flow shop problem
• The two-machine total completion time flow shop problem
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP

zbMATH Keywords

schedulingbranch-and-boundflowshopLagrangian relaxation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• An exact algorithm for single-machine scheduling without machine idle time
• A dynamic programming method for single machine scheduling
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• 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
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• 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
• 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

Cited In (8)

• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
• Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
• Two-machine flowshop scheduling with a secondary criterion
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm

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

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