scientific article; zbMATH DE number 5525237
From MaRDI portal
Publication:3610539
Recommendations
- Optimizing blocking flow shop scheduling problem with total completion time criterion
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Minimizing Cycle Time in a Blocking Flowshop
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- Complexity of flowshop scheduling problems with a new blocking constraint
- Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
- On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking
Cited in
(6)- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking
- A new algorithm for minimizing makespan, Cmax, in blocking flow-shop problem through slowing down the operations
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3610539)
