A comparison of heuristics to solve a single machine batching problem with unequal ready times of the jobs.
Oleh SobeykoLars MönchPublished in: WSC (2011)
Keyphrases
- single machine
- release dates
- dominance rules
- processing times
- scheduling problem
- scheduling jobs
- release times
- total weighted tardiness
- total tardiness
- maximum lateness
- minimize total
- earliness tardiness
- weighted tardiness
- weighted number of tardy jobs
- setup times
- sequence dependent setup times
- shortest processing time
- single machine scheduling problem
- strongly np hard
- identical machines
- number of tardy jobs
- flowshop
- number of late jobs
- dynamic programming
- parallel machines
- learning effect
- completion times
- search algorithm
- production scheduling
- deteriorating jobs
- competitive ratio
- job processing times
- integer programming
- identical parallel machines
- batch processing