Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities.
Shuguang LiPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- approximation algorithms
- scheduling jobs
- release times
- batch processing
- single machine
- parallel machines
- identical parallel machines
- identical machines
- strongly np hard
- processing times
- np hard
- scheduling problem
- polynomial time approximation
- precedence constraints
- special case
- flowshop
- release dates
- worst case
- single machine scheduling problem
- production system
- fixed number
- setup times
- approximation ratio
- average case
- constant factor
- sequence dependent setup times
- genetic algorithm
- completion times
- convergence rate