scientific article; zbMATH DE number 3568353
From MaRDI portal
Publication:4139966
zbMath0364.90067MaRDI QIDQ4139966
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Linear programming (90C05) Operations research and management science (90B99)
Related Items (75)
A linear description of the discrete lot-sizing and scheduling problem ⋮ Capacity expansion with alternative technology choices ⋮ Modeling lotsizing and scheduling problems with sequence dependent setups ⋮ New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups ⋮ Efficient reformulations for dynamic lot-sizing problems with product substitution ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Lot-sizing with fixed charges on stocks: the convex hull ⋮ 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 ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Strong formulations for mixed integer programming: A survey ⋮ 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 ⋮ Progress with single-item lot-sizing ⋮ Split demand and deliveries in an integrated three-level lot sizing and replenishment problem ⋮ 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 ⋮ 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 ⋮ LS-LIB: A Library of Tools for Solving Production Planning Problems ⋮ A polyhedral study of the static probabilistic lot-sizing problem ⋮ Approximation algorithms for supply chain planning and logistics problems with market choice ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Influence of consumer purchasing behaviour on the production planning of perishable food ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ The multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ Reformulation by discretization: application to economic lot sizing ⋮ Fixed-Charge Transportation on a Path: Linear Programming Formulations ⋮ Lot sizing with inventory gains ⋮ Intermediate integer programming representations using value disjunctions ⋮ Lagrangean relaxation based heuristics for lot sizing with setup times ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ 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 ⋮ HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry ⋮ On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times ⋮ 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 ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ On formulations of the stochastic uncapacitated lot-sizing problem ⋮ Integrated market selection and production planning: complexity and solution approaches ⋮ A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure ⋮ 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 ⋮ A class of stochastic programs with decision dependent uncertainty ⋮ Uncapacitated two-level lot-sizing ⋮ Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times ⋮ Robust formulations for economic lot-sizing problem with remanufacturing ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products ⋮ Polyhedral and Lagrangian approaches for lot sizing with production time windows and 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 ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing ⋮ The simple plant location problem: Survey and synthesis ⋮ Single item lot sizing problems ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem ⋮ Set characterizations and convex extensions for geometric convex-hull proofs ⋮ Dynamic lot-sizing with price changes and price-dependent holding costs ⋮ Approximate extended formulations ⋮ A comparison of heuristics and relaxations for the capacitated plant location problem ⋮ Pricing, relaxing and fixing under lot sizing and scheduling
This page was built for publication:
