A survey on scheduling problems with due windows.
Adam JaniakWladyslaw A. JaniakTomasz KrysiakTomasz KwiatkowskiPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- scheduling problem
- single machine
- np hard
- processing times
- job shop
- job shop scheduling
- sequencing problems
- greedy heuristics
- flowshop
- job shop scheduling problem
- earliness tardiness
- tabu search
- precedence constraints
- parallel machines
- setup times
- sequence dependent setup times
- microsoft windows
- windows nt
- lower bound
- data sets
- maximum lateness
- limited capacity
- window sizes
- genetic algorithm