Pages that link to "Item:Q1417600"

The following pages link to Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600):

Displaying 31 items.

• Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
• Multiple machine continuous setup lotsizing with sequence-dependent setups (Q616801) (← links)
• On discrete lot-sizing and scheduling on identical parallel machines (Q691392) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
• Lagrangean relaxation based heuristics for lot sizing with setup times (Q953424) (← links)
• Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times (Q991842) (← links)
• Knapsack problems with setups (Q1041933) (← links)
• Improved lower bounds for the capacitated lot sizing problem with setup times. (Q1417600) (← links)
• The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• A capacitated lot sizing problem with stochastic setup times and overtime (Q1991273) (← links)
• Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465) (← links)
• Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
• Approximate extended formulations (Q2583138) (← links)
• Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
• A rolling-horizon approach for multi-period optimization (Q2670577) (← links)
• A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times (Q2830951) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
• A computational comparison of cyclical and non-cyclical control for stochastic production-inventory systems (Q3055350) (← links)
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
• Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← 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)
• Modeling industrial lot sizing problems: a review (Q5385468) (← links)