Pages that link to "Item:Q3392091"

The following pages link to Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems (Q3392091):

Displaying 31 items.

• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
• On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
• Using and extending fix-and-relax to solve maritime inventory routing problems (Q356520) (← links)
• A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
• Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) (← links)
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) (← links)
• Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming (Q839883) (← links)
• A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
• Solution approaches for the soft drink integrated production lot sizing and scheduling problem (Q1027560) (← links)
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
• Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
• Mixed integer programming based heuristics for the patient admission scheduling problem (Q1652186) (← links)
• Production planning with order acceptance and demand uncertainty (Q1652551) (← links)
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608) (← links)
• The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
• Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem (Q1734824) (← 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)
• An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories (Q2002849) (← links)
• Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← links)
• Pricing, relaxing and fixing under lot sizing and scheduling (Q2355959) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← 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)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
• The production planning problem of orders in small foundries (Q5214309) (← links)
• Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem (Q6189811) (← links)