000 03489nmm a2200313 a 4500
001 vtls000098444
003 KUKTEM
005 20251117113331.0
008 161214s2016 my fq d 001 0 eng d
020 _aTHE0005114(Local)
039 9 _a201905131515
_bhanafiah
_c201712261158
_dnazri
_y201612141028
_zsaini
040 _aUMP
090 _aFKP .A855 2016 r Bc.
090 _aCD 10445
100 0 _aAtikah Selamat
245 1 0 _aSimulation-based scheduling system at R2 Print Enterprise Kuantan
_h[electronic resource] /
_cAtikah Selamat
260 _aKuantan, Pahang :
_bUMP,
_c2016
300 _a1 computer disc :
_bdigital data ;
_c12 cm.
500 _aFaculty of Manufacturing Engineering
500 _aTheses Gred A
502 _aProject Paper (Bachelor of Engineering in Manufacturing Engineering (Hons.)) -- Universiti Malaysia Pahang – 2016
520 3 _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.
538 _aItem in PDF format
610 2 0 _aFaculty of Manufacturing Engineering
_xDissertations
650 0 _aUniversities and Colleges
_xDissertations
650 0 _aTheses
856 4 0 _uhttp://ecollib.ump.edu.my/id/eprint/4045
_zAccess in library only
999 _aVIRTUA40
_c6901
_d6907
999 _aVTLSSORT0080*0200*0400*0900*0901*1000*2450*2600*3000*5000*5001*5020*5200*5380*6100*6500*6501*8560*9992