Minmax common due-window assignment and scheduling on a single machine with two competing agents.
Baruch MorPublished in: J. Oper. Res. Soc. (2018)
Keyphrases
- single machine
- scheduling problem
- minimize total
- release dates
- release times
- maximum lateness
- scheduling jobs
- sequence dependent setup times
- weighted tardiness
- deteriorating jobs
- production scheduling
- processing times
- setup times
- identical machines
- total weighted tardiness
- total tardiness
- parallel machines
- earliness tardiness
- single machine scheduling problem
- multiple agents
- resource allocation
- precedence constraints
- flowshop
- rolling horizon
- completion times
- number of late jobs
- np hard
- job shop
- learning effect
- weighted number of tardy jobs
- dynamic programming
- competitive ratio
- job shop scheduling
- job shop scheduling problem
- tabu search
- special case