Nabeshima and Maruyama (1984) also extended the two-machine problem of
Szwarc by also considering separate removal and transportation times. They additionally
addressed the three-machine problem under certain conditions. Rajendran
and Ziegler (1997) investigated the problem of scheduling in a flowshop, where setup,
processing and removal times are separable with the objective of minimizing
makespan. They developed heuristic algorithms by the introduction of simplifying
assumptions into the scheduling problem under study.