Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop.
Arianna AlfieriShuyu ZhouRosario ScatamacchiaSteef L. van de VeldePublished in: 4OR (2021)
Keyphrases
- dynamic programming algorithms
- lower bound
- lot streaming
- dynamic programming
- multistage
- scheduling problem
- flowshop
- harmony search algorithm
- optimal solution
- upper bound
- production system
- optimal policy
- np hard
- branch and bound
- branch and bound algorithm
- objective function
- state space
- markov decision processes
- sufficient conditions
- linear programming
- markov decision problems
- search algorithm
- genetic algorithm