A note on the complexity of the problem of two-agent scheduling on a single machine.
C. T. NgT. C. Edwin ChengJinjiang YuanPublished in: J. Comb. Optim. (2006)
Keyphrases
- single machine
- scheduling problem
- minimize total
- release dates
- maximum lateness
- scheduling jobs
- release times
- total weighted tardiness
- weighted tardiness
- parallel machines
- sequence dependent setup times
- deteriorating jobs
- processing times
- earliness tardiness
- rolling horizon
- total tardiness
- production scheduling
- setup times
- job shop
- single machine scheduling problem
- identical machines
- np hard
- precedence constraints
- flowshop
- dynamic programming
- worst case
- competitive ratio
- weighted number of tardy jobs
- identical parallel machines
- tabu search
- job processing times
- number of late jobs
- learning effect
- scheduling algorithm
- genetic algorithm
- shortest processing time
- job shop scheduling problem
- lot sizing
- decision problems
- reinforcement learning