Using short-term memory to minimize the weighted number of late jobs on a single machine.
Laurent PéridyEric PinsonDavid RivreauPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- number of late jobs
- single machine
- short term memory
- completion times
- release times
- long term memory
- scheduling problem
- processing times
- working memory
- information processing
- computational model
- release dates
- scheduling jobs
- total tardiness
- learning effect
- sequence dependent setup times
- dynamic programming
- single machine scheduling problem
- competitive ratio
- setup times
- weighted sum
- np hard