AI SearchConcave cost capacitated network flows and multi-period lotsizing problems with uncertain demands
Call Number: AIT Diss. no. IE-90-01 Material type:
SeriesSeries: Asian Institute of Technology. Dissertation ; no. IE-90-01Publication details: Bangkok : Asian Institute of Technology, 1990Description: 105 pSubject(s): Online resources: Dissertation note: Thesis (Ph.D.) - Asian Institute of Technology, 1990 Summary: The dissertation considers am ultiperiod lotsizing problem on a complex production or inventory system where demaqds are random. The problem is formulated as a stochastic network flow model which also incorporates service level constraints. The model is approximated with a capacitated and deterministic network flow problem with concave cost function. A scaling method is proposed to solve this approximate flow problem. The method is efficient and produces an exact local optimum flow. The Lagrange relaxation method is also applied to find lower bounds for the optimum system cost. As an application, a stochastic coordinated multi-item lotsizing problem is considered and .solved. Some computation experiments are carried out, showing the efficiency of the new methods in handling practical problems.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library Archives | AIT Diss. no. IE-90-01 (Browse shelf(Opens below)) | 3 | Available | 30050120595565 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Diss. no. IE-90-01 (Browse shelf(Opens below)) | 1 | Available | 30050160002902 | |||||||||||||
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Diss. no. IE-90-01 (Browse shelf(Opens below)) | 1 | Available | 30050121037104 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Diss. no. IE-90-01 (Browse shelf(Opens below)) | 2 | Available | 30050121037088 |
A dissertation submitted in partial fulfilment of the requirements for the degree of Doctor of Technical Sciences, School of Engineering and Technology
Thesis (Ph.D.) - Asian Institute of Technology, 1990
The dissertation considers am ultiperiod lotsizing problem on a complex production or inventory system where demaqds are random. The problem is formulated as a stochastic network flow model which also incorporates service level constraints. The model is approximated with a capacitated and deterministic network flow problem with concave cost function. A scaling method is proposed to solve this approximate flow problem. The method is efficient and produces an exact local optimum flow. The Lagrange relaxation method is also applied to find lower bounds for the optimum system cost. As an application, a stochastic coordinated multi-item lotsizing problem is considered and .solved. Some computation experiments are carried out, showing the efficiency of the new methods in handling practical problems.
There are no comments on this title.