bc-prod
From MaRDI portal
Software:22621
No author found.
Related Items (44)
A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis) ⋮ A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Heuristics for the multi-item capacitated lot-sizing problem with lost sales ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging ⋮ Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ Dynamic knapsack sets and capacitated lot-sizing ⋮ LS-LIB: A Library of Tools for Solving Production Planning Problems ⋮ Unnamed Item ⋮ Capacitated lot-sizing with extensions: a review ⋮ Integrated production planning and preventive maintenance in deteriorating production systems ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ Manufacturer's mixed pallet design problem ⋮ The multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ 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 ⋮ An efficient matheuristic for offline patient-to-bed assignment problems ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ Perspectives on integer programming for time-dependent models ⋮ On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times ⋮ An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times ⋮ Stochastic lot-sizing with backlogging: computational complexity analysis ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ Cutting planes in integer and mixed integer programming ⋮ A Backward Sampling Framework for Interdiction Problems with Fortification ⋮ MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ Workforce planning in a lotsizing mail processing problem ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems ⋮ Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs ⋮ Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation ⋮ bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems ⋮ Single item lot sizing problems ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem ⋮ Approximate extended formulations ⋮ A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
This page was built for software: bc-prod
