Complexity of a scheduling problem with controllable processing times.
Byung-Cheon ChoiJoseph Y.-T. LeungMichael L. PinedoPublished in: Oper. Res. Lett. (2010)
Keyphrases
- scheduling problem
- single machine
- np hard
- earliness tardiness
- flowshop
- setup times
- maximum lateness
- processing times
- worst case
- tabu search
- computational complexity
- search algorithm
- permutation flowshop
- data sets
- total tardiness
- preventive maintenance
- sequence dependent setup times
- release dates
- memory requirements
- single machine scheduling problem
- complexity analysis
- decision problems
- upper bound
- dynamic programming
- expert systems
- multiscale
- information systems
- machine learning