Pages that link to "Item:Q1331605"
From MaRDI portal
The following pages link to Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605):
Displaying 15 items.
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- Unbounded batch scheduling with a common due window on a single machine (Q611087) (← links)
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
- Single machine group scheduling with resource dependent setup and processing times (Q707136) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711) (← links)
- Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Scheduling the production of two-component jobs on a single machine (Q1969827) (← links)
- Subcontracting and lot-sizing with constant capacities (Q2133416) (← links)
- Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION (Q3634181) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- Combined replenishment and warehousing with contract commitments and flexibilities (Q6053128) (← links)
