The following pages link to (Q4900538):
Displaying 9 items.
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) (← links)
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) (← links)
- Lot-sizing and scheduling for flexible flow lines. (Q1880675) (← links)
- A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups (Q2115789) (← links)
- Optimizing multiple qualifications of products on non-identical parallel machines (Q2147099) (← links)
- Multi-objective Pareto adaptive algorithm for capacitated lot-sizing problems in glass lens production (Q2294977) (← links)
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs (Q2483511) (← links)
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over (Q3636786) (← links)
