Pages that link to "Item:Q3365661"
From MaRDI portal
The following pages link to Flowshop/no-idle scheduling to minimise the mean flowtime (Q3365661):
Displaying 3 items.
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)