An algorithm for the serial capacitated economic lot-sizing problem with non-speculative costs and stationary capacities
We address the serial capacitated economic lot-sizing problem under particular assumptions on the costs and the capacity pattern. We prove that when the involved costs are non-speculative with respect to the transfer to future periods and the capacity pattern is stationary for all levels, the optima...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | report |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.12008/3451 |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: An algorithm for the serial capacitated economic lot-sizing problem with non-speculative costs and stationary capacities
- An analysis of the economic lot-sizing problem with return options focused on the remanufacturing plan
- Multistage stochastic capacitated discrete lot-sizing with lead times: problem definition, complexity analysis and tighter formulations
- Bioimpedance plethysmography with capacitive electrodes and sole force sensors : Comparative trial
- New Security Architecture for IoT Network
- 1. (Medium-sized) Cities and communication: intersections, knots and apertures
- Scaling of biological rates with body size as a backbone in the assembly of metacommunity biodiversity