Online interval scheduling on a single machine with finite lookahead.
Feifeng ZhengYongxi ChengMing LiuYinfeng XuPublished in: Comput. Oper. Res. (2013)
Keyphrases
- single machine
- scheduling problem
- minimize total
- release dates
- maximum lateness
- scheduling jobs
- release times
- weighted tardiness
- sequence dependent setup times
- processing times
- deteriorating jobs
- identical machines
- setup times
- production scheduling
- earliness tardiness
- rolling horizon
- total weighted tardiness
- total tardiness
- single machine scheduling problem
- online learning
- learning effect
- weighted number of tardy jobs
- flowshop
- parallel machines
- job shop scheduling
- precedence constraints
- completion times
- tabu search
- number of late jobs
- np hard
- competitive ratio
- total cost
- flexible manufacturing systems
- job processing times
- job shop scheduling problem
- shortest processing time
- identical parallel machines
- weighted sum
- upper bound
- dynamic programming