Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs.
Shi-Sheng LiRen-Xia ChenPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- single machine
- weighted number of tardy jobs
- identical machines
- minimize total
- scheduling problem
- maximum lateness
- batch processing machines
- release dates
- job processing times
- processing times
- completion times
- scheduling jobs
- release times
- weighted tardiness
- total weighted tardiness
- earliness tardiness
- total tardiness
- parallel machines
- sequence dependent setup times
- tardiness cost
- setup times
- rolling horizon
- single machine scheduling problem
- number of late jobs
- flowshop
- learning effect
- number of tardy jobs
- dynamic programming
- production scheduling
- precedence constraints
- makespan minimization
- deteriorating jobs
- identical parallel machines
- special case
- dominance rules
- tabu search
- shortest processing time
- competitive ratio