Pages that link to "Item:Q3433488"
From MaRDI portal
The following pages link to A local search method for permutation flow shop scheduling (Q3433488):
Displaying 9 items.
- Multi-neighborhood based path relinking for two-sided assembly line balancing problem (Q306088) (← links)
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time (Q340272) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- On the choice of baseline schedules for the discrete time/resource trade-off problem under stochastic environment (Q4978242) (← links)
