Pages that link to "Item:Q3458742"

The following pages link to Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742):

Displaying 29 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)
• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (Q695342) (← 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)
• 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)
• Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608) (← links)
• Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← 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 MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times (Q1761844) (← links)
• Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
• Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories (Q2140332) (← links)
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
• Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
• Integrated lot sizing and blending problems (Q2668689) (← links)
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← 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)
• Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach (Q3087842) (← links)
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes (Q3114864) (← links)
• Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem (Q3562403) (← links)
• Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations (Q4595321) (← 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)
• Multi-item capacitated lot-sizing problems with setup times and pricing decisions (Q5189247) (← links)
• New construction heuristic for capacitated lot sizing problems (Q6096617) (← links)
• A heuristic approach for the integrated production-transportation problem with process flexibility (Q6551098) (← links)