A note on optimal policies for two group scheduling problems with deteriorating setup and processing times.
Wen-Chiung LeeChin-Chia WuPublished in: Comput. Ind. Eng. (2010)
Keyphrases
- processing times
- optimal policy
- scheduling problem
- single machine
- markov decision processes
- flowshop
- finite horizon
- state space
- dynamic programming
- decision problems
- long run
- setup times
- infinite horizon
- reinforcement learning
- multistage
- finite state
- state dependent
- sufficient conditions
- earliness tardiness
- average reward
- polynomially solvable
- average cost
- identical machines
- np hard
- job shop scheduling
- job shop scheduling problem
- single machine scheduling problem
- precedence constraints
- tabu search
- job shop
- parallel machines
- markov chain