Penjadwalan Flowshop Dua-Mesin Dua Kriteria Dengan Setup Time Terpisah Dan Deteriorasi Linier

Tantrika, Ceria Farela Mada (2008) Penjadwalan Flowshop Dua-Mesin Dua Kriteria Dengan Setup Time Terpisah Dan Deteriorasi Linier. Masters thesis, Institut Teknologi Sepuluh November.

Text 2506202201-Master_thesis.pdf Restricted to Repository staff only Download (52MB)

Abstract

Penelitian penjadwalan umumnya mengasumsikan bahwa processing time diketahui dan konstan. Pada kenyataannya, terdapat banyak situasi di mana suatu job membutuhkan waktu lebih lama apabila diproses lebih lambat atau sebaliknya. Fenomena ini dikenal sebagai deteriorating job. Penelitian mengenai penjadwalan dengan deteriorating job selama ini belum banyak yang memisahkan setup time dari processing time. Padahal, dengan setup time yang dipisahkan, setup pada mesin subsekuen dapat dilakukan ketika job masih diproses pada mesin sebelumnya sehingga dapat mengurangi completion time yang dibutuhkan. Studi ini mempertimbangkan permasalahan penjadwalan flow shop dua mesin dengan dua kriteria, setup time terpisah, dan deteriorasi linier. Fungsi tujuan permasalahan ini adalah meminimasi jumlah terbobot dari total completion time dan total tardiness. Untuk memecahkan permasalahan tersebut, dilakukan pengembangan terhadap model integer programming Eren dan Guner (2006), serta algoritma heuristik berbasis tabu search dengan empat jenis solusi awal, yaitu SPT1, algoritma Johnson, EDD, dan MNEH. Model integer programming yang dikembangkan mampu menyelesaikan permasalahan penjadwalan tersebut. Permasalahan penjadwalan yang sama juga dapat diselesaikan dengan algoritma heuristik berbasis tabu search. Di antara empat metode heuristik yang dikembangkan, Tabu-MNEH memberikan hasil terbaik.
======================================================================================================================================
Most scheduling studies assume that processing times are known and constant. In many real-world situations, however, a job may require a longer processing time when it is processed later, or vice versa. This phenomenon is known as a deteriorating job. Previous studies on scheduling with deteriorating jobs have generally not separated setup times from processing times. However, when setup times are treated separately, setup operations on a subsequent machine can be performed while the job is still being processed on the preceding machine, thereby reducing the required completion time. This study considers a bicriteria two-machine flow shop scheduling problem with separate setup times and linear deterioration. The objective function is to minimize the weighted sum of total completion time and total tardiness. To solve this problem, the integer programming model developed by Eren and Guner (2006) is extended, and four tabu-search-based heuristic algorithms using SPT1, the Johnson algorithm, EDD, and MNEH as initial solutions are developed to solve the same problem. The developed integer programming model is capable of solving the scheduling problem. The same problem can also be solved using tabu-search-based heuristics. Among the four heuristic methods developed, Tabu-MNEH provides the best results.

Item Type:	Thesis (Masters)
Additional Information:	RTI 658.53 Tan p
Uncontrolled Keywords:	deteriorasi linier, penjadwalanjlowshop, setup time, total completion time, total tardiness, deterioration, flowshop scheduling, setup time, total completion time, total tardiness
Subjects:	T Technology > TS Manufactures > TS157.5 Production scheduling
Divisions:	Faculty of Industrial Technology > Industrial Engineering > 26101-(S2) Master Thesis
Depositing User:	magang .
Date Deposited:	29 Sep 2026 06:50
Last Modified:	29 Sep 2026 06:50
URI:	http://repository.its.ac.id/id/eprint/145020

Actions (login required)

View Item