Open Access'n Vergelyking van die resultate van vier rekenaarsoekmetodes vir taktiese produksiebeplanning
Author(s) -
J. T. Meij
Publication year - 1982
Publication title -
south african journal of business management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.179
H-Index - 15
eISSN - 2078-5976
pISSN - 2078-5585
DOI - 10.4102/sajbm.v13i3.1189
Subject(s) - production (economics) , production planning , planner , operations research , milestone , constraint (computer aided design) , computer science , order (exchange) , operations management , mathematics , economics , microeconomics , artificial intelligence , history , finance , geometry , archaeology
A comparison of the results of four computer search-models for production planning Many production managers are faced with the problem of planning production, inventory and workforce under the constraint of limited resources to meet a seasonal demand. Considerable research has been done on this planning problem and various models have been proposed. The linear decision rule (LDR), especially as applied to the well-known Paint Shop, represents a milestone in the development of such models and serves as a standard against which the performances of many other models are measured. In this paper a comparison is made between the LDR results and that of three computer search models, SDR, CONMIN and SUMT for the Paint Shop. Two different cost structures are used for the Paint Shop - the original structure developed by Holt et al. (a quadratic approximation to the costs of the Shop) and a ficticious fourth-order cost structure published by Goodman. The results of this study indicate that in cases where the cost structure is non-linear, the computer search techniques can be of some help to the production planner.