Dynamic Programming to Minimize the Maximum Number of Open Stacks

DOI10.1287/ijoc.1060.0205zbMath1241.90170OpenAlexW2090776450MaRDI QIDQ2892372

Peter J. Stuckey, Maria Garcia de la Banda

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/67a8f36228acdfd0dcb93f2a4d9df7c85b22a420

zbMATH Keywords

dynamic programmingcutting sequencingminimization of maximum number of open stacks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (8)

Optimal patchings for consecutive ones matrices ⋮ Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions ⋮ Mathematical models for the minimization of open stacks problem ⋮ Exploiting subproblem dominance in constraint programming ⋮ Lock-free parallel dynamic programming ⋮ A biased random-key genetic algorithm for the minimization of open stacks problem ⋮ The minimization of open stacks problem: a review of some properties and their use in pre-processing operations ⋮ A method for detecting symmetries in constraint models and its generalisation

This page was built for publication: Dynamic Programming to Minimize the Maximum Number of Open Stacks