Maximizing total job value on a single machine with job selection.
Joonyup EunChang Sup SungEun-Seok KimPublished in: J. Oper. Res. Soc. (2017)
Keyphrases
- single machine
- release times
- processing times
- completion times
- maximum lateness
- single machine scheduling problem
- scheduling jobs
- scheduling problem
- release dates
- job processing times
- weighted number of tardy jobs
- number of late jobs
- deteriorating jobs
- total tardiness
- earliness tardiness
- identical machines
- flowshop
- minimize total
- weighted tardiness
- sequence dependent setup times
- total weighted tardiness
- dynamic programming
- learning effect
- shortest processing time
- rolling horizon
- production scheduling
- competitive ratio
- makespan minimization
- setup times
- parallel machines
- identical parallel machines
- job shop
- branch and bound algorithm
- dispatching rule
- genetic algorithm