Approximation Schemes for Scheduling a Batching Machine with Nonidentical Job Size.
Xianzhao ZhangYuzhong ZhangZhigang CaoZengxia CaiPublished in: J. Syst. Sci. Complex. (2007)
Keyphrases
- batch processing
- approximation schemes
- flowshop
- scheduling problem
- scheduling jobs
- release dates
- single machine
- processing times
- approximation algorithms
- parallel machine scheduling problem
- identical parallel machines
- identical machines
- sequence dependent setup times
- precedence constraints
- job processing times
- maximum lateness
- job shop
- single machine scheduling problem
- parallel machines
- strongly np hard
- np hard
- completion times
- natural images
- setup times
- tabu search
- multiscale
- numerical methods
- dynamic programming
- scheduling decisions
- job scheduling
- release times
- deteriorating jobs
- special case