Pages that link to "Item:Q1027525"
From MaRDI portal
The following pages link to The flow shop problem with no-idle constraints: a review and approximation (Q1027525):
Displaying 13 items.
- Two-stage hybrid flowshop scheduling with simultaneous processing machines (Q1617273) (← links)
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140) (← links)
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
- Analysis of flow shop scheduling anomalies (Q2272295) (← links)
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
- Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines (Q2305020) (← links)
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← 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)
- Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem (Q4561176) (← links)
- Permutation, no-wait, no-idle flow shop problems (Q4971620) (← links)
- A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)
