An effective and efficient heuristic for no-wait flow shop production to minimize total completion time

2017 ◽  
Vol 108 ◽  
pp. 57-69 ◽  
Author(s):  
Honghan Ye ◽  
Wei Li ◽  
Amin Abedini ◽  
Barrie Nault
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Total Completion Time ◽  
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.

Lower bounds for minimizing total completion time in a two-machine flow shop

2006 ◽  
Vol 9 (6) ◽  
pp. 559-568 ◽  
Author(s):  
Han Hoogeveen ◽  
Linda van Norden ◽  
Steef van de Velde
Keyword(s):  
Lower Bounds ◽  
Completion Time ◽  
Flow Shop ◽  
Total Completion Time

SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS

2007 ◽  
Vol 18 (02) ◽  
pp. 341-359 ◽  
Author(s):  
JOSEPH Y.-T. LEUNG ◽  
HAIBING LI ◽  
HAIRONG ZHAO
Keyword(s):  
Polynomial Time ◽  
Completion Time ◽  
Flow Shop ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Total Completion Time ◽  
Time Interval ◽  
Start Time ◽  
Special Cases ◽  
Efficient Approximation

We consider two-machine flow shop problems with exact delays. In this model, there are two machines, the upstream machine and the downstream machine. Each job j has two operations: the first operation has to be processed on the upstream machine and the second operation has to be processed on the downstream machine, subject to the constraint that the time interval between the completion time of the first operation and the start time of the second operation is exactly [Formula: see text]. We concentrate on the objectives of makespan and total completion time. For the makespan objective, we first show that the problem is strongly NP-hard even if there are only two possible delay values. We then show that some special cases of the problem are solvable in polynomial time. Finally, we design efficient approximation algorithms for the general case and some special cases. For the total completion time objective, we give optimal polynomial-time algorithm for a special case and an efficient approximation algorithm for another one.

Sign in / Sign up

Export Citation Format

Share Document