000			03664nam a2200421 4500
005			20260818134557.0
008			030798 th eng
035			_a.b11408777
099		9	_aAIT Thesis no. IE-94-02
100	0		_aSuthad Sinsuesatkul
245	1	0	_aImprovement of forecasting and scheduling procedures in the Siam-Fibre Cement Company
260			_aBangkok : _bAsian Institute of Technology, _c1994
300			_a95 leaves
490	1		_aThesis ; _vno. IE-94-02
500			_aA thesis submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology
502			_aThesis (M.Eng.) - Asian Institute of Technology, 1994
520			_aThis study concerns with the production planning problem of a multi-product single-stage system of the Siam-Fibre Cement company. At first, the current practices of the company related to the production planning, forecasting, production planning, and scheduling are investigated. Then, practical and appropriate procedures to improve the efficiency are developed. Considering data availability and ease of implementation, two types of time series forecasting models, i.e., Winter's model and ARIMA model, are suggested. Data of company sale are divided into two data sets. The first data set is used for model developing and the second data set is used for model validation. Model evaluation is done by comparing the results of both models with current practice in terms of forecasting error measures. Both models give better results than those of current practice. For production planning, the current practice model uses linear programming to optimize total cost. All relevant costs are included in the model and the assumption of linear costs is also reasonable. Thus, it is not necessary to develop a new model. For the implementation period, the output of model indicates the products to be produced on a specific machine. Now, the final task is how to schedule these products on each machine to minimize setup time. The problem of machine scheduling is analogous to combinatorial problem known as the traveling salesman problem. This problem can be solved by mixed integer programming. However, considering ease of implementation, a heuristic is suggested for ease of solution, and implementation. Both the results of heuristic and traveling salesman algorithm yield the same optimum results.
650	1	0	_aScheduling (Management)
650	1	0	_aProduction planning
700	1		_aNagarur, Nagendra N., _eChairperson
700	1		_aPastijn, H., _eExamination Committee
700	1		_aKuehn, W., _eExamination Committee
710	2		_aThe Siam Cement Co., Ltd., _eScholarship Donor
810	2		_aAsian Institute of Technology. _tThesis ; _vno. IE-94-02
856			_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B15378
907			_a.b11408777 _bmnait _cs
902			_a240403
998			_b2 _c951104 _dm _ea _fs _g0
945			_lmnait
945			_lmnait
945			_lmnarc
942			_c20
942			_c40
909			_aBarcode : 30050003075594 _bCREATED : 1995-04-11 _cRECORD # : i11652056 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
909			_aBarcode : 30050120820542 _bCREATED : 1995-04-11 _cRECORD # : i11652068 _dLPATRON : 1010675 _eLCHKIN : 1999-04-18 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 1 _jTOT RENEW : 0
909			_aBarcode : 30050160074836 _bCREATED : 2016-04-22 _cRECORD # : i12950932 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
999			_c58717 _d58717