The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
From MaRDI portal
(Redirected from Publication:1876196)
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
Cites work
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- The Complexity of Flowshop and Jobshop Scheduling
- The two-machine total completion time flow shop problem
Cited in
(33)- A flexible flowshop problem with total flow time minimization
- 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 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 SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
- 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
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- A particle swarm optimization-based algorithm for job-shop scheduling problems
- Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
- A matheuristic approach 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
- 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 global constraint for total weighted completion time for unary resources
- 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
- Lower bounds for minimizing total completion time in a two-machine flow shop
- A computational study of the permutation flow shop problem based on a tight lower bound
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
- A bicriteria flowshop scheduling with a learning effect
- An intensification approach based on fitness landscape characteristics for job shop scheduling problem
- Two-machine flowshop scheduling with a secondary criterion
- Mathematical model for cyclic scheduling with work-in-process minimization
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
- Algorithms for two-machine flow-shop sequencing with precedence constraints
- scientific article; zbMATH DE number 425580 (Why is no real title available?)
- 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
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)
