Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

DOI10.1287/OPRE.35.6.832MaRDI QIDQ3780738zbMATH OpenOpenAlexFDO

Authors Gary D. Eppen, Kipp Martin

Publication date 1987

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.35.6.832

zbMATH Keywords

linear programming relaxationmulti-item capacitated lot-sizingrealistic-sized production schedulingvariable redefinition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing

Cited in

(only showing first 100 items - show all)

• Multi-item lot-sizing with joint set-up costs
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
• Efficient and effective heuristics for the coordinated capacitated lot-size problem
• Lot-size models with backlogging: Strong reformulations and cutting planes
• Primal-dual approach to the single level capacitated lot-sizing problem
• Applying a modified coefficient reduction method to a dynamic production scheduling model
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Lot-sizing polyhedra with a cardinality constraint
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
• Two mixed integer programming formulations arising in manufacturing management
• Valid inequalities and facets of the capacitated plant location problem
• The splitting of variables and constraints in the formulation of integer programming models
• The coordinated replenishment dynamic lot-sizing problem with quantity discounts
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• An extended formulation approach to the edge-weighted maximal clique problem
• Lot sizing and scheduling -- survey and extensions
• A technique for speeding up the solution of the Lagrangean dual
• The stochastic dynamic product cycling problem
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• A new heuristic approach for the multi-item dynamic lot sizing problem
• A linear description of the discrete lot-sizing and scheduling problem
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm
• Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
• Progress with single-item lot-sizing
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Heuristic genetic algorithms for general capacitated lot-sizing problems
• Partial objective inequalities for the multi-item capacitated lot-sizing problem
• Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
• 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
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
• Capacitated lot-sizing problem with outsourcing
• Gainfree Leontief substitution flow problems
• Facets and algorithms for capacitated lot sizing
• Inventory lot-sizing with supplier selection
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
• Lot sizing in capacitated production planning and control systems
• Long range planning in the process industries: A projection approach
• A binary-rounding heuristic for multi-period variable-task-duration assignment problems
• A computational analysis of lower bounds for big bucket production planning problems
• Multi-stage simultaneous lot-sizing and scheduling for flow line production
• A note on splitting of variables in integer programming models
• Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations
• Robust formulations for economic lot-sizing problem with remanufacturing
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• 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 and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• Simultaneous lotsizing and scheduling problems: a classification and review of models
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• A cross entropy algorithm for the Knapsack problem with setups
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
• Reformulation by discretization: application to economic lot sizing
• Single item lot-sizing problem for a warm/cold process with immediate lost sales
• Lot sizing with inventory gains
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
• Lot-sizing with production and delivery time windows
• Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
• Multi-item dynamic production-distribution planning in process industries with divergent finishing stages
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
• A user interactive heuristic procedure for solving the multiple product cycling problem
• Single item lot sizing problems
• Approximate extended formulations
• Dantzig-Wolfe decomposition for the facility location and production planning problem
• Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
• A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times
• An exact solution approach for the inventory routing problem with time windows
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times
• 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
• The economic lot-sizing problem with an emission capacity constraint
• Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
• Modelling practical lot-sizing problems as mixed-integer programs
• MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups
• A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry
• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
• The production routing problem: a review of formulations and solution algorithms
• Hybrid methods for lot sizing on parallel machines
• Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
• On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
• Period decompositions for the capacitated lot sizing problem with setup times
• Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
• An optimal multi-machine replacement policy in a serially dependent production system
• Tactical production and lot size planning with lifetime constraints: a comparison of model formulations
• Progressive selection method for the coupled lot-sizing and cutting-stock problem
• Uncapacitated lot-sizing with buying, sales and backlogging
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
• An integrated model for inventory and production planning in a two-stage hybrid production system
• scientific article; zbMATH DE number 2084779 (Why is no real title available?)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
• Predictive search for capacitated multi-item lot sizing problems

This page was built for publication: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

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