Pages that link to "Item:Q1761237"
From MaRDI portal
The following pages link to A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237):
Displayed 7 items.
- Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
- Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem (Q5058781) (← links)