Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions.
Alessandro AgnetisPaolo DettiPatrick MartineauPublished in: Comput. Oper. Res. (2017)
Keyphrases
- parallel machines
- unrelated parallel machines
- scheduling problem
- precedence constraints
- total tardiness
- earliness tardiness
- weighted tardiness
- sequence dependent setup times
- minimize total
- release dates
- scheduling jobs
- makespan minimization
- setup times
- maximum lateness
- parallel machine scheduling problem
- single server
- identical parallel machines
- total weighted tardiness
- parallel computing
- list scheduling
- open shop
- flowshop
- lot sizing
- single machine
- processing times
- shared memory
- np hard
- branch and bound algorithm