A comparative study on selected search techniques for solving production smoothing problems
- Bangkok : Asian Institute of Technology, 1979
- viii, 58 p.
- Thesis ; no. IE-79-13 .
- Asian Institute of Technology. Thesis ; no. IE-79-13 .
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.