bc-prod

swMATH10663MaRDI QIDQ22621FDOQ22621

Author name not available (Why is that?)

Cited In (44)

• Predictive Search for Capacitated Multi-Item Lot Sizing Problems
• 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
• Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
• 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
• Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
• Manufacturer's mixed pallet design problem
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
• 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
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
• Workforce planning in a lotsizing mail processing problem
• A supervised learning-driven heuristic for solving the facility location and production planning problem
• 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
• Approximate extended formulations
• LS-LIB: A Library of Tools for Solving Production Planning Problems
• A bucket indexed formulation for nonpreemptive single machine scheduling problems
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales
• 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
• 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
• A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Single item lot sizing problems
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• The multi-item capacitated lot-sizing problem with setup times and shortage costs

This page was built for software: bc-prod