Pages that link to "Item:Q1762072"
From MaRDI portal
The following pages link to An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072):
Displaying 4 items.
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time (Q340272) (← links)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
- A local search method for permutation flow shop scheduling (Q3433488) (← links)