Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan.
Alexander A. LazarevDmitry I. ArkhipovFrank WernerPublished in: Optim. Lett. (2017)
Keyphrases
- single machine
- scheduling jobs
- maximum lateness
- processing times
- scheduling problem
- completion times
- release dates
- total weighted tardiness
- sequence dependent setup times
- setup times
- single machine scheduling problem
- release times
- flowshop
- competitive ratio
- dynamic programming
- identical parallel machines
- resource consumption
- identical machines
- np hard
- integer programming
- tabu search
- special case
- lower bound