Pages that link to "Item:Q4202464"
From MaRDI portal
The following pages link to A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times (Q4202464):
Displayed 22 items.
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows (Q1278129) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
- A hybrid heuristic and linear programming approach to multi-product machine scheduling (Q1303542) (← links)
- The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050) (← links)
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (Q1610145) (← links)
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (Q1969833) (← links)
- Simultaneous lotsizing and scheduling problems: a classification and review of models (Q2362236) (← links)
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
- Dynamic nonlinear modelization of operational supply chain systems (Q2494311) (← links)
- Modeling of period overlapping setup times (Q2503060) (← links)
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources (Q2997890) (← links)
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems (Q3621930) (← links)
- A framework for modelling setup carryover in the capacitated lot sizing problem (Q4399025) (← links)
- Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity (Q5097082) (← links)
- Modeling industrial lot sizing problems: a review (Q5385468) (← links)
- Dual-based approach for a hub network design problem under non-restrictive policy (Q5938396) (← links)