03631nmm a2200325 a 4500001001400000003000700014005001700021008004100038020002200079039006900101040000800170090002500178090001300203100001900216245011100235260003400346300004600380500004100426500001800467502012000485520223400605538002302839610005602862650004502918650001102963856006902974952013003043999002503173999010703198vtls000098444KUKTEM20251117113331.0161214s2016    my     fq  d  001 0 eng d  aTHE0005114(Local) 9a201905131515bhanafiahc201712261158dnazriy201612141028zsaini  aUMP  aFKP .A855 2016 r Bc.  aCD 104450 aAtikah Selamat10aSimulation-based scheduling system at R2 Print Enterprise Kuantanh[electronic resource] /cAtikah Selamat  aKuantan, Pahang :bUMP,c2016  a1 computer disc :bdigital data ;c12 cm.  aFaculty of Manufacturing Engineering  aTheses Gred A  aProject Paper (Bachelor of Engineering in Manufacturing Engineering (Hons.)) -- Universiti Malaysia Pahang – 20163 aThis thesis deals with decision support tool for dynamic job shop scheduling at R2 Print Enterprise, Kuantan. The objective of this thesis is to understand the job shop production in dynamic environment, to develop scheduling system based on real-time data and to implement it in R2 Print Enterprise. The thesis describes the scheduling techniques with aim to delivering jobs on time and can adapt to the rush orders. Here, a printing company with two different jobs are modelled in Arena Simulation Software to study the suitable scheduling heuristic rules to be implemented to the problems. The main heuristic rules studied in this thesis are First In First Out (FIFO), Earliest Due Date (EDD), Shortest Processing Time (SPT) and Longest Processing Time (LPT). The performance measures taken in this research are the Total Average Time Delays, Total Average Product Delays, Total Product Flow Times and the Resource Utilizations. The Large Format Product (LFP) job considered n = 6 products and m = 4 work centers (6x4) while the Paper Product (PP) job considered n = 7 products and m = 3 work centers (7x3). The product sequence and processing time are dependent on each other. The sequence length can vary from three to four operations and there is no flexibility on the sequence. The model is run for 5 days with 9 hours operation time per day. The obtained results indicate that in LFP job, there is no single rule which dominates the others although EDD seems to be more effective than other rules.The summarized results show that the best scheduling rules for Total Time Delays is SPT, for Total Product Delays is EDD, for Total Flow Times is EDD the best scheduling rules for Resource Utilization is SPT. In PP job, there is also no dominant single rule that clearly dominant although the most successing rules are those with short processing times. The summarized results indicate that the best scheduling rules for Total Time Delays is EDD. For Total Product Delays are FIFO and EDD, for Total Flow Times is SPT and for Resource Utilization, the best scheduling rule is SPT, FIFO, LPT and EDD as they give equal results. The results can significantly reduce the time to produce and reduce the delay in delivering jobs.  aItem in PDF format20aFaculty of Manufacturing EngineeringxDissertations 0aUniversities and CollegesxDissertations 0aTheses40uhttp://ecollib.ump.edu.my/id/eprint/4045zAccess in library only  00104071a20000b20000d2019-09-04l0oFKP .A855 2016 r Bc. | CD 10445p0000115960r2019-09-04 00:00:00t1w2019-09-04yPSM  aVIRTUA40c6901d6907  aVTLSSORT0080*0200*0400*0900*0901*1000*2450*2600*3000*5000*5001*5020*5200*5380*6100*6500*6501*8560*9992