On the polyhedral structure of a multi-item production planning model with setup times
From MaRDI portal
Publication:1411623
DOI10.1007/s10107-002-0325-yzbMath1030.90022OpenAlexW2040143800MaRDI QIDQ1411623
Andrew J. Miller, Nemhauser, George I., Savelsbergh, Martin W. P.
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0325-y
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Deterministic network models in operations research (90B10)
Related Items
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, A cross entropy algorithm for the Knapsack problem with setups, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Partial objective inequalities for the multi-item capacitated lot-sizing problem, Heuristics for the multi-item capacitated lot-sizing problem with lost sales, A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem, A computational analysis of lower bounds for big bucket production planning problems, Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Fixed-charge transportation on a path: optimization, LP formulations and separation, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, The multi-item capacitated lot-sizing problem with setup times and shortage costs, A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times, A heuristic approach for big bucket multi-level production planning problems, Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs, An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging, Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over, Models and methods for capacitated lot-sizing problems, Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times, Sequence independent lifting for mixed integer programs with variable upper bounds, Lifting for mixed integer programs with variable upper bounds
