Discrete parallel machine makespan ScheLoc problem.
Corinna HeßlerKaouthar DeghdakPublished in: J. Comb. Optim. (2017)
Keyphrases
- parallel machines
- scheduling problem
- unrelated parallel machines
- release dates
- scheduling jobs
- earliness tardiness
- flowshop
- single machine
- open shop
- minimizing makespan
- processing times
- sequence dependent setup times
- total tardiness
- makespan minimization
- parallel machine scheduling problem
- precedence constraints
- maximum lateness
- setup times
- parallel computing
- list scheduling
- job shop
- lot sizing
- permutation flowshop
- shared memory
- tabu search
- np hard
- strongly np hard
- total weighted tardiness
- single machine scheduling problem
- single server
- ibm sp
- message passing
- optimal solution