Complexity of flowshop scheduling problems with a new blocking constraint
From MaRDI portal
Recommendations
- Flow shop scheduling problems under machine-dependent precedence constraints
- Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
- Complexity of flow shop scheduling problems with transportation constraints
- The complexity of scheduling jobs in repetitive manufacturing systems
- Job-shop scheduling with blocking and no-wait constraints
Cites work
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Flowshop scheduling with limited temporary storage
- Job-shop scheduling with blocking and no-wait constraints
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- The permutation flow shop with buffers: A tabu search approach
Cited in
(16)- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- Job-shop scheduling with blocking and no-wait constraints
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine
- Makespan preserving flowshop reengineering via blocking constraints
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
- scientific article; zbMATH DE number 5525237 (Why is no real title available?)
- New block properties for the permutation flow shop problem with application in tabu search
- Lower bounding schemes for flowshops with blocking in-process
- A new algorithm for minimizing makespan, Cmax, in blocking flow-shop problem through slowing down the operations
- Job-shop scheduling with mixed blocking constraints between operations
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
- Heuristics for flow shop rescheduling with mixed blocking constraints
- A hybrid population-based ruin-and-recreate algorithm for the blocking flow shop scheduling problem
This page was built for publication: Complexity of flowshop scheduling problems with a new blocking constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572855)