A General Heuristic for Production Planning Problems

DOI10.1287/ijoc.1030.0042zbMath1239.90043OpenAlexW2106773972MaRDI QIDQ2890430

Mathieu Van Vyve, Yves Pochet

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/50046b00bfd57502bd322dc74432125c424de23b

zbMATH Keywords

production planningheuristic branch and cutsetup times multilevel

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

A capacity scaling heuristic for the multicommodity capacitated network design problem, Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, 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, Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, MIPLIB 2003, A heuristic approach for big bucket multi-level production planning problems, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems, Cost-based decision-making in middleware virtualization environments, MIP formulations and heuristics for two-level production-transportation problems, MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs, Worst case analysis of relax and fix heuristics for lot-sizing problems

Uses Software

• NETGEN