Optimal control of two symmetric competing queues with finite capacity and non negligible setup times.
Mauro BoccadoroPaolo ValigiPublished in: ETFA (1) (2003)
Keyphrases
- finite capacity
- optimal control
- setup times
- scheduling problem
- queueing model
- single server
- lot sizing
- dynamic programming
- multi item
- base stock policy
- flowshop
- lagrangian relaxation
- reinforcement learning
- single product
- infinite horizon
- control strategy
- np hard
- special case
- parallel machines
- learning algorithm
- multistage
- upper bound
- state space