AI SearchA comparative study on selected search techniques for solving production smoothing problems
Call Number: AIT Thesis no. IE-79-13 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. IE-79-13Publication details: Bangkok : Asian Institute of Technology, 1979Description: viii, 58 pSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1979 Summary: This study is directed at applying a more efficient mathematical programming method in solving the production scheduling problem. The Rosenbrock method of search and geometric programming approach (Blau algorithm) are tested by the objective function of the classic Holt, Modigliani, Muth and Simon's paint factory scheduling problem in a 20 dimension response surface and compare with that obtained by Hooke-Jeeves method of search. The two proposed methods demonstrate the ability to consistently descend to the neighborhood of the minimum function value reached. The two proposed techniques are then selected for incorporation into a multi- item formulation, of the production scheduling problem of an animal feeds factory, which solve for the production and inventory levels for individual items in future periods.
| 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 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. IE-79-13 (Browse shelf(Opens below)) | 1 | Available | 30050003070553 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no. IE-79-13 (Browse shelf(Opens below)) | 2 | Available | 30050003070561 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no. IE-79-13 (Browse shelf(Opens below)) | 1 | Available | 30050160011176 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
Thesis (M.Eng.) - Asian Institute of Technology, 1979
This study is directed at applying a more efficient mathematical programming method in solving the production scheduling problem. The Rosenbrock method of search and geometric programming approach (Blau algorithm) are tested by the objective function of the classic Holt, Modigliani, Muth and Simon's paint factory scheduling problem in a 20 dimension response surface and compare with that obtained by Hooke-Jeeves method of search. The two proposed methods demonstrate the ability to consistently descend to the neighborhood of the minimum function value reached. The two proposed techniques are then selected for incorporation into a multi- item formulation, of the production scheduling problem of an animal feeds factory, which solve for the production and inventory levels for individual items in future periods.
There are no comments on this title.