Pages that link to "Item:Q1180831"
From MaRDI portal
The following pages link to Permutation vs. non-permutation flow shop schedules (Q1180831):
Displayed 8 items.
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- Analysis of heuristics for the UET two-machine flow shop problem with time delays (Q2482380) (← links)
- Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)