Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time.
Nodari VakhaniaFrank WernerPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- single machine
- maximum lateness
- weighted number of tardy jobs
- scheduling problem
- processing times
- release times
- release dates
- scheduling jobs
- number of tardy jobs
- sequence dependent setup times
- batch processing machines
- earliness tardiness
- flowshop
- total weighted tardiness
- precedence constraints
- completion times
- parallel machines
- setup times
- deteriorating jobs
- single machine scheduling problem
- identical machines
- number of late jobs
- dominance rules
- reinforcement learning
- shortest processing time
- job shop
- data transfer
- upper bound