Pages that link to "Item:Q3780738"

The following pages link to Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition (Q3780738):

Displaying 50 items.

• Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing (Q1374386) (← links)
• Progress with single-item lot-sizing (Q1390225) (← links)
• Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) (← links)
• Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification (Q1733088) (← links)
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
• MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results (Q1761836) (← links)
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs (Q1781573) (← links)
• Capacitated lot-sizing problem with outsourcing (Q1785408) (← links)
• Gainfree Leontief substitution flow problems (Q1802953) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• Inventory lot-sizing with supplier selection (Q1886723) (← links)
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) (← links)
• Lot sizing in capacitated production planning and control systems (Q1891872) (← links)
• Long range planning in the process industries: A projection approach (Q1919201) (← links)
• A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Multi-stage simultaneous lot-sizing and scheduling for flow line production (Q1936588) (← links)
• A note on splitting of variables in integer programming models (Q1972004) (← links)
• Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations (Q1993026) (← links)
• Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
• A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure (Q2273683) (← links)
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← 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)
• A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
• Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
• Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
• Lot sizing with inventory gains (Q2467450) (← links)
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
• Lot-sizing with production and delivery time windows (Q2492704) (← links)
• Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
• Multi-item dynamic production-distribution planning in process industries with divergent finishing stages (Q2496061) (← links)
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
• A user interactive heuristic procedure for solving the multiple product cycling problem (Q2563873) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Approximate extended formulations (Q2583138) (← links)
• Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
• Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
• A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times (Q2668748) (← links)