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 (only showing first 100 items - show all)
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
This page was built for publication: Production Planning by Mixed Integer Programming
