The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
From MaRDI portal
Publication:3730326
DOI10.1287/mnsc.32.3.350zbMath0596.90043OpenAlexW2101708224MaRDI QIDQ3730326
Hirofumi Matsuo, Gabriel R. Bitran
Publication date: 1986
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.32.3.350
heuristicserror boundsapproximate solutionproduction planningapproximation schemeworst case analysismulti-item lot size problemoptimal basis solutionvariable capacity problem with overtime
Applications of mathematical programming (90C90) Linear programming (90C05) Production models (90B30)
Related Items
Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Hybrid methods for lot sizing on parallel machines, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, Predictive Search for Capacitated Multi-Item Lot Sizing Problems, A computational analysis of lower bounds for big bucket production planning problems, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly, Capacitated lot-sizing and scheduling by Lagrangean relaxation, Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior, Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost, Multi-level, single-machine lot sizing and scheduling (with initial inventory), Facets and algorithms for capacitated lot sizing, Heuristic methods and applications: A categorized survey, Single item lot sizing problems, A polynomial algorithm for a multi-item capacitated production planning problem, Multilevel capacitated lotsizing complexity and LP-based heuristics
