Pages that link to "Item:Q3351124"

The following pages link to Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes (Q3351124):

Displaying 45 items.

• Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
• Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
• Integrated inventory model for similar products under a two-echelon supply chain environment: an empirical study (Q998715) (← links)
• On stochastic dynamic programming for solving large-scale planning problems under uncertainty (Q1010297) (← links)
• Uncapacitated lot sizing with backlogging: the convex hull (Q1016115) (← links)
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing (Q1278343) (← links)
• Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
• MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
• Coordination of production and distribution planning (Q1328573) (← links)
• The stochastic dynamic product cycling problem (Q1330541) (← links)
• On practical resource allocation for production planning and scheduling with period overlapping setups (Q1331600) (← links)
• CMIT, capacitated multi-level implosion tool (Q1333500) (← links)
• A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
• Progress with single-item lot-sizing (Q1390225) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs (Q1781573) (← links)
• Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem (Q2171582) (← links)
• Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure (Q2242374) (← links)
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
• Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach (Q2356184) (← links)
• Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• Sawing planning using a multicriteria approach (Q2379779) (← links)
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
• Capacitated replenishment and disposal planning for multiple products with resalable returns (Q2393488) (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
• Multi-item dynamic production-distribution planning in process industries with divergent finishing stages (Q2496061) (← links)
• A user interactive heuristic procedure for solving the multiple product cycling problem (Q2563873) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (Q3598683) (← links)
• A framework for modelling setup carryover in the capacitated lot sizing problem (Q4399025) (← links)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
• METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES (Q5315988) (← links)
• Robust optimization applied to uncertain production loading problems with import quota limits under the global supply chain management environment (Q5478835) (← links)