Pages that link to "Item:Q2297561"
From MaRDI portal
The following pages link to A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561):
Displaying 6 items.
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
- Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups (Q6099438) (← links)
- A systematic literature review on no-idle flow shop scheduling problem (Q6130678) (← links)
