Pages that link to "Item:Q3802854"

The following pages link to Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review (Q3802854):

Displaying 50 items.

• Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities (Q336647) (← links)
• Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
• Multilevel capacitated lotsizing complexity and LP-based heuristics (Q811334) (← 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)
• Capacitated lot-sizing with extensions: a review (Q926571) (← links)
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight (Q971702) (← links)
• A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures (Q1017972) (← links)
• The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs (Q1025236) (← links)
• An improved heuristic for the capacitated lot-sizing problem (Q1042705) (← links)
• Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
• A simple heuristic for the multi-item single level capacitated lotsizing problem (Q1079109) (← links)
• A modified priority index for Günther's lot-sizing heuristic under capacited single stage production (Q1119459) (← links)
• A comparison of two lot sizing-sequencing heuristics for the process industry (Q1198320) (← links)
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic (Q1262203) (← links)
• Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
• Lot sizing for a product subject to obsolescence or perishability (Q1331602) (← 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)
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
• A heuristic method for lot-sizing in multi-stage systems (Q1370714) (← links)
• Learning complementarity and setup time reduction. (Q1406634) (← links)
• Solving mixed integer programming production planning problems with setups by shadow price information. (Q1406717) (← links)
• Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem (Q1734824) (← links)
• Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
• Multi-plant production planning in capacitated self-configuring two-stage serial systems (Q1806748) (← links)
• Randomized multi-level lot-sizing heuristics for general product structures. (Q1810504) (← links)
• The single-item lot-sizing problem with immediate lost sales (Q1873005) (← links)
• Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions (Q2241314) (← links)
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
• Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear (Q2358154) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
• Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost (Q3082694) (← links)
• A multi-class multi-level capacitated lot sizing model (Q3156677) (← links)
• Capacitated Multi-Item Lot-Sizing Problems with Time Windows (Q3392030) (← links)
• Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems (Q3392091) (← links)
• COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS (Q3392298) (← links)
• Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over (Q3636786) (← links)
• Heuristics for Multilevel Lot-Sizing with a Bottleneck (Q3730322) (← links)
• Performance of heuristics for the uncapacitated lot-size problem (Q4017556) (← links)
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times (Q4363634) (← links)
• Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups (Q4838215) (← links)
• A Heuristic for a Resource-capacitated Multi-stage Lot-sizing Problem with Lead Times (Q4864349) (← links)
• Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal (Q4905621) (← links)