Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times.
Chung-Cheng Jason LuShih-Wei LinKuo-Ching YingPublished in: Appl. Soft Comput. (2014)
Keyphrases
- single machine
- setup times
- worst case
- weighted number of tardy jobs
- scheduling problem
- processing times
- np hard
- lower bound
- release dates
- scheduling jobs
- total tardiness
- weighted tardiness
- completion times
- minimize total
- sequence dependent setup times
- total weighted tardiness
- flowshop
- maximum lateness
- upper bound
- single machine scheduling problem
- makespan minimization
- lagrangian relaxation
- precedence constraints
- approximation algorithms
- strongly np hard
- branch and bound algorithm
- tabu search
- special case
- parallel machines
- optimal solution