000 03636nam a2200409 4500
005 20260818132437.0
008 170398 th eng
035 _a.b10030724
099 9 _aAIT Thesis no. 1121
100 1 _aHu, Kuan Kok
245 1 2 _aA GPSS-based simulation model for semi-dynamic job shop sequencing
260 _aBangkok :
_bAsian Institute of Technology,
_c1976
300 _a91 p.
490 1 _aThesis ;
_vno. 1121
500 _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand
502 _aThesis (M.Eng.) - Asian Institute of Technology, 1976
520 _aThis 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.
650 0 _aScheduling (Management)
_xData processing
700 0 _a Pakorn Adulbhan,
_eChairperson
700 0 _aDhira Phanumvanit,
_eCo-Chairperson
700 1 _aSharif, M. N.,
_eExamination Committee
710 2 _aGovernment of The Federal Republic of Germany,
_eScholarship Donor
810 2 _aAsian Institute of Technology.
_tThesis ;
_vno. 1121
856 _3Full-Text
_uhttp://203.159.5.9/ait-thesis/detail.php?q=B23191
907 _a.b10030724
_bmnait
_cx
902 _a251209
998 _b3
_c951012
_dm
_ea
_fx
_g2
945 _lmnait
945 _lmnait
945 _lmnarc
942 _c20
942 _c40
909 _aBarcode : 30050003022042
_bCREATED : 1994-05-16
_cRECORD # : i10014123
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050003022034
_bCREATED : 1994-05-16
_cRECORD # : i10014135
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050160087655
_bCREATED : 2016-04-05
_cRECORD # : i12970785
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c51533
_d51533