Pages that link to "Item:Q3114820"
From MaRDI portal
The following pages link to Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation (Q3114820):
Displaying 36 items.
- Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (Q337527) (← links)
- Service level robustness in stochastic production planning under random machine breakdowns (Q421490) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups (Q539458) (← links)
- Supply chain management and advanced planning -- basics, overview and challenges (Q706848) (← links)
- Supply chain management in forestry -- case studies at Södra cell AB (Q706850) (← links)
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Production planning and warehouse management in supply networks with inter-facility mold transfers (Q884036) (← 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)
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times (Q1002081) (← links)
- Discrete lot sizing and scheduling using product decomposition into attributes (Q1010282) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Uncapacitated lot sizing with backlogging: the convex hull (Q1016115) (← links)
- The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model (Q1664892) (← links)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
- Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Operations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with \textit{strokes} (Q2052979) (← links)
- Pricing, relaxing and fixing under lot sizing and scheduling (Q2355959) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Lot sizing with inventory gains (Q2467450) (← links)
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
- Comparative approaches to equipment scheduling in high volume factories (Q2565775) (← links)
- Approximate extended formulations (Q2583138) (← links)
- Lead time considerations for the multi-level capacitated lot-sizing problem (Q2629719) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources (Q2997890) (← links)
- Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
- Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating (Q6091882) (← links)
- A graph-based decomposition method for convex quadratic optimization with indicators (Q6102761) (← links)