scholarly journals A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times

2013 ◽  
Vol 37 (12-13) ◽  
pp. 7164-7173 ◽  
Author(s):  
Harun Aydilek ◽  
Ali Allahverdi
Keyword(s):  
Polynomial Time ◽  
Setup Times ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Processing Times ◽  
Flowshop Scheduling Problem

scholarly journals Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times

2003 ◽  
Vol 2003 (39) ◽  
pp. 2475-2486 ◽  
Author(s):  
Ali Allahverdi ◽  
Tariq Aldowaisan ◽  
Yuri N. Sotskov
Keyword(s):  
Completion Time ◽  
Setup Times ◽  
Total Completion Time ◽  
Scheduling Problem ◽  
Flowshop Scheduling ◽  
Lower And Upper Bounds ◽  
Dominance Relations ◽  
Flowshop Scheduling Problem ◽  
Global And Local ◽  
Local Dominance

This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given.

Sign in / Sign up

Export Citation Format

Share Document