Pages that link to "Item:Q1317050"
From MaRDI portal
The following pages link to The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050):
Displaying 20 items.
- The discrete lot-sizing and scheduling problem (Q582202) (← 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)
- 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)
- A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
- Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems (Q1357521) (← links)
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379) (← links)
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability (Q1577995) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Dual dynamic programming for linear production/inventory systems (Q1813749) (← links)
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (Q1969833) (← links)
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem (Q2393477) (← links)
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
- Just-in-Time Planning and Lot-Sizing (Q2958674) (← links)
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem (Q3806967) (← links)
- Some Extensions of the Discrete Lotsizing and Scheduling Problem (Q3982669) (← links)
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size (Q5388050) (← links)
- Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems (Q5451188) (← links)
