On the existence of schedules that are near-optimal for both makespan and total weighted completion time.
Clifford SteinJoel WeinPublished in: Oper. Res. Lett. (1997)
Keyphrases
- scheduling problem
- single machine
- processing times
- flowshop
- release dates
- parallel machines
- parallel machine scheduling problem
- minimizing makespan
- np hard
- permutation flowshop
- setup times
- maximum lateness
- tabu search
- scheduling jobs
- job shop
- unrelated parallel machines
- single machine scheduling problem
- precedence constraints
- total weighted tardiness
- identical parallel machines
- job shop scheduling problem
- completion times
- sequence dependent setup times
- release times
- evolutionary algorithm
- provably near optimal