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

DOI10.1016/S0377-2217(03)00415-6zbMATH Open1065.90031OpenAlexW2053133769MaRDI QIDQ1876196FDOQ1876196

Authors: Can Akkan, Selçuk Karabatı 

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

Recommendations

• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
• 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
• Two-machine flowshop scheduling with a secondary criterion

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)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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

Cited In (33)

• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• Time complexity and linear-time approximation of the ancient two-machine flow shop
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
• A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
• A new lower bounding rule for permutation flow shop scheduling
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Minimizing the sum of job completion times on capacitated two-parallel machines
• A particle swarm optimization-based algorithm for job-shop scheduling problems
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
• 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 total completion time problem: branch-and-bound algorithms based on network-flow formulation
• A global constraint for total weighted completion time for unary resources
• An assignment-based lower bound for a class of two-machine flow shop problems
• A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
• A computational study of the permutation flow shop problem based on a tight lower bound
• Lower bounds for minimizing total completion time in a two-machine flow shop
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• An intensification approach based on fitness landscape characteristics for job shop scheduling problem
• A bicriteria flowshop scheduling with a learning effect
• Two-machine flowshop scheduling with a secondary criterion
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Mathematical model for cyclic scheduling with work-in-process minimization
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• Title not available (Why is that?)
• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
• An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
• A flexible flowshop problem with total flow time minimization

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

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