The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
Jinjiang YuanZhaohui LiuC. T. NgT. C. Edwin ChengPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- release dates
- single machine
- scheduling problem
- identical machines
- processing times
- parallel machines
- minimize total
- maximum lateness
- earliness tardiness
- total tardiness
- sequence dependent setup times
- release times
- precedence constraints
- single machine scheduling problem
- total weighted tardiness
- scheduling jobs
- flowshop
- job processing times
- identical parallel machines
- np hard
- setup times
- makespan minimization
- production scheduling
- tabu search
- competitive ratio
- job shop
- dynamic programming
- dispatching rule
- job shop scheduling problem
- batch processing
- strongly np hard
- completion times
- linear programming
- supply chain
- special case