IJETSI

Title: OPTIMIZING MAKE-SPAN OF JOB SHOP SCHEDULING PROBLEMS THROUGH DISPATCHING RULES AND HEURISTIC ALGORITHMS (Case study: SHINTS ETP Garment Plc.)
Authors: Negash Lemma
\|\| \|\|
Negash Lemma MSc in Industrial Engineering, Post Graduate Program in Mechanical Engineering, School of Mechanical and Industrial Engineering, Addis Ababa Institute of Technology, Addis Ababa University
MLA 8 Lemma, Negash. "OPTIMIZING MAKE-SPAN OF JOB SHOP SCHEDULING PROBLEMS THROUGH DISPATCHING RULES AND HEURISTIC ALGORITHMS." IJETSI, vol. 5, no. 6, Nov.-Dec. 2019, pp. 285-296, ijetsi.org/more2019.php?id=23. Accessed Nov.-Dec. 2019. APA Lemma, N. (2019, November/December). OPTIMIZING MAKE-SPAN OF JOB SHOP SCHEDULING PROBLEMS THROUGH DISPATCHING RULES AND HEURISTIC ALGORITHMS. IJETSI, 5(6), 285-296. Retrieved from ijetsi.org/more2019.php?id=23 Chicago Lemma, Negash. "OPTIMIZING MAKE-SPAN OF JOB SHOP SCHEDULING PROBLEMS THROUGH DISPATCHING RULES AND HEURISTIC ALGORITHMS." IJETSI 5, no. 6 (November/December 2019), 285-296. Accessed November/December, 2019. ijetsi.org/more2019.php?id=23.
References [1]. E. W. S. H. Prof. Dr. Gamal M. Nawara, "Solving the Job-Shop Scheduling Problem by Arena," vol. 2 , no. 2, 2013. [2]. P. Y. o. M. E. B. Amr Arisha, "Job Shop Scheduling Problem: an Over view," Dublin, 2001. [3]. J. K. &. B. Eshetie, "JobShop Scheduling Problem for Machine Shop with Shifting," vol. 15, no. 1, 2015.. [4]. P. Dileepan and M. Ahmadi, "Scheduling rules for a small dynamic job-shop: a simulation approach," International Journal of Simulation Modeling, vol. 9, no. 4, pp. 173-183, 2010. [5]. A. K. Gupta and A. I. Sivakumar, "Job shop scheduling techniques in semiconductor manufacturing," International Journal of Advanced Manufacturing Technology , vol. 27 , no. 11-12, pp. 1163-1169, 2006. [6]. C. W. Rui Zhang, "Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm," vol. 188, Information Sciences, 2012. [7]. C. A. C. Antonin Ponsich, A hybrid Differential Evolution-Tabu Search algorithm for the solution of Job-Shop Scheduling Problems, Applied Soft Computing, vol. 13, 2013 [8]. Abbas Ebadi, "An optimal method for the preemptive job shop scheduling problem, Computers &," vol. 40, 2013, p. 13. [9]. N. M. a. A. Shahzad, "Correlation among tardiness-based measures for scheduling using priority dispatching rules," International Journal of Production Research, vol. 51, no. 12, p. 3688–3697, International Journal of Production Research. [10]. E. W. S. H. Prof. Dr. Gamal M. Nawara, "A Simulation Model for the Real-Life Job-Shop," vol. 2, no. 2, 2013. [11]. P. D. R. Z. Shantanu Kolharkar, "Scheduling in Job Shop Process Industry," Vols. 5Issue 1 (Jan. - Feb. 2013), PP 01-17, no. 1, 2013.
Abstract: Job shop scheduling is an Np-Hard combinatory in the field of scheduling problem. Due to this reason, SHINTS ETP Garment Company has faced a problem to determine the optimum sequences of jobs on machines that can optimize the make-span. The main purpose of this study is to minimize the make-span of the job shop production system of SHINTS ETP Garment Company production system by using dispatching rule and heuristics algorithm (shifting bottleneck algorithms). Secondary data was collected from the production log book of six work center (station) were considered during the production of six jobs. The findings of the shifting bottleneck algorithms showed that a 5% reduction for each machines (work center/station) in the total make-span of the company job shop production system. Moreover; the percentage utilization of work-station one, four and six are 55%, work-station two and three 49%, and that of work-station five 51% of their available time.

IJETSI is Member of