Rescheduling on identical parallel machines with machine disruptions to minimize total completion time.
Yunqiang YinT. C. E. ChengDujuan WangPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- minimize total
- parallel machines
- identical parallel machines
- release dates
- scheduling problem
- single machine
- sequence dependent setup times
- strongly np hard
- flowshop
- processing times
- single machine scheduling problem
- single server
- supply chain
- precedence constraints
- parallel computing
- setup times
- shared memory
- genetic algorithm
- tabu search
- np hard
- reinforcement learning
- lot sizing
- approximation algorithms
- dynamic programming