Minimizing makespan on a single machine subject to random breakdowns.
Nihat KasapHaldun AytugAnand A. PaulPublished in: Oper. Res. Lett. (2006)
Keyphrases
- minimizing makespan
- scheduling problem
- single machine
- flowshop
- processing times
- total weighted tardiness
- earliness tardiness
- maximum lateness
- sequence dependent setup times
- total tardiness
- release dates
- maximum tardiness
- minimize total
- setup times
- scheduling jobs
- learning effect
- release times
- tabu search
- parallel machines
- np hard
- precedence constraints
- job shop scheduling problem
- rolling horizon
- job shop
- identical machines
- completion times
- single machine scheduling problem
- search space
- weighted number of tardy jobs
- number of late jobs