The following pages link to (Q3610539):
Displaying 6 items.
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← links)
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237) (← links)
- A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking (Q2423281) (← links)
- A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations (Q5292811) (← links)
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
