Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan.
Jinwei GuManzhan GuXiwen LuYing ZhangPublished in: J. Comb. Optim. (2018)
Keyphrases
- job shop scheduling problem
- optimal policy
- state dependent
- job shop scheduling
- control policies
- asymptotically optimal
- finite horizon
- scheduling problem
- markov decision processes
- genetic algorithm
- benchmark problems
- memetic algorithm
- tabu search
- production scheduling
- stochastic inventory control
- reinforcement learning
- state space
- dynamic programming
- simulated annealing
- infinite horizon
- combinatorial optimization problems
- long run
- graph model
- periodic review
- multistage
- steady state
- base stock policies
- sufficient conditions
- combinatorial optimization
- long run average cost
- average cost
- inventory systems
- optimization problems
- knapsack problem
- single server
- metaheuristic
- probabilistic model