Priority allocation rules for single machine total weighted linear and square tardiness problems.
Aihua YinAbraham P. PunnenDongping HuPublished in: Prod. Eng. (2016)
Keyphrases
- single machine
- scheduling problem
- release times
- completion times
- processing times
- minimize total
- single machine scheduling problem
- total weighted tardiness
- earliness tardiness
- number of late jobs
- release dates
- scheduling jobs
- sequence dependent setup times
- total tardiness
- dynamic programming
- maximum lateness
- weighted tardiness
- setup times
- weighted number of tardy jobs
- learning effect
- competitive ratio
- np complete
- parallel machines
- number of tardy jobs
- job shop scheduling problem
- resource allocation
- rolling horizon
- deteriorating jobs
- tabu search
- shortest processing time