Minimizing maximum delivery completion time for order scheduling with rejection

This study considers a customer order scheduling (COS) problem in which each customer requests a variety of products (jobs) processed on a single flexible machine, such as the computer numerical control (CNC) machine. A sequence-independent setup for the machine is needed before processing each product. All products in a customer order are delivered to the customer when they are processed. The product ordered by a customer and completed as the last product in the order defines the customer order’s completion time. We aim to find the optimal schedule of the customer orders and the products to minimize the customer orders’ total completion time. We have studied this customer order scheduling problem with a job-based processing approach in which the same products from different customer orders form a product lot and are processed successively without being intermingled with other products. We have developed two mixed-integer linear programming models capable of solving the small and medium-sized problem instances optimally and a heuristic algorithm for large-sized problem instances. Our empirical study results show that our proposed tabu search algorithm provides optimal or near-optimal solutions in a very short time. We have also compared the job-based and order-based processing approaches for both setup and no-setup cases and observed that the job-based processing approach yields better results when jobs have setup times.

Download Full-text

PENJADWALAN PRODUKSI DENGAN ALGORITMA HEURISTIK POUR (STUDI KASUS: KONVEKSI ONE WAY – MALANG)

Jurnal Teknik Industri ◽

10.22219/jtiumm.vol15.no1.35-44 ◽

2014 ◽

Vol 15 (1) ◽

pp. 35 ◽

Cited By ~ 1

Author(s):

ANDRI SULAKSMI ◽

ANNISA KESY GARSIDE ◽

FITHRIANY HADZIQAH

Keyword(s):

Heuristic Algorithm ◽

Production Scheduling ◽

Completion Time ◽

Heuristic Method ◽

Process Time ◽

Order Fulfillment ◽

Order Scheduling ◽

Total Process ◽

First Come First Serve

PENJADWALAN PRODUKSI DENGAN ALGORITMAHEURISTIK POUR (STUDI KASUS: KONVEKSI ONE WAY –MALANG)ANDRI SULAKSMI, ANNISA KESY GARSIDE*, DAN FITHRIANY HADZIQAHJurusan Teknik Industri, Fakultas Teknik, Universitas Muhammadiyah MalangJl. Raya Tlogomas 246, Malang, Jawa Timur 65144Email: [email protected], [email protected], [email protected] One Way memproduksi berbagai jenis kaos berdasarkan order yang datang dari konsumen.Dalam memenuhi order tersebut, perusahaan menggunakan aturan First Come First Serve dalammenjadwalkan urutan pengerjaan ordernya. Aturan ini sering tidak menguntungkan bagi order yangmembutuhkan waktu proses yang pendek karena apabila order tersebut berada di belakang antrian makaharus menunggu yang lama sebelum diproses dan menyebabkan waktu penyelesaian seluruh order menjadilebih panjang. Penelitian ini bertujuan untuk menjadwalkan urutan pengerjaan kaos di konveksi OneWay dengan menggunakan algoritma heuristik Pour sehingga waktu penyelesaian menjadi lebih singkatdan order kaos bisa selesai tepat waktu. Tahapan-tahapan penelitian terdiri dari pengumpulan data,perhitungan waktu standar, perhitungan total waktu proses berdasarkan order, penjadwalan denganmetode awal perusahaan, penjadwalan dengan metode heuristik pour, dan perbandingan makespan antarakedua metode. Berdasarkan hasil penjadwalan menggunakan heuristik Pour diperoleh penghematanmakespan sebesar 8,09 jam atau 19,25% dibanding makespan dengan metode perusahaan saat ini.Kata kunci: penjadwalan produksi, first come first serve, heuristik pour, makespanABSTRACT“One Way Convection” is a garment company which produces many kinds of t-shirt based on thecustomer’s order. In order to fulfill the order, the company applies role of First-Come First-Serve forscheduling the order production sequence. This role is often disadvantageous for the order with shortprocess time because if it is dispatched after the order with long process time, then it will take longer in queueand causes the completion time of all order to be longer. This research aims to schedule t-shirt’s sequenceoperation in “One Way Convection” company by using Pour heuristic algorithm so that completion timebecomes shorter and order fulfillment can be accomplished on-time. The steps in this methodology consistof collecting data, calculating standard time and total process time according to the order, scheduling usinginitial method proposed by company, scheduling using Pour heuristic algorithm, and comparing makespanof both approaches. According to the Pour Heuristic method, saving is obtained in makespan as 8.09 hoursor 19.25% compared with initial method proposed by company.Key words: production scheduling, first come first serve, pour heuristic, makespan

Download Full-text