Production Planning by Mixed Integer Programming
From MaRDI portal
Publication:5472085
DOI10.1007/0-387-33477-7zbMath1102.90039OpenAlexW1696146724MaRDI QIDQ5472085
Yves Pochet, Laurence A. Wolsey
Publication date: 14 June 2006
Published in: Springer Series in Operations Research and Financial Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-387-33477-7
Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Methods of successive quadratic programming type (90C55)
Related Items
An analysis of the integrated lot-sizing and cutting-stock problem formulation, On reformulations for the one-warehouse multi-retailer problem, On the computational complexity of uncapacitated multi-plant lot-sizing problems, Dynamic programming approximation algorithms for the capacitated lot-sizing problem, Decomposition and mean-field approach to mixed integer optimal compensation problems, A scatter search algorithm for the distributed permutation flowshop scheduling problem, Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem, Lot sizing with storage losses under demand uncertainty, Planning personnel retraining: column generation heuristics, Optimization-based heuristics for underground mine scheduling, Global optimization with spline constraints: a new branch-and-bound method based on B-splines, A polyhedral study of production ramping, A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand, Single item lot-sizing with non-decreasing capacities, Resource loading with time windows, A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations, DASH: dynamic approach for switching heuristics, A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry, Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system, A fix-and-optimize heuristic for the high school timetabling problem, Multi-product valid inequalities for the discrete lot-sizing and scheduling problem, Linear programming models for a stochastic dynamic capacitated lot sizing problem, The green capacitated multi-item lot sizing problem with parallel machines, A decomposition heuristic for a rich production routing problem, Multiscale production routing in multicommodity supply chains with complex production facilities, Mixed integer programming based heuristics for the patient admission scheduling problem, Partial objective inequalities for the multi-item capacitated lot-sizing problem, Production planning with order acceptance and demand uncertainty, Stochastic lot sizing problem with nervousness considerations, Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems, Pricing for production and delivery flexibility in single-item lot-sizing, Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies, On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay, Dynamic cost allocation for economic lot sizing games, Two-stage stochastic lot-sizing problem under cost uncertainty, Multiple machine continuous setup lotsizing with sequence-dependent setups, Relaxations for two-level multi-item lot-sizing problems, A computational analysis of lower bounds for big bucket production planning problems, Multi-stage simultaneous lot-sizing and scheduling for flow line production, Dynamic capacitated lot sizing with random demand and dynamic safety stocks, Multi-level single machine lot-sizing and scheduling with zero lead times, Single-item dynamic lot-sizing problems: an updated survey, Optimizing high-level nuclear waste disposal within a deep geologic repository, The value function of an infinite-horizon single-item lot-sizing problem, A multi-objective production smoothing model with compressible operating times, A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times, The dynamic bowser routing problem, A polyhedral study of lot-sizing with supplier selection, Projecting systems of linear inequalities with binary variables, A note on the split rank of intersection cuts, Column generation for extended formulations, Lot-sizing on a tree, Compact formulations as a union of polyhedra, The mixing-MIR set with divisible capacities, Facets for single module and multi-module capacitated lot-sizing problems without backlogging, Lot sizing with minimum order quantity, Tailored Lagrangian relaxation for the open pit block sequencing problem, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, A hybrid heuristic for a stochastic production-inventory-routing problem, Lagrangean relaxation based heuristics for lot sizing with setup times, A capacitated lot sizing problem with stochastic setup times and overtime, Operational extended model formulations for advanced planning and scheduling systems, Valid inequalities for the single arc design problem with set-ups, Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph, NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract, 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, Robust multicovers with budgeted uncertainty, A study of general and security Stackelberg game formulations, Polylithic modeling and solution approaches using algebraic modeling systems, Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost, Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching, MIP formulations and heuristics for two-level production-transportation problems, The one-warehouse multi-retailer problem: reformulation, classification, and computational results, Heuristic solutions to the long-term unit commitment problem with cogeneration plants, Heuristic approaches for master planning in semiconductor manufacturing, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, The item dependent stockingcost constraint, Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics, Encoding binary arithmetic operations in integer programming formulations, Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration, Convex hull results for generalizations of the constant capacity single node flow set, Mixing polyhedra with two non divisible coefficients, Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior, Preprocessing and cutting planes with conflict graphs, Robust formulations for economic lot-sizing problem with remanufacturing, Classification and literature review of integrated lot-sizing and cutting stock problems, On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times, Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic, Multi-item lot-sizing with joint set-up costs, A mixed integer programming model for solving real-time truck-to-door assignment and scheduling problem at cross docking warehouse, Uncapacitated lot sizing with backlogging: the convex hull, Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, Models for the schedule optimization problem at a public transit terminal, Heuristics and exact methods for number partitioning, The mixing set with divisible capacities: a simple approach, Efficient and effective heuristics for the coordinated capacitated lot-size problem, The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity, New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem, A multi‐period integrated planning and scheduling approach for developing energy systems, Split demand and deliveries in an integrated three-level lot sizing and replenishment problem, A criterion space decomposition approach to generalized tri-objective tactical resource allocation, A mixed integer programming model and solution method for the operation of an integrated water supply system, Linear integer programming model as mathematical ware for an optimal flow production planning system at operational scheduling stage, Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests, Optimal decision trees for the algorithm selection problem: integer programming based approaches, Regularized methods for a two-stage robust production planning problem and its sample average approximation, Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups, MIP heuristics for a resource constrained project scheduling problem with workload stability constraints, A heuristic algorithm to solve the one‐warehouse multiretailer problem with an emission constraint, A robust model for the lot-sizing problem with uncertain demands, Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry, Learning optimal solutions via an LSTM-optimization framework, Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem, Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear, Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings, Simultaneous lotsizing and scheduling problems: a classification and review of models, Tight MIP formulations for bounded up/down times and interval-dependent start-ups, Relax-fix-optimize heuristics for time-relaxed sports timetabling, A price-directed decomposition approach for solving large-scale capacitated part-routing problems, The optimal replenishment policy for time-varying stochastic demand under vendor managed inventory, A supervised learning-driven heuristic for solving the facility location and production planning problem, Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories, New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups, Unnamed Item, Efficient reformulations for dynamic lot-sizing problems with product substitution, Tree search for the stacking problem, Computing equilibria for integer programming games, Infeasibility handling in genetic algorithm using nested domains for production planning, Mathematical programming based heuristics for the 0--1 MIP: a survey, A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem, Assessing alternative production options for eco-efficient food supply chains using multi-objective optimization, Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty, Dantzig-Wolfe decomposition for the facility location and production planning problem, Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing, Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company, Integrated lot sizing and blending problems, A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem, Discrete multi-module capacitated lot-sizing problems with multiple items, A rolling-horizon approach for multi-period optimization, A decomposition heuristic for mixed-integer supply chain problems, Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity, Minimizing setups and waste when printing labels of consumer goods, Stronger upper and lower bounds for a hard batching problem to feed assembly lines, The Mixing Set with Divisible Capacities, A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging, Just-in-Time Planning and Lot-Sizing, Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem, The Steiner connectivity problem, LS-LIB: A Library of Tools for Solving Production Planning Problems, Multiechelon Lot Sizing: New Complexities and Inequalities, Integrated Supply Chain Management via Randomized Rounding, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, Strategic planning of an underground mine with variable cut-off grades, A note on the extension complexity of the knapsack polytope, A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing, Risk-averse two-stage stochastic programs in furniture plants, Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources, Manufacturer's mixed pallet design problem, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure, Extended formulations in combinatorial optimization, Aggregate production planning for process industries under oligopolistic competition, A lot-sizing and scheduling model for multi-stage flow lines with zero lead times, MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results, Multi-item uncapacitated lot sizing problem with inventory bounds, Mid-Term Model-Plant Allocation for Flexible Production Networks in the Automotive Industry, Extended formulations in combinatorial optimization, The integrated production-inventory-distribution-routing problem, Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing, 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, Monolithic versus hierarchical approach to integrated scheduling in a supply chain, Peak Shaving through Resource Buffering, Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure, The one-warehouse multiretailer problem with an order-up-to level inventory policy, Decomposing inventory routing problems with approximate value functions, Tactical optimization of the oil palm agribusiness supply chain, Heuristics for packing semifluids, A branch-and-cut algorithm for an assembly routing problem, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic, A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, Practical performance of an open pit mine scheduling model considering blending and stockpiling, A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales, Mixed Integer Linear Programming Formulation Techniques, Coordination of a two-level supply chain with contracts, A maritime inventory routing problem: Discrete time formulations and valid inequalities, A new heuristic and an exact approach for a production planning problem, Master production schedule using robust optimization approaches in an automobile second-tier supplier, A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage, Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities, The integrated lot sizing and cutting stock problem in an automotive spring factory, Formulations for an inventory routing problem, On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid, Incorporating the strength of MIP modeling in schedule construction, Reoptimization framework and policy analysis for maritime inventory routing under uncertainty, Analysis of models for the stochastic outpatient procedure scheduling problem, On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration, MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover, Unnamed Item, Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem, Lower bound on size of branch-and-bound trees for solving lot-sizing problem, Joint node selection and resource allocation for task offloading in scalable vehicle-assisted multi-access edge computing, Set characterizations and convex extensions for geometric convex-hull proofs, Robust inventory problem with budgeted cumulative demand uncertainty, Minimum concave cost flow over a grid network, Robust optimization for lot-sizing problems under yield uncertainty, Generalized relax-and-fix heuristic, The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases, Pricing, relaxing and fixing under lot sizing and scheduling, Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
