Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times.
Paz Perez-GonzalezVictor Fernandez-ViagasMiguel Zamora GarcíaJose M. FramiñanPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- unrelated parallel machines
- setup times
- scheduling problem
- flowshop
- parallel machines
- single machine
- processing times
- sequence dependent setup times
- strongly np hard
- multi item
- np hard
- lot sizing
- search algorithm
- precedence constraints
- job shop
- single machine scheduling problem
- job shop scheduling problem
- single server
- scheduling algorithm
- special case
- completion times
- integer programming
- release dates
- tabu search
- identical machines
- lower bound