Minimizing Completion Time for Order Scheduling: Formulation and Heuristic Algorithm

2017 ◽  
Vol 14 (4) ◽  
pp. 1558-1569 ◽  
Author(s):  
Zhongshun Shi ◽  
Longfei Wang ◽  
Pai Liu ◽  
Leyuan Shi
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Order Scheduling

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

2014 ◽  
Vol 15 (1) ◽  
pp. 35 ◽  
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

scholarly journals Customer order scheduling with job-based processing on a single-machine to minimize the total completion time

2021 ◽  
Vol 12 (3) ◽  
pp. 273-292 ◽  
Author(s):  
Ferda Can Çetinkaya ◽  
Pınar Yeloğlu ◽  
Hale Akkocaoğlu Çatmakaş
Keyword(s):  
Completion Time ◽  
Numerical Control ◽  
Total Completion Time ◽  
Mixed Integer ◽  
Order Scheduling ◽  
Customer Order ◽  
Processing Approach ◽  
Problem Instances ◽  
Customer Order Scheduling ◽  
Customer Orders

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.

Project buffer sizing and dynamic buffer consumption algorithm in power generation construction

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Shakib Zohrehvandi ◽  
Mohammad Khalilzadeh ◽  
Maghsoud Amiri ◽  
Shahram Shadrokh
Keyword(s):  
Power Generation ◽  
Heuristic Algorithm ◽  
Completion Time ◽  
Design Methodology ◽  
The Other ◽  
Wind Power Plant ◽  
Content Type ◽  
Project Duration ◽  
Project Completion ◽  
Buffer Sizing

PurposeThe aim of this research is to propose a buffer sizing and buffer controlling algorithm (BSCA) as a heuristic algorithm for calculating project buffer and feeding buffers as well as dynamic controlling of buffer consumption in different phases of a wind power plant project in order to achieve a more realistic project duration.Design/methodology/approachThe BSCA algorithm has two main phases of planning and buffer sizing and construction and buffer consumption. Project buffer and feeding buffers are determined in the planning and buffer sizing phase, and their consumption is controlled in the construction and buffer consumption phase. The heuristic algorithm was coded and run in MATLAB software. The sensitivity analysis was conducted to show the BSCA influence on project implementation. Then, to evaluate the BSCA algorithm, inputs from this project were run through several algorithms recently presented by researchers. Finally, the data of 20 projects previously accomplished by the company were applied to compare the proposed algorithm.FindingsThe results show that BSCA heuristic algorithm outperformed the other algorithms as it shortened the projects' durations. The average project completion time using the BSCA algorithm was reduced by about 15% compared to the previous average project completion time.Originality/valueThe proposed BSCA algorithm determines both the project buffer and feeding buffers and simultaneously controls their consumption in a dynamic way.

A Heuristic Algorithm for Solving Multi-Crane Scheduling Problem in Batch Annealing Process

2014 ◽  
Vol 620 ◽  
pp. 179-182 ◽  
Author(s):  
Xie Xie ◽  
Xiang Yu Kong ◽  
Yong Yue Zheng ◽  
Kun Wei
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Annealing Process ◽  
Performance Bound ◽  
Crane Scheduling ◽  
Iron And Steel ◽  
Heating And Cooling ◽  
Batch Annealing ◽  
Special Machine ◽  
No Wait

This paper investigates the scheduling of the multi-crane operations in batch annealing process in an iron and steel enterprise so that the completion time of the last annealed coil (makespan) is minimized. The annealing process of each coil consists of two-stage: heating and cooling. To start heating (cooling) for each coil, a special machine named furnace (cooler) must be loaded on. Once the heating (cooling) is completed, the furnace (cooler) must be unloaded immediately without any delay by crane (job no-wait constraint). The aim of our studied problem is to schedule finite machines (furnaces and coolers) by cranes to process jobs under the consideration for avoiding collision between two adjacent cranes and satisfying job no-wait constraint. For solving the problem, we present a heuristic algorithm combining earliest job requirement and closest crane first. Through the theoretical analysis, we show the absolute performance bound of the proposed heuristic algorithm.

Heuristic Algorithm for Solving Multi-Crane Scheduling in Steel Coil Warehouse

2014 ◽  
Vol 543-547 ◽  
pp. 1559-1562
Author(s):  
Xie Xie ◽  
Xiang Yu Kong ◽  
Yong Yue Zheng ◽  
Yan Ping Li
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Scheduling Problem ◽  
Np Hard ◽  
Crane Scheduling ◽  
Steel Coil ◽  
Upper Level ◽  
Warehouse Operations

We consider a multi-crane scheduling problem commonly encountered in real warehouse operations in steel enterprises. Given some demanded coils, if a demanded coil is in upper level or in lower level without being blocked, it can be picked up directly to designated place; else, the blocking coils need to be picked up to another position first. Unlike previous literatures in which both operations have been considered to be scheduled separately, our problem schedules transportation operation and shuffling operation coordinately. The objective is to minimize the last demanded coil transported to its designated place which is consistent with the earliest possible completion time of one crane. We propose a heuristic algorithm for solving this demonstrated strongly NP-hard.

A Heuristic Algorithm for Flow Shop Scheduling Problem

2014 ◽  
Vol 643 ◽  
pp. 374-379
Author(s):  
Hua Wei Yuan ◽  
Yuan Wei Jing ◽  
Tao Ren
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Numerical Experiments ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Large Size ◽  
Flow Shop Problem ◽  
Weighted Completion Time

This paper considers the m-machine flow shop problem to minimize weighted completion time. A heuristic algorithm is presented to deal with the problem for large size problem. At the end of the paper, some numerical experiments show the effectiveness of the heuristic.

Sign in / Sign up

Export Citation Format

Share Document