Approximate dynamic programming algorithms for production-planning problems
The capacitated lot-sizing problem (CLSP) is a core problem for successfully reducing overall costs in any production process. The exact approaches proposed for solving the CLSP are based on two major methods: mixed-integer programming and dynamic programming. This thesis provides a new idea for app...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Wichita State University
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10057/10636 |