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.

• The economic lot-sizing problem with an emission capacity constraint (Q299782) (← links)
• A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry (Q336374) (← links)
• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
• Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items (Q342353) (← links)
• On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
• A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
• On discrete lot-sizing and scheduling on identical parallel machines (Q691392) (← links)
• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (Q695342) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing (Q922926) (← links)
• Capacitated lot-sizing with extensions: a review (Q926571) (← links)
• Compact formulations as a union of polyhedra (Q927156) (← links)
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← 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)
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight (Q971702) (← links)
• Uncapacitated two-level lot-sizing (Q991455) (← links)
• Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times (Q991842) (← links)
• A multi-item inventory model for deteriorating items under inflation and permissible delay in payments with exponential declining demand (Q998690) (← links)
• Integrated inventory model for similar products under a two-echelon supply chain environment: an empirical study (Q998715) (← links)
• Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
• Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
• Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
• Primal-dual approach to the single level capacitated lot-sizing problem (Q1178641) (← links)
• Applying a modified coefficient reduction method to a dynamic production scheduling model (Q1197923) (← links)
• Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
• Lot-sizing polyhedra with a cardinality constraint (Q1198618) (← links)
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
• Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
• Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
• The splitting of variables and constraints in the formulation of integer programming models (Q1278148) (← links)
• The coordinated replenishment dynamic lot-sizing problem with quantity discounts (Q1278282) (← links)
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing (Q1278343) (← links)
• An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
• Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• The stochastic dynamic product cycling problem (Q1330541) (← links)
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures (Q1331603) (← links)
• A new heuristic approach for the multi-item dynamic lot sizing problem (Q1331607) (← links)
• A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)