A heuristic approach for big bucket multi-level production planning problems
From MaRDI portal
Publication:958084
DOI10.1016/J.EJOR.2007.11.033zbMATH Open1160.90358OpenAlexW2026582326MaRDI QIDQ958084FDOQ958084
Recommendations
- A computational analysis of lower bounds for big bucket production planning problems
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- scientific article; zbMATH DE number 910793
Cites Work
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A cutting plane approach to capacitated lot-sizing with start-up costs
- A general heuristic for production planning problems
- A study of the lot-sizing polytope
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Approximate extended formulations
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Deterministic Production Planning: Algorithms and Complexity
- Dynamic version of the economic lot size model
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Improved Algorithms for Economic Lot Size Problems
- Local branching
- Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Modeling multiple stage manufacturing systems with generalized costs and capacity issues
- Modelling practical lot-sizing problems as mixed-integer programs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Octane: A New Heuristic for Pure 0–1 Programs
- On the polyhedral structure of a multi-item production planning model with setup times
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Production Planning by Mixed Integer Programming
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- The feasibility pump
- The uncapacitated lot-sizing problem with sales and safety stocks
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited In (30)
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- An efficient matheuristic for offline patient-to-bed assignment problems
- Generalized relax-and-fix heuristic
- Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Robust formulations for economic lot-sizing problem with remanufacturing
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
- Mixed integer programming based heuristics for the patient admission scheduling problem
- A general heuristic for production planning problems
- A computational analysis of lower bounds for big bucket production planning problems
- Predictive search for capacitated multi-item lot sizing problems
- Production planning with order acceptance and demand uncertainty
- Collaborative production planning of supply chain under price and demand uncertainty
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Using and extending fix-and-relax to solve maritime inventory routing problems
- Exact and meta-heuristic approaches for the production leveling problem
- Progressive selection method for the coupled lot-sizing and cutting-stock problem
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- Title not available (Why is no real title available?)
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
- A robust optimization model for multi-product two-stage capacitated production planning under uncertainty
This page was built for publication: A heuristic approach for big bucket multi-level production planning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958084)
