02095nas|a2200241 i 450000500170000000800410001703500150005810000260007324500530009926000520015230000270020449000520023150001520028350200840043552009440051965000260146370000340148970000490152370000530157271000790162581000840170485600650178820260818153620.0121095s1983 th uu m rtt 00| a1eng d a.b104059751 aTzen, Ya-juei Jeffrey10aLoading problem in flexible manufacturing system aBangkok :bAsian Institute of Technology,c1983 a1 v. (various pagings)1 aResearch studies project report ;vno. IE-83-20 aA research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology aResearch Studies Project Report (M. Eng.) - Asian Institute of Technology, 1983 aScheduling problem in a flexible manufacturing system (FMS ) is considered to be a composite of two interdependent tasks: loading and sequencing. This study provides two formulations for the loading problem in a random FMS: (i) minimization of system unbalance, (ii) minimization of system unbalance and the number of late jobs. Both the formulations include the constraints such as the number of tool slots, unique routing, non-splitting of jobs, and machine capacity. Heuristic methods corresponding to each formulation are developed. The performance of the heuristics is demonstrated for a hypothetical FMS by comparing the solution results with those given by exact solution technique using MIP/370. The GPSS V is then used to simulate the system for investigating the system performance for the problem of minimizing the system unbalance using the heuristic and sequential loading methods in conjunction with four dispatching rules.  0aLoading and unloading1 aShanker, Kripa, eChairperson1 aTabucanon, Mario T., eExamination Committee1 aOudheusden, Dirk L. Van, eExamination Committee2 aBES Engineering Corporation Taiwan, Republic of China, eScholarship Donor2 aAsian Institute of Technology.tResearch studies project report ;vno. IE-83-20 3Full-Textuhttp://203.159.5.9/ait-thesis/detail.php?q=B20902