Pages that link to "Item:Q811886"
From MaRDI portal
The following pages link to Flowshop/no-idle scheduling to minimize total elapsed time (Q811886):
Displayed 6 items.
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
- New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
