Dynamic programming to minimize the maximum number of open stacks

DOI10.1287/IJOC.1060.0205MaRDI QIDQ2892372zbMATH OpenOpenAlexFDO

Authors Maria Garcia De La Banda, Peter J. Stuckey

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

cutting sequencingdynamic programmingminimization of maximum number of open stacks

Mathematics Subject Classification ID

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

Recommendations

• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• Lock-free parallel dynamic programming
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• On a pattern sequencing problem to minimize the maximum number of open stacks
• scientific article; zbMATH DE number 5199104

Cited in

(11)

• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• On a pattern sequencing problem to minimize the maximum number of open stacks
• Optimal patchings for consecutive ones matrices
• A method for detecting symmetries in constraint models and its generalisation
• A biased random-key genetic algorithm for the minimization of open stacks problem
• Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
• Exploiting subproblem dominance in constraint programming
• Stackelberg Max Closure with Multiple Followers
• Mathematical models for the minimization of open stacks problem
• Lock-free parallel dynamic programming
• Domain-independent dynamic programming

This page was built for publication: Dynamic programming to minimize the maximum number of open stacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892372)