Flowshop scheduling with set-up, processing and removal times separated

Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

“…The models considered in the literature consist of multi-stage ow shop with multiple identical machines, such as those described by Alidaee et al [7], Azizoglu et al [8], Brah and Loo [9], Dessouky et al [10], Koulamas et al [11], Nowicki and Smutnicki [12], Santos et al [13,14], Negenman [15], and with multiple unrelated parallel machines, such as those described by Adamopouallos et al [16], and Suresh et al [17]. Flow shop scheduling problems ( [18][19][20][21][22][23]) take certain restrictions such as setup times and/or removal times into account; however, those studies make an assumption that only a single machine is considered in every stage. Some FSMPs take independent/dependent setup time into consideration, such as those reported by Balakrishnan and Kanet [24], Allahverdi [25], Franca et al [26], Kim et al [27].…”

Some effective heuristics for no-wait flowshops with setup times to minimize total completion time

“…The same problem but with the addition of separable removal times (actions carried out on machines when jobs are finished) is considered by Sule (1982) and for three machines by Sule and Huang (1983). The extension to m machines of this same problem is carried out by Proust et al (1991) where the authors propose four heuristic methods. Later, Rajendran and Ziegler (1997) propose some other algorithms for the same problem.…”

A Heuristic Scheduling Algorithm for Minimizing Makespan and Idle Time in a Nagare Cell

“…Webster and Baker [22] in 1995 review the research findings in group scheduling with regard to minimizing the total weighted flow time and the maximum lateness, although their review extends the results to cover the areas of group scheduling with batch availability and batch processing. For job scheduling, Sule [23] in 1982 and Proust et al [24] in 1991 have considered the two-machine flow shop scheduling problems with (sequence independent) setup and removal times separated. Using the encouraging performance of the new heuristic algorithm by Logendran and Nudtasomboon [18] in 1991 for solving the level 1 problem, Logendran et al [25] in 1995 carried out an investigation to determine how well the Logendran and Nudtasomboon (LN) algorithm performed in comparison with the Campbell et al [26] (CDS) algorithm if each is combined with Petrov's (PT) heuristic to completely solve an m-machine group scheduling problem to minimize the makespan.…”