Pages that link to "Item:Q337223"
From MaRDI portal
The following pages link to A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223):
Displaying 5 items.
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion (Q2003413) (← links)
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search (Q2003564) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine (Q6084515) (← links)
