Scheduling a single machine with parallel batching to minimize makespan and total rejection cost.
Cheng HeJoseph Y.-T. LeungKangbok LeeMichael L. PinedoPublished in: Discret. Appl. Math. (2016)
Keyphrases
- single machine
- job processing times
- release dates
- scheduling problem
- identical machines
- release times
- minimize total
- processing times
- scheduling jobs
- maximum lateness
- parallel machines
- sequence dependent setup times
- total weighted tardiness
- makespan minimization
- completion times
- earliness tardiness
- flowshop
- weighted tardiness
- single machine scheduling problem
- setup times
- number of late jobs
- production scheduling
- rolling horizon
- learning effect
- deteriorating jobs
- weighted number of tardy jobs
- precedence constraints
- dynamic programming
- np hard
- job shop scheduling problem
- cost sensitive
- optimal policy
- upper bound
- optimal solution