Pages that link to "Item:Q3114714"
From MaRDI portal
The following pages link to Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs (Q3114714):
Displaying 50 items.
- LOTSIZELIB (Q42648) (← links)
- Modeling lotsizing and scheduling problems with sequence dependent setups (Q297372) (← links)
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638) (← links)
- Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
- Multi-level single machine lot-sizing and scheduling with zero lead times (Q621969) (← links)
- On discrete lot-sizing and scheduling on identical parallel machines (Q691392) (← links)
- Using aggregation to optimize long-term production planning at an underground mine (Q852993) (← 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)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← 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)
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty (Q1010297) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Parameter controlled instance generation for lot sizing problems (Q1969543) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- The item dependent stockingcost constraint (Q2009188) (← links)
- Planning production and workforce in a discrete-time financial model using scenarios modeling (Q2226492) (← links)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry (Q2256197) (← links)
- Linear optimal control strategies for production systems with a discrete-event demand pattern (Q2256890) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- The profit maximizing capacitated lot-size (PCLSP) problem (Q2432891) (← links)
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- Multi-item dynamic production-distribution planning in process industries with divergent finishing stages (Q2496061) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- Lead time considerations for the multi-level capacitated lot-sizing problem (Q2629719) (← links)
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← links)
- A bucket indexed formulation for nonpreemptive single machine scheduling problems (Q2806861) (← links)
- Just-in-Time Planning and Lot-Sizing (Q2958674) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation (Q3114820) (← links)
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
- On the lot-type design problem (Q3562396) (← links)
- Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems (Q3637368) (← links)
- An Integer Programming Approach to the Apparel Sizing Problem (Q3740526) (← links)
- Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations (Q4595321) (← links)
- Campaign planning in time-indexed model formulations (Q4671374) (← links)
