03636nam a2200409 4500 20260818132437.0 170398 th eng .b10030724 AIT Thesis no. 1121 Hu, Kuan Kok A GPSS-based simulation model for semi-dynamic job shop sequencing Bangkok : Asian Institute of Technology, 1976 91 p. Thesis ; no. 1121 A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand Thesis (M.Eng.) - Asian Institute of Technology, 1976 This study utilized a special simulation language, the General Purpose Simulation System V (GPSS V), as a basic tool to develop a computer-based model for solving a general M-machine-by-N-job sequencing problem. By taking advantage of the built-in features of GPSS V, the model developed can tackle cases where there is more than one unit of machine in an individual machine group. Two main dispatching rules have been incorporated into a single program: (a) the shortest processing time dispatching rule, which has been claimed as a 'standard' dispatching rule; (b) the longest processing time dispatching rule, which is the main dispatching rule used in the industry. In view of the fact that the processing times are not always deterministic, the developed model also takes care of the condition when there exists the need to process a job over the same machine more than once. Subprograms for plotting the Gantt charts are written in FORTRAN and incorporated into the model in order to illustrate the result graphically for the use of the management. The model appears to be comprehensive and flexible. In order to illustrate the practicability of the model, a case study in sequencing in an electrical appliance firm is conducted, The results provide the cases of using: (a) the dispatching rule of shortest processing time with deterministic servicing time, (b) the dispatching rule of longest processing time with deterministic servicing time, (c) the dispatching rule of shortest processing time with exponential servicing time, (d) the dispatching rule of longest processing time with exponential servicing time. The examples given illustrate and justify the validity of the methodology in the real world situation. Scheduling (Management) Data processing Pakorn Adulbhan, Chairperson Dhira Phanumvanit, Co-Chairperson Sharif, M. N., Examination Committee Government of The Federal Republic of Germany, Scholarship Donor Asian Institute of Technology. Thesis ; no. 1121 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B23191 .b10030724 mnait x 251209 3 951012 m a x 2 mnait mnait mnarc 20 40 Barcode : 30050003022042 CREATED : 1994-05-16 RECORD # : i10014123 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050003022034 CREATED : 1994-05-16 RECORD # : i10014135 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050160087655 CREATED : 2016-04-05 RECORD # : i12970785 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 51533 51533 0 0 0 0 MAIN MAIN mnait 2026-08-18 10.00 0 AIT Thesis no. 1121 30050003022042 2026-08-18 13:24:37 2 2026-08-18 20 0 0 0 0 MAIN MAIN mnait 2026-08-18 10.00 0 AIT Thesis no. 1121 30050003022034 2026-08-18 13:24:37 1 2026-08-18 20 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Thesis no. 1121 30050160087655 2026-08-18 13:24:37 2026-08-18 40