02052nam a2200253   450000500170000000800410001700800410005803500150009910000200011424500770013426000520021130000100026349000230027350001620029650200580045852009630051665000280147970000330150770000450154070000470158571000460163281000550167885600650173320260817172256.0               th                  eng  170398         th                  eng    a.b100246210 aYuen Poovarawan12aA case study on nxm job shop scheduling problem using heuristic approach  aBangkok :bAsian Institute of Technology,c1976  a77 p.1 aThesis ;vno. 1154  aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand  aThesis (M.Eng.) - Asian Institute of Technology, 1976  aThis study describes a heuristic algorithm for seeking a quick  and near optimal solution to the n jobs m machines job shop  scheduling problem in which each job 4as a number of operations to be performed on the specified machines in an ordering which are not the  same for all jobs. The model can handle different machines required sequences including l oops, job precedence structure and start- stop lag. The objective is to minimize the total operation time. The developed heuristic algorithm is an extensions of the heuristic rules of the jobs two machines scheduling problem.  At any instant during the n  operation the m machines problem can be converted into a two machine problem. One of this is the machine under consideration and the other machine represents the rest of the machines required by the job  through the first one. In this study, the model has been applied to solve a real-world problem. The results are observed to be sat is factory.  0aScheduling (Management)1 aSharif, M. N., eChairperson1 aPakorn Adulbhan, eExamination Committee0 aTechapun Raengkhum, eExamintion Committee2 aKasetsart University, eScholarship Donor2 aAsian Institute of Technology.tThesis ;vno. 1154  3Full-Textuhttp://203.159.5.9/ait-thesis/detail.php?q=B23919