Pages that link to "Item:Q1396238"
From MaRDI portal
The following pages link to Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem. (Q1396238):
Displaying 3 items.
- Flowshop/no-idle scheduling to minimize total elapsed time (Q811886) (← links)
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)