Under the assumption that set-up
cost is directly proportional to set-up time, Uskup and Smith (1975) provided
a branch-and-bound solution for the two-machine flowshop problem with a total
set-up cost criterion such that the schedule meets all dead lines. Gupta and Darrow
(1985) generalized Corwin and Esogbue’s (1974) problem by considering sequencedependent
set-up times on both machines for permutation schedules and established
two heuristics for the problem