Pages that link to "Item:Q3635206"

The following pages link to Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows (Q3635206):

Displaying 50 items.

• Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator (Q331763) (← links)
• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
• A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
• Hybrid methods for lot sizing on parallel machines (Q342050) (← 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)
• 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)
• Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
• Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) (← links)
• Multi-level single machine lot-sizing and scheduling with zero lead times (Q621969) (← links)
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) (← links)
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (Q695342) (← links)
• Negotiation-based collaborative planning between supply chains partners (Q706860) (← links)
• Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum (Q732896) (← links)
• Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming (Q839883) (← 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)
• Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic (Q1010258) (← links)
• Setting safety stocks in multi-stage inventory systems under rolling horizon mathematical programming models (Q1017965) (← links)
• A hybrid optimization approach for multi-level capacitated lot-sizing problems (Q1042516) (← links)
• CMIT, capacitated multi-level implosion tool (Q1333500) (← links)
• The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← 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)
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
• An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
• MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
• An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times (Q1761844) (← links)
• Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs (Q1781573) (← links)
• A robust optimization model for multi-product two-stage capacitated production planning under uncertainty (Q1791463) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Managing procurement and production outsourcing under dynamic prices (Q1945977) (← links)
• Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
• Operations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with \textit{strokes} (Q2052979) (← links)
• A supervised learning-driven heuristic for solving the facility location and production planning problem (Q2140228) (← links)
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
• Worst case analysis of relax and fix heuristics for lot-sizing problems (Q2312339) (← 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)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• Lot sizing and furnace scheduling in small foundries (Q2456652) (← links)
• A rolling-horizon approach for multi-period optimization (Q2670577) (← links)
• Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources (Q2783988) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• Aggregate production planning in the automotive industry with special consideration of workforce flexibility (Q2967579) (← links)
• LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
• New lot sizing heuristics for demand and price uncertainties with service-level constraint (Q3163778) (← links)