Publication:4139966
From MaRDI portal
zbMath0364.90067MaRDI QIDQ4139966
Publication date: 1977
90C10: Integer programming
90C05: Linear programming
90B99: Operations research and management science
Related Items
Multiechelon Lot Sizing: New Complexities and Inequalities, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, Modeling lotsizing and scheduling problems with sequence dependent setups, A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders, The production routing problem: a review of formulations and solution algorithms, Heuristics for the multi-item capacitated lot-sizing problem with lost sales, Relaxations for two-level multi-item lot-sizing problems, Influence of consumer purchasing behaviour on the production planning of perishable food, Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems, Approximation algorithms for supply chain planning and logistics problems with market choice, On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times, Integrated market selection and production planning: complexity and solution approaches, Classification and literature review of integrated lot-sizing and cutting stock problems, Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times, A comparison of heuristics and relaxations for the capacitated plant location problem, Intermediate integer programming representations using value disjunctions, Lagrangean relaxation based heuristics for lot sizing with setup times, A heuristic approach for big bucket multi-level production planning problems, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, Uncapacitated two-level lot-sizing, Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times, On stochastic dynamic programming for solving large-scale planning problems under uncertainty, A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment, A general quantity discount and supplier selection mixed integer programming model, The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs, Efficient and effective heuristics for the coordinated capacitated lot-size problem, Strong formulations for mixed integer programming: A survey, Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing, Dynamic lot-sizing with price changes and price-dependent holding costs, A linear description of the discrete lot-sizing and scheduling problem, Capacity expansion with alternative technology choices, Progress with single-item lot-sizing, A polyhedral study of the static probabilistic lot-sizing problem, Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case, MIP formulations and heuristics for two-level production-transportation problems, The one-warehouse multi-retailer problem: reformulation, classification, and computational results, An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times, The simple plant location problem: Survey and synthesis, A computational analysis of lower bounds for big bucket production planning problems, Multi-stage simultaneous lot-sizing and scheduling for flow line production, A capacitated lot sizing problem with stochastic setup times and overtime, HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry, A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure, An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging, Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products, Worst case analysis of relax and fix heuristics for lot-sizing problems, Pricing, relaxing and fixing under lot sizing and scheduling, Efficient reformulations for dynamic lot-sizing problems with product substitution, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, Lot-sizing with fixed charges on stocks: the convex hull, Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms, Fixed-charge transportation on a path: optimization, LP formulations and separation, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Reformulation by discretization: application to economic lot sizing, Lot sizing with inventory gains, On formulations of the stochastic uncapacitated lot-sizing problem, A class of stochastic programs with decision dependent uncertainty, Single item lot sizing problems, Approximate extended formulations, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, LS-LIB: A Library of Tools for Solving Production Planning Problems, Fixed-Charge Transportation on a Path: Linear Programming Formulations, Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
