On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties.
Volker LauffFrank WernerPublished in: Comput. Oper. Res. (2004)
Keyphrases
- multistage
- scheduling problem
- single stage
- stochastic programming
- production system
- dynamic programming
- stochastic optimization
- lot sizing
- single machine
- flowshop
- attack detection
- computational complexity
- optimal policy
- decision problems
- processing times
- worst case
- lot streaming
- tabu search
- job shop scheduling problem
- np hard
- job shop
- objective function