swMATH10663MaRDI QIDQ22621FDOQ22621
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=970256
Cited In (51)
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- An efficient matheuristic for offline patient-to-bed assignment problems
- Stochastic lot-sizing with backlogging: computational complexity analysis
- Title not available (Why is that?)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Perspectives on integer programming for time-dependent models
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
- Manufacturer's mixed pallet design problem
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- LS-LIB: a library of tools for solving production planning problems
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A computational analysis of lower bounds for big bucket production planning problems
- Efficient and effective heuristics for the coordinated capacitated lot-size problem
- Workforce planning in a lotsizing mail processing problem
- A supervised learning-driven heuristic for solving the facility location and production planning problem
- Predictive search for capacitated multi-item lot sizing problems
- A polyhedral study of multiechelon lot sizing with intermediate demands
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Capacitated lot-sizing with extensions: a review
- Integrated production planning and preventive maintenance in deteriorating production systems
- Mosel
- TSPTW
- Mlclsp
- Approximate extended formulations
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales
- MULTILSB
- LS-LIB
- bc-opt
- LOTSIZELIB
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- Dynamic knapsack sets and capacitated lot-sizing
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Hybrid methods for lot sizing on parallel machines
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- Tactical production and lot size planning with lifetime constraints: a comparison of model formulations
- A heuristic approach for big bucket multi-level production planning problems
- Cutting planes in integer and mixed integer programming
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Single item lot sizing problems
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Modelling practical lot-sizing problems as mixed-integer programs
- Period decompositions for the capacitated lot sizing problem with setup times
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
This page was built for software: bc-prod
