Pages that link to "Item:Q1303540"
From MaRDI portal
The following pages link to Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540):
Displaying 27 items.
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Stochastic dynamic lot-sizing problem using bi-level programming base on artificial intelligence techniques (Q438013) (← links)
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times (Q439552) (← links)
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Capacitated lot-sizing with extensions: a review (Q926571) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- Discrete lot sizing and scheduling using product decomposition into attributes (Q1010282) (← links)
- Experiments with new stochastic global optimization search techniques (Q1571032) (← links)
- Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
- A capacitated lot sizing problem with stochastic setup times and overtime (Q1991273) (← links)
- Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach (Q2356184) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Infeasibility handling in genetic algorithm using nested domains for production planning (Q2655963) (← links)
- A heuristic procedure for the capacitated lot sizing problem with setup carry-over (Q2725165) (← links)
- Just-in-Time Planning and Lot-Sizing (Q2958674) (← links)
- Applying particle swarm optimisation to dynamic lot sizing with batch ordering (Q3055436) (← links)
- Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem (Q3055459) (← links)
- Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem (Q3157388) (← links)
- Mathematical programming model for centralised master planning in ceramic tile supply chains (Q3163199) (← links)
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times (Q3378819) (← links)
- Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point (Q3615552) (← links)
- A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test (Q3643081) (← links)
- Modeling industrial lot sizing problems: a review (Q5385468) (← links)
- Capacitated lot sizing with alternative routings and overtime decisions (Q5438625) (← links)
- Conceptual framework for lot-sizing and scheduling of flexible flow lines (Q5466729) (← links)
- (Q5482513) (← links)