Pages that link to "Item:Q1411623"
From MaRDI portal
The following pages link to On the polyhedral structure of a multi-item production planning model with setup times (Q1411623):
Displayed 26 items.
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
- Models and methods for capacitated lot-sizing problems (Q1029562) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← 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)
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs (Q1781573) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem (Q2171582) (← links)
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
- Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (Q3598683) (← links)
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over (Q3636786) (← links)
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)