The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
From MaRDI portal
(Redirected from Publication:322969)
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
Cites work
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A dynamic programming method for single machine scheduling
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- An assignment-based lower bound for a class of two-machine flow shop problems
- An exact algorithm for single-machine scheduling without machine idle time
- An exact approach for scheduling jobs with regular step cost functions on a single machine
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- Lower bounds for minimizing total completion time in a two-machine flow shop
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- Revisiting branch and bound search strategies for machine scheduling problems
- Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
- The Complexity of Flowshop and Jobshop Scheduling
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- The two-machine total completion time flow shop problem
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
Cited in
(10)- 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
- 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
- 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)
