Minimizing makespan on a single batching machine with release times and non-identical job sizes.
Shuguang LiGuojun LiXiaoli WangQiming LiuPublished in: Oper. Res. Lett. (2005)
Keyphrases
- minimizing makespan
- scheduling problem
- single machine
- release times
- flowshop
- processing times
- release dates
- scheduling jobs
- parallel machines
- sequence dependent setup times
- completion times
- number of late jobs
- np hard
- precedence constraints
- setup times
- learning effect
- single machine scheduling problem
- batch processing
- identical machines
- bicriteria
- special case
- strongly np hard
- genetic algorithm