MINIMASI MAKESPAN PADA PERSOALAN PENJADWALAN ORDERED FLOWSHOP MENGGUNAKAN PSO

Rizki Habibi, Arie Candra Panjaitan, M Huda Firdaus

Abstract


The production scheduling problem is in the kind of flowshop with n jobs and m machines, to get the order of the schedule for allocating operations of the jobs to the available machines so as to get the minimum total time for completion of all job or commonly called makespan. This study uses an optimization technique approach with the PSO algorithm to get minimum makespan on the ordered flowhop scheduling problem. The performance of the scheduling algorithm presented is evaluated by testing on a benchmark data set of 240 variations in the combination number of jobs and machines. The minimum measure is obtained as a result of scheduling with PSO, whose process stops at a certain iteration when in the last 10 iterations there is no change in the value of a better makespan. The performance of the PSO algorithm is efficient at regular flow scheduling with the use of the most iterations of 19 iterations and the longest execution time of 28.42 seconds or less than half a minute, namely scheduling instances with the largest number of machines and jobs. In this research, only the analysis of the resulting minimal forward and the time of execution was carried out. Further research can be extended by not only measuring the minimum makespan, such as measuring total flowtime, total tardiness, and others.

Full Text:

PDF

References


Allahverdi, A., Aydilek, H. & Aydilek, A., (2018). No-Wait Flowshop Scheduling Problem With Two Criteria; Total Tardiness And Makespan.European Journal of Operational Research, Vol. 269(2), pp. 590–601.

Assia, S., El-Abbassi, I., El-Barkany, A., Darcherif, M., & El-Biyaali, A., (2020). Green Scheduling of Jobs and Flexible Periods of Maintenance in a Two-Machine Flowshop to Minimize Makespan, a Measure of Service Level and Total Energy Consumption. Advances in Operations Research, pp. 1–9.

Davendra, D., Zelinka, I., Bialic-Davendra, M., Senkerik, R., & Jasek, R., (2013). Discrete Self-Organising Migrating Algorithm For Flow-Shop Scheduling With No-Wait Makespan. Mathematical and Computer Modelling, Vol. 57, pp. 100–110.

Fernandez-Viagas, V., Ruiz, R. & Framinan, J. M., (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation.European Journal of Operational Research, Vol. 257(3), pp. 707–721.

Gao, Y.,Wang, J., Wu, W., Sangaiah, A.K., & Lim, S., (2019). A Hybrid Method For Mobile Agent Moving Trajectory Scheduling Using ACO and PSO in WSNs.Sensors (Switzerland), Vol. 19(3), pp. 1-19.

Gupta, J. N. D., Majumder, A. & Laha, D., (2020). Flowshop Scheduling With Artificial Neural Networks.Journal of the Operational Research Society, Vol. 71(10), pp. 1619–1637.

Habibi, R. (2017). Teknik Linierisasi Untuk Menyelesaikan Persoalan Rantai Suplai Lokasi-Inventori. Jurnal As-Salam, Vol. 1(1), pp. 44–55.

Hossain, M. S. , Asadujjaman, M. &Bhattacharya, P., (2014). Minimization of Makespan in Flow Shop Scheduling Using Heuristics. ICMIEE.

Ilić, A. (2015). On The Variable Common Due Date, Minimal Tardy Jobs Bicriteria Two-Machine Flow Shop Problem With Ordered Machines.Theoretical Computer Science, Vol, 582, pp. 70–73.

Khatami, M., Salehipour, A. & Hwang, F. J. (2019). Makespan Minimization For The M-Machine Ordered Flow Shop Scheduling Problem. Computers and Operations Research, Vol. 111, pp. 400–414.

Koulamas, C. & Panwalkar, S. S., (2015). Job Selection In Two-Stage Shops With Ordered Machines. Computers and Industrial Engineering, Vol. 88, pp. 350–353.

Mansur, (2014). Perancangan Sistem Informasi Penjadwalan Resource Perguruan Tinggi Menggunakan Metode Particle Swarm Optimization (PSO). Inovtek, Vol. 4, No. 2, pp. 75 – 86.

Muharni, Y., Febianti, E. & Sofa, N. N., (2019). Minimasi Makespan Pada Penjadwalan Flow Shop Mesin Paralel Produk Steel Bridge B-60 Menggunakan Metode Longest Processing Time Dan Particle Swarm Optimization. Journal Industrial Servicess, Vol. 4(2).

Panwalkar, S. S. & Koulamas, C., (2012). An O (N2) Algorithm For The Variable Common Due Date, Minimal Tardy Jobs Bicriteria Two-Machine Flow Shop Problem With Ordered Machines. European Journal of Operational Research, Vol. 221, Issue 1, pp. 7-13.

Panwalkar, S. S. & Koulamas, C. (2017). On The Dominance Of Permutation Schedules For Some Ordered And Proportionate Flow Shop Problems. Computers and Industrial Engineering, Vol. 107, pp. 105–108.

Panwalkar, S. S., Smith, M. L. &Koulamas, C., (2013). Review Of The Ordered And Proportionate Flow Shop Scheduling Research. Naval Research Logistics (NRL).

Rachman, A.R., Syarif, D., dan Sari, P.R., (2012). Analisa dan Penerapan MetodeParticle Swarm Optimization Pada Optimasi Penjadwalan Kuliah.Jurnal Teknik Informatika, Vol 1, No. 2.

Vallada, E., Ruiz, R., Framinan, J.M., (2015). New Hard Benchmark For Flowshop Scheduling Problems Minimising Makespan. European Journal of Operational Research, Vol. 240, No. 3, pp. 666–677.

Widyawati, W. (2018). Penerapan Algoritma Ant Colony Optimization (ACO) Pada Job Shop Scheduling Problem (JSSP) di PT. Siemens Indonesia (Cilegon Factory). Jurnal Sistem Informasi Dan Informatika (SIMIKA),Vol. 1(01), pp. 35-51.

Tuegeh, M., Soeprijanto & Purnomo, M. H., (2009). Modified Improved Particle Swarm Optimization For Optimal.Seminar Nasional Aplikasi Teknologi Informassi 2009 (SNATI 2009), pp. 85–90.




DOI: https://doi.org/10.30743/mes.v6i2.3728

Refbacks

  • There are currently no refbacks.