A Scheduling Problem to Minimize Total Completion Time in a No-Wait Two-Stage Assembly-Type Flow Shop

2019 ◽  
Vol 36 (4) ◽  
pp. 1-12
Author(s):  
Jun-Hee Han ◽  
Bong Joo Jeong ◽  
Ju-Yong Lee ◽  
Sang-Oh Shim
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Total Completion Time ◽  
Scheduling Problem ◽  
Two Stage ◽  
Type Flow ◽  
No Wait

scholarly journals An improved algorithm to minimize the total completion time in a two-machine no-wait flow-shop with uncertain setup times

2022 ◽  
Vol 7 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Muberra Allahverdi
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Performance Measure ◽  
Setup Times ◽  
Total Completion Time ◽  
Average Percentage ◽  
Percentage Improvement ◽  
Wide Range ◽  
Test Of Hypothesis ◽  
No Wait

Since scheduling literature has a wide range of uncertainties, it is crucial to take these into account when solving performance measure problems. Otherwise, the performance may severely be affected in a negative way. In this paper, an algorithm is proposed to minimize the total completion time (TCT) of a two-machine no-wait flowshop with uncertain setup times within lower and upper bounds. The results are compared to the best existing algorithm in scheduling literature: the programming language Python is used to generate random samples with respect to various distributions, and the TCT of the proposed algorithm is compared to that of the best existing one. Results reveal that the proposed one significantly outperforms the best one given in literature for all considered distributions. Specifically, the average percentage improvement of the proposed algorithm over the best existing one is over 90%. A test of hypothesis is conducted to further confirm the results.

Sign in / Sign up

Export Citation Format

Share Document