Accepted Manuscript

A Survey of Scheduling Problems with No-Wait in Process

Ali Allahverdi

PII: S0377-2217(16)30373-3
DOI: 10.1016/j.ejor.2016.05.036
Reference: EOR 13722

To appear in: European Journal of Operational Research

Received date: 9 October 2015

Revised date: 3 March 2016
Accepted date: 18 May 2016

Please cite this article as: Ali Allahverdi , A Survey of Scheduling Problems with No-Wait in Process,
European Journal of Operational Research (2016), doi: 10.1016/j.ejor.2016.05.036

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service
to our customers we are providing this early version of the manuscript. The manuscript will undergo
copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please
note that during the production process errors may be discovered which could affect the content, and
all legal disclaimers that apply to the journal pertain.
 ACCEPTED MANUSCRIPT

Highlights
 This paper reviews more than 300 papers on scheduling problems with no-wait constraint
 It classifies problems based on shop environments, performance measures considered, and
other factors
 Independently addressed problems are determined and less addressed problems are identified
 Some potential research venues are proposed
 The current paper covers the research since min 1993 to date

T
IP
CR
US
AN
M
ED
PT
CE
AC

1
 ACCEPTED MANUSCRIPT

A Survey of Scheduling Problems with No-Wait in Process

Ali Allahverdi
Department of Industrial and Management Systems Engineering
Kuwait University, P.O. Box 5969, Safat, Kuwait
e-mail: ali.allahverdi@ku.edu.kw

Abstract

T
IP
Scheduling involving no-wait in process plays an important role in industries such as plastic,
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries,
including surgery-scheduling problem, aircraft landing problem, and train scheduling problem,

CR
can also be modelled with no-wait constraint. The research interest in scheduling problems with
no-wait in process began in 1970s and the interest has been increasing since then. Hall and
Sriskandarajah (Operations Research 44, 510-525, 1996) presented an excellent review of the
literature, covering about 130 papers, on scheduling problems with no-wait in process since

US
1970s until mid-1993. This paper is the second survey paper providing analysis and an extensive
review of more than 300 papers that appeared since the mid-1993 to the beginning of 2016. This
survey paper classifies scheduling problems based on shop environments as flowshop, job shop,
AN
or open shop. It further classifies the problems based on the performance measure considered
along with some other factors. Throughout the survey paper, many independently investigated
problems are determined, less studied problems are identified, and suggestions for future
research directions are proposed.
M

Key words - Scheduling, review, no-wait, flowshop, survey

ED

1. Introduction
The no-wait constraint in scheduling occurs when two consecutive operations of a job must
be processed without any interruptions. The research interest in scheduling, with no-wait
PT

constraint, which began in 1970s, has increased recently. Hall and Sriskandarajah (1996)
provided an excellent review of the scheduling problems with no-wait in process, which covered
about 130 papers, reviewing the literature since 1970s until mid-1993. A lot of research papers
have appeared since the mid-1993. The objective of this paper is to provide an extensive review
CE

of the papers that have appeared since the mid-1993 to up-to-date. Therefore, the current survey
paper, along with that of Hall and Sriskandarajah (1996), provide a review of the scheduling
research with no-wait constraint since 1970s to up-to-date.
AC

The main reason for the occurrence of no-wait in process is the technology requirement in
some manufacturing environments. In such a manufacturing environment, an operation should
immediately follow the previous operation as a result of the temperature or other characteristics
of the material. Another factor suggesting the no-wait in process is the effort to reduce the work-
in-process (WIP) and to achieve a lean production, Macchiaroli et al. (1999).
Modern manufacturing environments such as robotic cells provide a highly coordinated
manufacturing process which can appropriately be modeled as a no-wait scheduling problem,
Che et al. (2003, 2007, 2011), Agnetis (2000), Agnetis and Pacciarelli (2000). Other
manufacturing environments, where no-wait in process is applicable, include plastic, chemical,
and pharmaceutical industries. Well-documented applications of no-wait scheduling problems
2
 ACCEPTED MANUSCRIPT

are provided by Hall and Sriskandarajah (1996), Bagchi et al. (2006), Lee et al. (2007), Alvarez-
Valdes et al. (2005), Blömer and Günther (1998), and Na et al. (2014).
Scheduling with no-wait constraint is applicable in different environments; flowshop,
flexible flowshop, job shop, and open shop. There exist m stages in series in an m-machine no-
wait flowshop environment such that each job has to be processed in each of the m stages in the
same order. Operation times for each job at different stages typically are dissimilar. There exists
only one machine at each stage in an m-machine no-wait flowshop while there is more than one
machine in at least one of the stages in an m-machine flexible (or hybrid) flowshop in order to
increase the capacity. A no-wait job shop environment consists of m different machines and each
job has a given machine route in which some machines can be missing and some can repeat.

T
Similar to no-wait flowshops, there may exist more than one machine in at least one stage, which
is called a flexible job shop. On the other hand, in a no-wait open shop, each job should be

IP
processed once on each of the m machines passing them in any order. In the following, some
examples of scheduling with no-wait constraint are provided for different environments.

CR
In steel manufacturing, the operations of ingots, unmolding, reheating, soaking, and
preliminary rolling should follow one another immediately, Hall and Sriskandarajah (1996). In
the production of the steel, the hot work-in-process should not wait between two successive
operations. As Yuan et al. (2013) pointed out, for example, a slab has to reach a certain

US
temperature before it can be processed by rolling mill. Its temperature will drop considerably if a
heated slab waits in front of the machine. Therefore, the reheating must be executed if the heated
slab waits in front of the machine, which results in waste of energy. As a result, the steel
AN
manufacturing process has to be modeled by the no-wait constraint.
Wang et al. (2015a) studied the surgery scheduling problem for single surgical suite subject
to random emergency surgery. They modeled this problem as a no-wait flowshop scheduling
problem with three machines. They developed a predictive-reactive scheduling model to
M

accommodate the influence of surgery’s arrival on a planned schedule with the objective of
optimizing the combined efficiency and stability. They conducted computational experiments
and showed that their proposed model is effective. Wang et al. (2015c) considered finding a
ED

surgery scheduling while managing scarce medical resources in laminar-flow operating theaters,
which is widely used in China. They solved the problem is two phases. The first phase consists
of finding out if patients can be operated upon within the planning period. The second phase is
the surgery schedule, i.e., the daily surgery sequence and the corresponding operating room
PT

which was shown to be modelled as the two-stage no-wait hybrid or flexible flowshop
scheduling problem with the objective of minimizing the considered hospital operating costs.
They developed an algorithm giving management insights into reducing the operating costs of
CE

the hospital. Hsu et al. (2003) also pointed out that patient scheduling problem is a new variant
of the two-stage no-wait flowshop scheduling problem.
The flight scheduling problem with the objective of minimizing the maximum number of
AC

aircraft that simultaneously lie within a single air traffic control section at any time was shown to
be no-wait job shop scheduling problem, Kim et al. (2009). They proposed different heuristics
for the problem and reported experimental results for real-world flight data. Another related
problem is the aircraft sequencing problem, i.e., the aircraft landing problem with the objective
of maximizing the number of landing aircraft in the time unit. Bagassi et al. (2010) showed that
this problem can be modeled as a no-wait job shop scheduling problem with setup times and
release date.
Parallel computer systems are commonly used nowadays as a result of their efficiency. Thus,
developing efficient scheduling algorithms in computer systems become a necessity. Guircoun et
al. (2005) stated that “The first step of the parallelization consists in dispatching on a designed
3
 ACCEPTED MANUSCRIPT

client the code and the data of each program that can be parallelized. For each program that has
to be sent to a client, the server must, successively, read the code and data on the hard disk and
send them to the client from the network. In a first approximation, these two steps can be
modeled by one task on the server. This assumption is not excessive because in such a context,
the designer tries to balance the processing times on different clients to obtain the best
performance of the parallelized execution. Then programs and data have often similar sizes and
as a consequence, reading and sending them takes similar times”. Guircoun et al. (2005) modeled
the considered parallel computer system as a two-stage no-wait hybrid flowshop scheduling
problem. They also pointed out when different performance measures in the no-wait flowshop
scheduling environments are appropriate for the parallel computer systems environments.

T
Mannino and Mascis (2009) developed a real time automated traffic control system to
operate trains in metro stations for a major Italian municipal transport company. They developed

IP
a system, which optimally controls the trains in a metro station by identifying an appropriate
routing along with establishing an optimum schedule of the performed operations. They modeled

CR
the problem as no-wait job shop scheduling problem. They used a branch-and-bound algorithm
to solve the problem and their developed model has been in operation in the Milan metro since
2007. On the other hand, Liu and Kozan (2011) investigated the train scheduling problems when
both prioritized and non-prioritized trains are traversed in single line rail network at the same

US
time. They pointed out that no-wait constraints arise as a result of the prioritized trains such as
express passenger trains should traverse continuously without any interruption. Therefore, they
showed that the problem can be modeled as no-wait hybrid job shop problem.
AN
Hecker et al. (2014) indicated that bakery production can be modeled as a no-wait flowshop
scheduling problem based on the constraints and frame conditions given by the processes in the
production of bakeries.
Therefore, many problems in different industries can be modelled as scheduling problems
M

with the no-wait constraint.

2. Notation and Classification

ED

No-wait scheduling problems can be classified based on the considered performance

measure, the requirements for job processing, setup time requirements, the time jobs are
available, the number of stages that jobs need to go through, and the available number of
machines at each stage among many others.
PT

Job setup times/costs can be classified as either sequence-dependent or sequence-

independent, Allahverdi and Soroush (2008). A setup time/cost is classified as sequence-
dependent if the time/cost required to setup a machine for a current job depends on the current
CE

job as well as the job processed on the machine before running the current job. A setup time/cost
is called sequence-independent if the time/cost required to setup a machine for a current job only
depends on the current job, i.e., regardless of the prior job on the machine. For some scheduling
AC

environments, job families exist where each family consists of a number of jobs, which have
similar characteristics, and hence, a setup on a machine is required when a job from a different
family is processed. Family setup times/costs can also be classified as either sequence-dependent
or sequence-independent.
A scheduling problem is described by using the notation //, Graham et al. (1979). The
first field ( defines the shop environment in terms of the setting and the number of machines.
On the other hand, the second field (defines details of processing characteristics, shop
conditions, and setup information. In the problems that we consider, this field contains “no-wait”
in order to specify the no-wait constraint. The description of Allahverdi et al. (1999, 2008) and
Allahverdi (2015) is utilized for setup information for clarity purposes. Finally, the third field (
4
 ACCEPTED MANUSCRIPT

describes the performance measure considered. The details of the three fields used, throughout of
the paper, are given in Table 1. Let dj, wj, Cj,,Lj, Tj, and Ej denote due date, weight, completion
time, lateness, tardiness, and earliness, respectively, of job j where Lj=Cj-dj, Tj=max{Cj-dj, 0},
and Ej=max{dj-Cj, 0}. If n denotes the number of available jobs, then, Cmax= max{C1, C2, …, Cn},
Lmax= max{L1, L2, …, Ln} and Tmax= max{T1, T2, …, Tn}. Moreover, let Uj denote if job j is tardy
or not where Uj={1 if Cj>dj, 0 otherwise} in which case the number of tardy jobs is denoted by
Uj. Therefore, for example, the m-machine no-wait flowshop scheduling problem to minimize
total tardiness with sequence-independent setup times will be noted by Fm/no-wait, STsi/Tj. The
Cmax performance measure is related to resource utilization while the performance measure of
Cj is related to work-in-process. Other performance measures are related to job due dates.

T
Optimizing the mean or total of a performance measure yields the same solution. Therefore,
for example, the performance measures of total completion time (Cj) and mean completion time

IP
(Cj/n) are equivalent. The notation Cj is used to refer to either total or mean completion time
performance measure. The same approach is utilized for other performance measures as well.

CR
More than one performance measure is considered for multi-criteria scheduling problems. If
there are k performance measures, which are denoted by PM1, PM2, …, PMk, the notation used
by T’Kindt and Billaut (2002) is utilized for the multi-criteria problems. Hence, the notation Fl

US
(PM1, PM2, …, PMk) denotes that the objective is to minimize a linear combination of all the
considered criteria while the notation #(PM1, PM2, …, PMk) denotes when a Pareto approach is
considered. On the other hand, the notation ε(PM1/ PM2, …, PMk) denotes that the objective is to
minimize PM1 subject to the constraints that the other performance measures PM2, …, PMk have
AN
upper bounds.

Table 1. Description of the notation //

  
M

Notation Description Notation Description Notation Description

Fm m-stage flowshop STsi Sequence-independent setup time Cmax Makespan
FFm m-stage flexible
STsd Sequence-dependent setup time Lmax Maximum lateness
ED

(hybrid) flowshop
Jm Sequence-independent family setup
m-stage job shop STsi,f time
Tmax Maximum tardiness
FJm m-stage flexible job Sequence-dependent family setup
shop
STsd,f time Cj Total completion time
PT

Om m-stage open shop rj Non-zero release date Tj Total tardiness

no-wait No-wait constraint Uj Number of tardy jobs
ZS Zero or no setups wjCj Total weighted completion time
wjTj
CE

Total weighted tardiness

Different methodologies have been utilized to solve different no-wait scheduling problems.
The utilized methodologies in the addressed papers are abbreviated and the abbreviations are
AC

given in Table 2.

Table 2. Description of abbreviations for the utilized methods

ACO Ant Colony Optimization TS Tabu Search
DE Differential Evolution IG Iterated Greedy
EM Electro Magnetism VNS Variable Neighborhood Search
GA Genetic Algorithm GRASP Greedy Randomized Search Procedure
ICA Imperialist Competitive Algorithm ILS Iterated Local Search
MA Memetic Algorithm MIP Mixed Integer Programming
5
 ACCEPTED MANUSCRIPT

PSO Particle Swarm Optimization MILP Mixed Integer Linear Programming

SA Simulated Annealing B&B Branch-and-Bound

No-wait scheduling problems dealing with lot sizing or lot streaming, e.g., Yang and Pan
(2012) and Kim and Jeong (2009) along with robotic or hoist flowshop scheduling problems,
e.g., Che et al. (2012), Che and Chu (2009) are excluded from the survey due to space limitation.
The results for no-wait flowshop scheduling problems are discussed in the next two sections
while the results for no-wait job shop and no-wait open shop problems are presented in the fifth
section. The conclusions and some research venues are deliberated in section 6.
Goyal and Sriskandarajah (1988) provided the computational complexity and approximate

T
algorithms for scheduling with no-wait constraint. Moreover, Hall and Sriskandarajah (1996)

IP
excellently summarized the complexities of no-wait flowshop scheduling problems in Table 1 of
their paper. The complexities of the problems which appeared in the literature after the survey of
Hall and Sriskandarajah (1996) are specified throughout the analysis if the complexities are

CR
reported in the literature.

3. Two/three-machine no-wait flowshop problems

US
The two/three-machine no-wait flowshop scheduling research is investigated in this section,
which is summarized in Table 3. The table is firstly organized by the criterion considered,
secondly by whether flowshop or flexible flowshop is studied, and then by setup type
investigated. If setup times are not addressed, the problem is represented by ZS. The research
AN
without setup times is first discussed followed by the one with setup times.

3.1 Research on Cmax for F2/F3

Wang et al. (2006b) proposed SA and GA algorithms for the problems of F2/no-wait/Cmax
M

and F3/no-wait/Cmax where they showed that the SA algorithm performs better than the GA
algorithm. On the other hand, Glass et al. (1999) presented an O(n log n)-time heuristic with a
worst-case ratio of 4/3 for the F2/no-wait/Cmax problem where jobs might have missing
ED

operations.
Espinouse et al. (1999) studied and proposed heuristic algorithms for the F2/no-wait/Cmax
problem with machine availability constraint. They showed that the problem is NP-hard even if
PT

there is only one availability constraint on only one of the machines. Espinouse et al. (2001)
investigated the same problem and showed that the problem is NP-hard in the strong sense with
an arbitrary number of non-availability periods. Moreover, Cheng and Liu (2003a) considered
CE

the F2/no-wait/Cmax problem where each machine might have an unavailable interval. They
presented a polynomial approximation algorithm for the cases of one unavailable interval on one
machine or unavailable intervals on both machines. Furthermore, Cheng and Liu (2003b)
proposed 3/2-approximation algorithms when unavailable internals on both machines overlap or
AC

only one of the two machines has unavailable intervals.

Zhao and Tang (2011) considered the F2/no-wait/Cmax problem where the actual processing
time of each job is a proportional function of its starting time and each machine may have non-
availability intervals. They showed that the problem with only one unavailable interval is NP-
hard in the ordinary sense while the problem is NP-hard in the strong sense with an arbitrary
number of unavailable intervals. Moreover, Ben Chihaoui et al. (2009) proposed two heuristics,
based on Gilmore-Gomory and Cheng and Liu et al. (2003b) algorithms, for the F2/no-wait,
rj/Cmax problem with machine availability constraints while Ben Chihaoui et al. (2011) presented
several lower and upper bounds for the same problem where each machine is subject to an

6
 ACCEPTED MANUSCRIPT

unavailability constraint. They proposed a B&B algorithm by utilizing the bounds. The
computational experiments showed that the B&B algorithm obtains the optimal solution for
problems up to 20 jobs in a reasonable amount of computational time. Furthermore, the B&B
algorithm can be converted into a greedy search heuristic which was shown to obtain near
optimal solution.
Sidney et al. (2000) studied the F2/no-wait, STsi/Cmax problem where setup time on the
second machine consists of two parts. The first part can be conducted in the absence of a job
while the second part can be conducted in either absence or presence of the job. The authors
presented a heuristic algorithm and showed that its worst-case performance ratio is 4/3.
Gupta et al. (1997) showed that the F2/no-wait, STsi/Cmax problem, where removal times are

T
also separate from processing times, is reduced to the Gilmore-Gomory Traveling Salesman

IP
Problem which is solvable in polynomial time. On the other hand, Samarghandi and ElMekkawy
(2011) provided a mathematical formulation, developed a lower bound, and proved a number of
propositions for special cases of the F2/no-wait, STsi/Cmax problem, where setup operations are

CR
conducted by a single server. They also presented a hybrid algorithm consisting of VNS and TS
and showed that the algorithm yields optimal solutions for small size problems. Moreover, the
algorithm’s performance was compared to the lower bound for large size problems.

3.2 Research on Cmax for FF2/FF3

US
Liu et al. (2003) investigated the FF2/no-wait/Cmax problem where there is a single machine
in either stage. They proposed a greedy heuristic algorithm and indicated that the algorithm’s
AN
worst case ratio is (3-1/h) where h is the number of parallel machines at either the first or second
stage. On the other hand, Cheng et al. (2000) examined the problems of FF2/no-wait/Cmax and
FF3/no-wait/Cmax where all the jobs require a constant processing time. They presented
polynomial time algorithms for certain problems while proved that other problems are strongly
M

NP-complete.
Wang and Liu (2013) proposed a GA algorithm for the FF2/no-wait/Cmax problem and
developed some lower bounds. They compared the performance of their GA algorithm by using
ED

the lower bounds. Moreover, Song and Tang (2008) presented an integer programming model
and proposed a discrete PSO algorithm for the FF2/no-wait/Cmax problem applied in a cast steel
plant. Furthermore, Xie et al. (2004) proposed a heuristic algorithm, which consists of sequence
PT

generation and sequence evaluation steps, while Ghaleb et al. (2015) presented TS and PSO
algorithms for the problem. Besides, Shafaei et al. (2011) presented six heuristics and proposed
an algorithm based on neural network and fuzzy theory for the problem. Finally, Wang et al.
CE

(2015b) developed several lower bounds and obtained some upper bounds by using some
heuristics for the problem. They also presented a B&B algorithm for the problem by utilizing the
developed lower and upper bounds.
Rabiee et al. (2014) studied the FF2/no-wait, STsd/Cmax problem where jobs might have
AC

rework. They proposed a hybrid algorithm based on ICA. On the other hand, Adressi et al. (2016)
presented SA and GA algorithms for the FF2/no-wait, STsd,f/Cmax problem where machines are
subject to random breakdowns. They showed that the SA performs better than the GA.

3.3 Results on Cj for F2/F3

Aldowaisan and Allahverdi (1998) provided a dominance relation for the F2/no-wait,
STsi/Cj problem and presented optimal solutions for two special cases along with providing a
heuristic for the general problem. Moreover, Shyu et al. (2004) proposed an ACO algorithm and
showed that their algorithm performs better than that of Aldowaisan and Allahverdi (1998). On

7
 ACCEPTED MANUSCRIPT

the other hand, Chang and Shao (205) analyzed optimization properties and presented an
algorithm for the F2/no-wait, STsi/Cj problem where removal times are also separate from
processing times.
Moradinasab et al. (2013) presented GA and adaptive ICA algorithms for the F2/no-wait,
STsi/Cj problem. They showed that the adaptive ICA algorithm performs better than the GA and
the ICA algorithm achieves better performance than the ACO algorithm of Huang et al. (2009).
Su and Lee (2008) analyzed special cases for the F2/no-wait, STsi/Cj problem where setup
operations are conducted by a single server. They also proposed a heuristic and a B&B algorithm for
the problem. On the other hand, Guirchoun et al. (2005) analyzed the FF2/no-wait, STsi/Cj
problem where setup operations are conducted by a single server and processing times are unary.

T
They presented an optimal algorithm with O(n log n) time.
Allahverdi and Aldowaisan (2001) investigated the F2/no-wait, STsd/Cj problem where

IP
they presented a dominance relation and proposed several insertion-based heuristics. They also
provided optimal solutions for some special cases of the problem. On the other hand, the F2/no-

CR
wait, STsd/Cj problem was addressed by Rabiee et al. (2012) where jobs might have rework.
They presented an adapted ICA algorithm and showed that their algorithm outperforms GA and
SA algorithms.

US
Allahverdi and Aldowaisan (2000) provided optimal solutions for special cases and
presented a dominance relation for the general case of the F3/no-wait, STsi/Cj problem. They
also presented five insertion-based heuristics for the general problem. Moreover, Chang and
Shao (2006) presented an optimal property and two heuristics for the problem. Furthermore,
AN
Aldowaisan and Allahverdi (2004a) considered the problem F3/no-wait, STsi/Cj but where
removal times are also taken into account. They proposed a dominance relation, presented a
lower bound, and proposed seven block insertion algorithms.
M

3.4 Other results for F2/FF2

Fondrevelle et al. (2005) proposed a dominance relation for the F2/no-wait, STsi/Lmax
problem where removal times were also considered as separate from processing times.
ED

Fondrevelle et al. (2005) also proposed an effective B&B algorithm for the problem. On the other
hand, Wang and Cheng (2006) developed dominance relations and presented a heuristic
algorithm, which can produce near-optimal solutions quickly for realistic-sized problems, while
PT

Pang (2013) developed a heuristic based on GA algorithm, with relatively large computation
time, for the F2/no-wait, STsi,f/Lmax problem.
Ben-Yehoshua et al. (2015) investigated the F2/no-wait problem with the objective of
CE

minimizing the total absolute deviation of job completion time for proportionate flowshops.
They indicated that the LPT sequence remains optimal for a small number of jobs (up to 7) and
the number of optimal solution increases for larger number of jobs. On the other hand, for
minimizing Cmax, Bouquard et al. (2005) presented a complexity classification of different two-
AC

machine flowshop scheduling problems where some jobs have to be processed with the no-wait
constraint.
Shabtay et al. (2007) extended the F2/no-wait/Cmax problem to the case where job
processing times are controllable through allocation of resources where they presented two
heuristics which are shown to produce close to optimal solutions. Another related problem was
studied by Strusevich (1995) with controllable machine speeds where the objective is to
minimize Cmax in addition to finding the optimal values of machine speeds. He presented an
O(n3) algorithm.

8
 ACCEPTED MANUSCRIPT

Liu and Feng (2014) addressed the F2/no-wait problem where processing time of a job is a
function of its position and its resource allocation. Two problems are considered; finding optimal
sequences of jobs and the optimal resource allocation. Different performance measures were
considered with respect to each problem. An algorithm was presented to solve the problems.
Wang and Cheng (2001) investigated the F2/no-wait problem with an availability constraint.
They presented two improved heuristics and showed that the heuristics have a worst-case error
bound of 5/3. On the other hand, Kubzin and Strusevich (2004) studied the F2/no-wait/Cmax
problem with a non-available interval on one of the machines. They presented an algorithm with
worst-case ratio of 3/2. Furthermore, Kubzin and Strusevich (2005) addressed the F2/no-
wait/Cmax problem, where one of the machines is subject to maintenance, and provided a

T
polynomial time approximation scheme.

IP
Wang et al. (2005) considered the FF2/no-wait/Cmax problem such that there is no idle time
between two consecutive processed jobs on the machines at the second stage. They investigated
the complexity of the problem and presented a heuristic algorithm with asymptotically tight error

CR
bounds.
Moradinasab et al. (2012) proposed PSO and ICA algorithms for the FF2/no-wait/Tj
problem where jobs might have rework. They compared the performance of their PSO and ICA

outperforms the others.

US
algorithms with those of ACO and GA algorithms and showed that the proposed ICA algorithm

Jolai et al. (2013) presented three bi-objective heuristics for the FF2/no-wait/#(Cmax, Tmax)
problem with the goal of finding approximations of the optimal Pareto front. The heuristics are
AN
based on SA, normalized weighted SA, and fuzzy SA. They proposed a new method, by mixing
Taguchi method and multi-objective decision making approach, for selecting parameter values
for their heuristics.
M

3.5 Results with batch machines for F2/F3

Batch machines can be classified as parallel batch machines and sequential batch machines.
A parallel batch machine can process several jobs at the same time as a batch. The processing
ED

time of a batch in parallel batch machine is equal to the maximum processing time of the jobs
contained in a batch. On the other hand, a sequential batch machine processes the jobs
sequentially with the batch processing time being the sum of the processing times of the jobs in
PT

the batch. We denote parallel and sequential batch machines by P and S, respectively. We also
denote the batch machines by “batch (r1, r2)” to denote that there exist batch machines where r1
and r2 denote if the machine at the first or second stage is P or S. For more than two stages, they
CE

are denoted as batch (P) or batch (S) meaning that P machines or S machines exist at each stage.
Oulamara et al. (2005) presented polynomial time algorithms for both problems of F2/no-
wait, batch (P, P)/Cmax and F3/no-wait, batch (P)/Cmax. On the other hand, Lin et al. (2001)
addressed the F2/no-wait, batch (S, S)/Cmax problem with constant setup times each time a batch
AC

is formed. They showed that the problem is NP-hard.

Oulamara (2007) provided complexity results and proposed a heuristic algorithm with worst
case ratio of 2 for the F2/no-wait, batch (P, S)/Cmax problem. Moreover, Rojas-Santiago et al.
(2013) proposed an ACO algorithm, Jolai et al. (2009a) proposed a GA algorithm, Muthuswamy
et al. (2012a) presented a GRASP algorithm while Muthuswamy et al. (2011, 2012b) proposed a
mathematical formulation and presented a PSO algorithm for the same problem. On the other
hand, Maya et al. (2014) presented a GRASP algorithm for the F2/no-wait, batch (P, S), rj/Cmax
problem.

9
 ACCEPTED MANUSCRIPT

4. m-machine no-wait flowshop problems

The m-machine no-wait flowshop scheduling research is discussed in sections 4.1-4.5 for
single criterion, summarized in Table 4, while that of multi-criteria is deliberated in section 4.6
and summarized in Table 5. Both Tables 4 and 5 are organized similar to Table 3. The references
in Table 4 are numbered and the number of the paper is given in the first column. The last
column, denoted by “Better than”, lists the number of papers the results of which are
outperformed by the current paper. For example, the hybrid algorithm proposed in paper # 1
(P1), outperforms the methods proposed by papers # 12, 14, 22, 42 (P12, P14, P22, P42).
Therefore, the column “Better than” of P1 lists the papers P12, P14, P22, P42. Moreover, the
“#*” value within parentheses in the last column denotes the problems the method of which have

T
not been compared. For example, both papers P51 and P52 investigate the same problem and

IP
their methods have not been compared, therefore, in the last column, the papers are denoted by
(2*). The research without setup times is first discussed followed by the research with setup
times.

CR
4.1 Research on Cmax for Fm
The Fm/no-wait/Cmax problem has been investigated extensively in the literature, which is

US
summarized in Table 4, and thus not all the research on the problem is discussed. Grabowski and
Pempera (2005) presented several descending search algorithms along with a TS algorithm. They
used multi-moves, which perform several moves simultaneously in a single iteration, in the
algorithms, which help in the convergence of the algorithms to good solutions. In their TS
AN
algorithm, they proposed a dynamic tabu list, which additionally helps in avoiding at a local
optimum solution. Furthermore, Pan et al. (2008e) proposed an improved IG algorithm, where a
speed-up method for the insertion neighborhood is utilized, and showed that the IG algorithm
performs better than the TS algorithm of Grabowski and Pempera (2005). Moreover, Framinan
M

and Nagano (2008) proposed a heuristic based on the analogy between the problem and well-
known travelling salesman problem. On the other hand, Tseng and Lin (2010) proposed a hybrid
GA algorithm, which hybridizes the genetic algorithm and a novel local search scheme.
ED

Moreover, an operator was designed to enhance the capability of intensification in the genetic
algorithm. They showed that their hybrid GA performs better than the heuristics of Grabowski
and Pempera (2005). Besides, Jarboui et al. (2011) proposed another hybrid GA algorithm where
PT

the variable neighborhood search is used as an improvement procedure in the last step of the
genetic algorithm. They showed that the hybrid GA performs better than the heuristics of
Grabowski and Pempera (2005) and Pan et al. (2008a). Additionally, Engin and Günaydin (2011)
CE

investigated the problem and presented an algorithm based on an improved adaptive learning
approach where the improvement in the adaptive learning approach is similar to neural-network
training. They showed that their algorithm performs better than the heuristic of Aldowaisan and
Allahverdi (2003). Furthermore, Samarghandi and Elmekkawy (2012a) presented a hybrid TS
AC

and PSO algorithm where the PSO is used to move from one solution to a neighborhood
solution. They showed that the algorithm performs better than the hybrid PSO algorithm of Liu
et al. (2007). Moreover, Akrout et al. (2013) proposed a new hybrid algorithm, which combines
GRASP with DE algorithm, called NEW-GRASP-DE. The authors showed that the NEW-GRASP-
DE algorithm performs better than the heuristics of Jarboui et al. (2011), Tseng and Lin (2010),
Grabowski and Pempera (2005), and Pan et al. (2008a). Furthermore, Ding et al. (2015a)
presented an improved IG algorithm, with a tabu-based reconstruction strategy, and showed that
it performs better than those of Pan et al. (2008a,e), Qian et al. (2009a), Tseng and Lin (2010),
and Jarboui et al. (2011). Moreover, Lin and Ying (2016) presented a heuristic consisting of

10
 ACCEPTED MANUSCRIPT

three phases. Two versions of constructive heuristics are used to obtain an initial sequence. Next,
the problem is converted into asymmetric traveling salesman problem and an algorithm is
applied to improve the initial solution. Then, the solution is further improved by a mathematical
model. They showed that their heuristic performs better than several heuristics including that of
Ding et al. (2015a).
Pan et al. (2008b) provided upper bounds on Taillard's benchmark suite for the no-wait
flowshops with Cmax performance measure. Kalczynski and Kamburowski (2007) presented new
network representations for the Fm/no-wait/Cmax problem. They also presented some lower
bounds and provided efficiently solvable special cases. A polynomial time approximation
scheme was offered by Sviridenko and Woeginger (2000) and Sviridenko (2003) for the Fm/no-

T
wait/Cmax problem, on any fixed number of machines. On the other hand, Qian et al. (2009b)

IP
proposed a hybrid DE algorithm for the Fm/no-wait/Cmax problem where jobs dynamically
arrive. Liu et al. (2006, 2008a) investigated the Fm/no-wait/Cmax problem where job processing
times are assumed to be random variables. They proposed a hybrid PSO algorithm which utilizes

CR
SA to solve the problem.
Mucha and Sviridenko (2013) showed that any polynomial time -approximation algorithm
for the Fm/no-wait/Cmax problem implies the existence of a polynomial time (1+e)-

US
approximation algorithm for the asymmetric traveling salesman problem where e>0.
Sun et al. (2012) studied the Fm/no-wait/Cmax problem with deteriorating jobs and
dominated machines where jobs have processing times, which are increasing function of their
starting times. They indicated that the problem can be solved polynomially under certain
AN
conditions. Ng et al. (2011) also studied the Fm/no-wait/Cmax problem with deteriorating jobs.
Assuming a linear deteriorating function with identical increasing ranges for all the jobs and
some dominating relationships exist between the machines, they showed that the problem is
polynomially solvable.
M

Samarghandi (2015a) indicated that the Fm/no-wait, dj/Cmax problem, i.e., the problem
with due date constraint, is NP-hard. He proposed a MILP model and presented a PSO algorithm
where a new local search approach was introduced to further improve the performance of the
ED

PSO algorithm. Moreover, a design of experiments approach utilizing Taguchi method was
employed to fine tune the parameters of the developed algorithm.
Brown et al. (2004) investigated the Fm/no-wait, STsi/Cmax problem and demonstrated that
PT

the problem reduces to the traveling salesman problem. They also presented a polynomial
heuristic along with non-polynomial time solution methods. Samarghandi and Elmekkawy
(2012b) presented a GA algorithm and a hybrid GA algorithm with PSO for the same problem.
CE

The PSO is a discrete algorithm that employs a coding/decoding technique based on the
factoradic numbering system in order to map the set of permutations into a set of integer
numbers.
Both Daniella and Marcelo (2010, 2011) and Araújo and Nagano (2011) presented
AC

constructive heuristics for the Fm/no-wait, STsd/Cmax problem. Moreover, Xu et al. (2012)
proposed an efficient IG algorithm for the problem and showed that their algorithm performs
better than the constructive heuristic proposed by Daniella and Marcelo (2010, 2011). Moreover,
Zhu et al. (2013a) presented an iterated algorithm with local search while Zhu et al. (2013b)
proposed an adaptive intelligent algorithm and they showed that their algorithms perform better
than the heuristic of Araújo and Nagano (2011). Furthermore, a hybrid greedy algorithm was
presented by Zhuang et al. (2014) for the problem where it was shown that the algorithm
outperforms the best non-deterministic heuristics on most instances, for the same computational
time, while it obtains the best performance against the deterministic heuristics. Besides, Nagano

11
 ACCEPTED MANUSCRIPT

et al. (2014) presented a hybrid evolutionary cluster search metaheuristic for the problem and
showed that, by comparing it with the solutions of some other related problems, it performs well.
Finally, Samarghandi and Elmekkawy (2014) presented a PSO algorithm for the problem, where
an encoding system called Matrix Coding is used to code job sequences. Zhu and Li (2015)
presented an enhanced greedy random search procedure, which is combined with path-relinking.
In order to improve the exploration of the search, they integrated the procedure with an
evolutionary local search algorithm.
Samarghandi (2015b, 2015c) proposed two GA algorithms for the Fm/no-wait, STsd/Cmax
problem with server side-constraint, i.e., not all machines have dedicated servers. He developed a
diversified local search sub-procedure to further improve the performances of the GA algorithms.

T
He performed a sensitivity analysis by utilizing ANOVA to fine tune the parameters of the

IP
algorithms. He showed that the problem is NP-hard and that the proposed GA algorithms are
effective and efficient.
Lee and Jung (2005) provided a MIP formulation for the Fm/no-wait, STsd/Cmax problem

CR
where there exists precedence constrains. They also proposed some heuristic algorithms for the
problem. On the other hand, Bianco et al. (1999) showed that the Fm/no-wait, rj, STsd/Cmax
problem is equivalent to the asymmetric traveling salesman problem with an additional

US
constraint. They proposed two lower bounds and two heuristics and evaluated the performances
of the bounds and heuristics on randomly generated data. Furthermore, França et al. (2006)
presented a hybrid GA algorithm for the same problem and showed that the hybrid GA is more
efficient. Their hybrid GA algorithm structures the population organized as a ternary tree and a
AN
novel search scheme, called recursive arc insertion, is utilized.

4.2 Research on Cmax for FFm

Both Song et al. (2008) and Tao and Rongqiu (2006) proposed mathematical models and
M

presented heuristics while Tang and Song (2010) proposed a discrete PSO algorithm for the
FFm/no-wait/Cmax problem. Moreover, the process of production in bakeries was shown to be
modelled as FFm/no-wait by Hecker et al. (2013, 2014) where Hecker et al. (2013) proposed
ED

evolutionary algorithms while Hecker et al. (2014) presented a modified GA algorithm, an ACO
algorithm, and random search procedures for the problem with respect to two performance
measures of Cmax and total machine idle time. Hecker et al. (2014) showed that the modified GA
PT

algorithm improves the Cmax performance of the current practice by 9% while it improves the
total machine idle time by 23%. Furthermore, Naderi et al. (2014) proposed two MILP models
and presented a hunting search metaheuristic algorithm, which is based on a model of group
CE

hunting of animals when searching for food, for the FFm/no-wait/Cmax problem.
Jolai et al. (2012) proposed an adapted ICA algorithm, a population based SA algorithm, and
a hybridization of both for the FFm/no-wait, STsd/Cmax problem. Moreover, Ramezani et al.
(2015) independently addressed the problem where the authors presented a hybridized heuristic
AC

consisting of invasive weed optimization, VNS, and SA.

Ying et al. (2012) presented three metaheuristics, based on SA, GA, and IG algorithm, for the
FFm/no-wait, STsd,f/Cmax problem. They indicated that the metaheuristic, based on SA,
outperformed the metaheuristics based on GA and IG algorithms.

4.3 Results on Cj for Fm

Fm/no-wait/Cj is another problem that has been investigated extensively in the literature,
which is summarized in Table 4, and hence, not all the research on the problem is deliberated.
Aldowaisan and Allahverdi (2004b) proposed six different versions of an insertion heuristic for

12
 ACCEPTED MANUSCRIPT

the problem and showed that their heuristics perform much better than the GA algorithm of Chen
et al. (1996). Moreover, Kumar et al. (2006) proposed a psycho-clonal algorithm, which
performs its search through somatic mutation, receptor editing, and balancing the exploitation of
the best solutions with the exploration of the search space. The authors showed that their
algorithm performs better than the best heuristic of Aldowaisan and Allahverdi (2004b). Also,
Pan et al. (2008a) presented a PSO algorithm, which is hybridized with the variable
neighborhood descent algorithm to further improve the solution quality and where several speed-
up methods are proposed for both the swap and insert neighborhood structures. They showed that
their PSO algorithm performs better than that of Fink and Voß (2003). Framinan et al. (2010)
proposed a new constructive heuristic, which is based on an analogy with the two-machine

T
problem in choosing the candidate to be added in the partial schedule. The myopic behavior of

IP
the heuristic is tempered by exploring the neighborhood of the obtained partial schedules. They
showed that their heuristic performs better than those of Bertolissi (2000), Fink and Voß (2003),
and Aldowaisan and Allahverdi (2004b). On the other hand, Laha and Sapkal (2014) proposed a

CR
constructive heuristic, which is based on the assumption that the priority of a job in the initial
sequence is given by the sum of its processing times on the bottleneck machines. The generated
initial sequence of jobs is further improved using a new job insertion technique. They showed

US
that showed that their algorithm performs better than those of Framinan et al. (2010) and
Aldowaisan and Allahverdi (2004b). Moreover, Laha et al. (2014) proposed a penalty-shift
insertion algorithm, which is derived by using the Vogel’s approximation method used for the
classic transportation problem to generate an initial schedule. Next, a known solution is
AN
enhanced using a forward shift heuristic. Then the solution is improved by using a job-pair and a
single-job insertion heuristic. They showed that their heuristic performs better than the heuristic
of Bertolissi (2000) and that of Aldowaisan and Allahverdi (2014b). Deng et al. (2015) proposed
a co-evolutionary quantum GA algorithm where coding and decoding mechanism uses square
M

matrix to represent the quantum individual and adapts the quantum rotation gate to update the
quantum individual. Moreover, they use co-evolution strategy to enhance the evolutionary
pressure and accelerate the convergence. They show that their algorithm performs better than the
ED

heuristics of Liu et al. (2007) and Aldowaisan and Allahverdi (2003).

Yuan et al. (2013) proved the asymptotic optimality of the SPT rule and developed a new
lower bound for the Fm/no-wait/Cj problem. On the other hand, assuming a linear deteriorating
PT

function with identical increasing ranges for all the jobs and some dominating relationships exist
between the machines, Ng et al. (2011) demonstrated that the problem is polynomially solvable.
Brown et al. (2004) showed that the Fm/no-wait, STsi/Cj problem reduces to the time-
CE

dependent traveling salesman problem, and presented a polynomial heuristic along with non-
polynomial time solution methods. Moreover, Ruiz and Allahverdi (2007a) proposed five simple
and fast heuristics for the problem. They also proposed two stochastic local search algorithms
one of which was based on the ILS algorithm. They further provided a dominance relation for the
AC

case of four machines and showed that their heuristics perform better than that of Brown et al.
(2004) and the ACO algorithm of Shyu et al. (2004), which was extended to the m machine case.
Furthermore, an evolutionary clustering search heuristic was proposed by Nagano et al. (2012)
for the problem where they indicated that the heuristic is efficient and performs better than the
best heuristic of Ruiz and Allahverdi (2007a). On the other hand, a constructive heuristic by
breaking the problem in quartets was presented by Nagano et al. (2015) for the Fm/ no-wait,
STsd/Cj problem.
Ren et al. (2014) presented a lower bound and conducted asymptotic analysis of some
algorithms for the Fm/no-wait, rj/Cj problem. On the other hand, Qian et al. (2011) addressed

13
 ACCEPTED MANUSCRIPT

the Fm/no-wait, rj, STsd/Cj problem and presented a hybrid DE algorithm, where a speed-up
evaluation method is incorporated along with the development of a problem dependent local
search for emphasizing exploitation. By extensive computational experiments, they showed that
the algorithm is robust and efficient. Furthermore, Qian et al. (2012) proposed a DE algorithm
with two more speed-up methods for the problem and showed that it performs better than the
algorithm of Qian et al. (2011).

4.4 Results on due date related performance measures for Fm/FFm

Wang et al. (2010a,b) developed properties to speed up operations in generating initial
solutions for the Fm/no-wait/Lmax problem. They proposed a TS algorithm, which incorporates

T
speed-up operations, and compared its performance with few other existing heuristics. On the

IP
other hand, Ruiz and Allahverdi (2007b) presented several heuristics for the Fm/no-wait,
STsi/Lmax problem. They also presented four new efficient GA algorithms where the GA algorithm
uses steady-state and elitist generation scheme. They further provided a dominance relation for

CR
the case of three machines.
Aldowaisan and Allahverdi (2012a) provided some dispatching rules for the Fm/no-wait/Tj
problem. They proposed SA and GA algorithms by using the best performing dispatching rule as

US
initial solution. They further proposed enhanced versions of SA and GA algorithms and showed
that the enhanced version of the SA algorithm performs better. Moreover, Liu et al. (2013)
proposed different dispatching rules and constructive heuristics, including a modified NEH, for
the problem. They introduced a speed-up method to reduce computational time and showed that
AN
the modified NEH performs the best among the dispatching rules and the constructive heuristics.
Furthermore, Ding et al. (2015b) addressed the problem and investigated the objective function
evaluation incremental properties. They proposed accelerated NEH and IG algorithms based on
the incremental properties. They showed that the accelerated algorithms perform much faster
M

than the original algorithms. They also showed that their algorithms perform better than those of
Liu et al. (2013) and Aldowaisan and Allahverdi (2012a).
Aldowaisan and Allahverdi (2015) studied the Fm/no-wait, STsi/Tj problem where they
ED

presented some dispatching rules and used these rules as initial solutions for their proposed SA
and GA algorithms. Moreover, they proposed improved versions of SA and GA algorithms and
showed that the improved versions perform about 95% better than SA and GA algorithms. The
PT

improved version of the GA algorithm performed better than the improved version of SA
algorithm.
The Fm/no-wait/Uj problem was addressed by Aldowaisan and Allahverdi (2012b) where
CE

they proposed several algorithms, based on SA algorithm. They showed that one of their
proposed algorithms, combined with an insertion algorithm, performs very well. On the other
hand, Hu et al. (2012) presented a DE algorithm for the Fm/no-wait, rj, STsd /Uj problem.
An MILP model was proposed by Arabameri and Salmasi (2013) for the Fm/ no-wait,
AC

STsd/(wj1Ej+wj2Tj) problem. Furthermore, they presented PSO and TS algorithms. They showed
that the PSO algorithm performs better than the TS algorithm, especially, for large size problems.
Rabiee et al. (2016) presented a biogeography-based optimization algorithm for the FFm/no-
wait, STsd, rj/Tj problem with machine eligibility. Their proposed algorithm requires more
diversity to increase the capability of search in the first iteration and needs to apply a higher
intensification strategy in the last iteration in order to attain better solutions.

4.5 Other results for Fm/FFm

14
 ACCEPTED MANUSCRIPT

Wang (2007) and Wang and Xia (2006a, b) showed that the problems of Fm/no-wait/Cmax
and Fm/no-wait/wjCj with deteriorating jobs, i.e., the processing time is a decreasing function
of its execution starting time, have polynomial time algorithms. Wang and Xia (2005) also
showed that the problems with respect to Lmax, Tmax, and U are polynomially solvable under
certain cases.
Czogalla and Fink (2012) investigated the ruggedness of the landscape and correlation
between the distance and the quality of a solution to an optimal solution for no-wait flowshop
scheduling problem. They presented some observations and validated these observations by
using two evolutionary algorithms. On the other hand, Höhn et al. (2012) discussed a variant of
no-wait flowshop scheduling problem, which is motivated by continuous casting in the

T
multistage production process in steel manufacturing. The goal was to find a feasible schedule

IP
with a minimum number of interruptions on the last stage. They established the complexity
status of particular cases.
Wang et al. (2006a) studied the no-wait flowshop scheduling problem with dominant

CR
machines. They showed that the problem can be solved in polynomial time with respect to
minimizing discounted total weighted completion time for special cases.
Zhou and Gu (2009) addressed the Fm/no-wait problem with fuzzy job due dates. The

US
objective was to maximize a customer satisfaction function. They proposed hybrid algorithms,
which are based on GA algorithm, to solve the problem.
Spieksma and Woeginger (2005) showed that increasing the speed of some of the machines
for the Fm/no-wait/Cmax problem may actually worsen the objective function. On the other hand,
AN
Chauvet et al. (2001) addressed the scheduling no-wait production with time windows and
flexible processing times. They proposed a low-complexity algorithm for on-line job scheduling
at work centers along a given route in a manufacturing system.
Gerstl et al. (2015) provided a polynomial time algorithm, based on dynamic programing,
M

with the objective of maximizing weighted number of just in time jobs for a proportionate m-
machine no-wait flowshop, which is a special case of m-machine no-wait flowshop.
Azizi et al. (2016) investigated the Fm/no-wait, STsd/Cmax problem with learning effect on
ED

setup times where learning effect differs from one machine to another machine. They proposed
an MILP model and proved that the problem is NP-complete for the case of m=3. Therefore, they
proposed GA and SA algorithms to solve the problem.
PT

Wang and Wu (2003) studied the Fm/no-wait, batch (P)/Cmax problem where batch sequence
dependent times exist in addition to batch transfer times. They presented an ACO algorithm
where the artificial ants iteratively construct feasible job batching and batch sequencing
CE

solutions, guided by the pheromone distributed in the solution space.

Jolai et al. (2009b) addressed the FFm/no-wait problem with due windows with the
performance measure of total profit gained. They presented an MILP model and proposed a GA
algorithm where a heuristic mechanism is presented, which is used in each generation of the GA
AC

algorithm to assure the feasibility and quality of the obtained solutions.

4.6 Multiple criteria research for Fm/FFm

Allahverdi and Aldowaisan (2002) addressed the Fm/no-wait/Fl (Cmax, Cj) problem where
they proposed an insertion heuristic for the problem. Furthermore, they also provided a
dominance relation and presented a B&B algorithm for the case of two machines. On the other
hand, Tan (2011) presented a discrete PSO algorithm, which utilizes VNS, for the problem.
Allahverdi and Aldowaisan (2004) proposed hybrid SA and GA algorithms for the Fm/no-
wait/Fl (Cmax, Lmax) problem and showed that the hybrid approach was efficient. They also

15
 ACCEPTED MANUSCRIPT

provided a dominance relation and proposed a B&B algorithm for the case of two machines. Ruiz
and Allahverdi (2009) also studied the problem and proposed several heuristics and local search
algorithms, based on GA and IG procedures. They showed that their heuristics perform much
better than the best performing algorithm of Allahverdi and Aldowaisan (2004). They also
proposed a dominance relation for the case of three machines.
Javadi et al. (2008) presented a fuzzy multi-objective linear programming model, with
piecewise linear membership functions, for the Fm/no-wait/Fl (wjCj, wjEj) problem. On the
other hand, Jenabi et al. (2010) presented two MILP models and a multi-objective ILS algorithm,
equipped with three types of local search engine, for the Fm/no-wait/Fl (Cmax, Tj) problem.
Naderi-Beni et al. (2012) proposed an MILP model and presented a two-phase fuzzy

T
programming approach to solve the Fm/no-wait, rj, STsd/Fl (Cmax, Tj) problem where sequence

IP
independent removal times also exist. On the other hand, Khalili and Naderi (2015) presented an
MILP model for the FFm/no-wait, STsd/Fl (Cmax, Tj) problem. They also presented a bi-
objective ICA for the problem where the algorithm employs three advanced mechanisms of

CR
imperialist, which are behavior, completion, and independence.
Huang et al. (2015) presented an improved ACO algorithm for the FF2/no-wait, STsi/ Fl
(w1Ej, w2Tj) problem. The improved ACO was shown to be more effective and robust than the
ACO.
US
Tavakkoli-Moghaddam et al. (2007) proposed a hybrid multi objective algorithm, based on a
biological immune system and bacterial optimization, while Tavakkoli-Moghaddam et al. (2008)
presented an immune algorithm for the Fm/no-wait/ #(wjCj, wjTj) problem. They compared
AN
the performance of their proposed algorithm with five other multi objective algorithms and
indicated that their proposed algorithm outperforms the others. On the other hand, Rahimi-
Vahedi et al. (2008) proposed a new multi-objective scatter search algorithm for finding the
locally Pareto-optimal frontier of the problem.
M

Aydilek and Allahverdi (2012) proposed several algorithms including an SA algorithm, a

modified SA algorithm, and combinations of both, for the Fm/no-wait/ε(Cmax/Cj) problem.
They indicated that one of the combined algorithms performs very well. Moreover, Aydilek and
ED

Allahverdi (2013) presented two enhanced versions of SA algorithms and showed that one of
their algorithms reduces the error of best algorithm of Aydilek and Allahverdi (2012) by 70%
with a 30% less CPU time. On the other hand, Allahverdi and Aydilek (2013) provided different
versions of an insertion algorithm and a GA algorithm for the Fm/no-wait/ε(Cj/Cmax) problem.
PT

They showed that one version of the insertion algorithm performs better. They also established a
dominance relation for the four machine case. Furthermore, Allahverdi and Aydilek (2014)
investigated the Fm/no-wait, STsi/ε(Cj/Cmax) and proposed an insertion algorithm, two versions
CE

of GA algorithm, three versions of SA algorithm, and a DEA. They showed that one version of
the SA algorithm performs better than the rest of the algorithms. They also showed that that
version of the SA algorithm reduces the error of the best algorithm of Allahverdi and Aydilek
AC

(2013) by 90% when setup times were zero.

Pan et al. (2008c) presented a multi-objective PSO algorithm for the Fm/no-wait/#(Cmax,
Tmax) problem and showed that their algorithm performs better than the multi-objective hybrid
differential evolution algorithm. Pan et al. (2009) also considered the problem and proposed a
discrete DE algorithm for the problem. On the other hand, Qian et al. (2009c) proposed an MA
algorithm, which is based on DE, for the problem.
Liao et al. (2008a, b) proposed an evolutionary algorithm for the Fm/no-wait/#(Cmax, Cj)
problem. The algorithm makes use of non-dominated sorting strategies to class population
individuals into Pareto fronts in order to improve searching efficiency. Moreover, two local

16
 ACCEPTED MANUSCRIPT

search procedures were utilized in order to improve searching effectiveness. Liu et al. (2008b)
investigated the same problem and offered a hybrid GA algorithm, which makes use of the
principle of non-dominated sorting, coupled with the use of elitist solutions strategy.
Pan et al. (2011) presented an enhanced shuffled frog-leaping algorithm for the Fm/no-
wait/#(Cmax, Tmax, Cj) problem. They showed that the algorithm is effective and efficient based
on the computational analysis. On the other hand, Xie and Li (2012) proposed an evolved
discrete harmony search algorithm. In their algorithm, a job-permutation-based encoding scheme
is applied and a new method is presented to generate new solutions, while an efficient approach
is established to update the archive set of the non-dominated solutions during the search process.
Nagano and Araujo (2014) proposed two new constructive heuristics for the Fm/no-wait,

T
STsd problem to minimize Cmax and total flowtime. One heuristic is based on structural property

IP
to minimize Cmax while the other heuristic breaks the problem in quartets to minimize total
flowtime.
Khalili (2014) proposed an MILP model for the FFm/no-wait /# (Cmax, Tj) problem. He

CR
also presented a multi-objective EM algorithm, which is a flexible and effective population-
based algorithm utilizing an attraction/repulsion mechanism to move the particles towards
optimality. On the other hand, in the presence of setup times, Asefi et al. (2014) proposed a
hybrid metaheuristic for the FFm/no-wait, STsd /#(Cmax, Tj) problem where they compared their
US
metaheuristic with a recent multi-objective heuristic in the literature. Moreover, Khalili (2012)
proposed a multi-objective EM algorithm for the problem but where there exist transportation
times between different stages of the no-wait flowshop.
AN
5. No-wait job shop and no-wait open shop problems
The results for no-wait job shop and no-wait open shop scheduling problems are
summarized in this section. Job shop results are presented in section 5.1 while the results for
M

open shop are deliberated in section 5.2. Table 6 summarizes the results for both shops where
mainly the Cmax performance measure has been investigated. The table is organized by shop type
first, then by the number of stages, next by the setup type, and finally by the criterion.
ED

The no-wait job shop and the no-wait open shop problems are shown to be NP-hard even if
each job consists of only two operations and there are only two stages, e.g., see Sviridenko
(2003). The complexities of different no-wait job shop and no-wait open shop problems are
PT

provided by Hall and Sriskandarajah (1996). The complexities of the new problems, if known,
are stated.
CE

5.1. No-wait job shop

Woeginger (2004) showed that the J2/no-wait/Cmax problem is NP-hard with at most five
operations while the J3/no-wait/Cmax problem is NP-hard with at most three operations.
Moreover, Lennartz (2003) provided the relationship between the Traveling Salesman Problem
AC

and special cases of the no-wait job shop problem.

Koulamas and Panwalkar (2016) showed that the J2/no-wait/Cmax problem is solvable in O(n
long n) time when each job has the same operation time on both machines, which is called
proportionate job shop. They also indicated that the problem is NP-hard when some jobs visit
only one of the machines. Furthermore, they showed that, when missing operations are on the
same machine, the problem with missing operations become solvable in O(n long n) time.
Liaw (2008) presented a two-phase heuristic for the J2/no-wait/Cmax problem where the
problem is transformed into the two-machine flowshop problem in the first phase while, in the
second phase, a TS algorithm is used to improve the solution obtained in the first phase. He

17
 ACCEPTED MANUSCRIPT

showed by the computational experiments that the heuristic performs well by comparing its
performance to the optimal solution and a lower bound. Furthermore, Mokhtari (2014) proposed
a method, which is a combination of an artificial neuro-evolutionary network and VNS for the
same problem. The objective of the method is to utilize the key characteristics of the two
approaches to achieve better solutions. On the other hand, Samarghandi and Elmekkawy (2013)
developed a mathematical model and proposed a GA algorithm for the J2/no-wait, STsi/Cmax
problem.
Kravchenko (1998) provided a polynomial time algorithm for the J2/no-wait/Cj problem
where each job is a chain of unit processing time operations, which are processed alternatively
on the two machines.

T
Bansal et al. (2005) showed that the Jm/no-wait/Cmax problem is NP-hard for the case when

IP
each job has three or more operations. On the other hand, they showed that if each job has at
most two operations, the problem admits a polynomial time approximation scheme if the number
of machines is constant. AitZai et al. (2015) proposed a B&B algorithm where they defined a

CR
new method of branching for the Jm/no-wait/Cmax problem and proposed a PSO algorithm. On
the other hand, Vermeulen et al. (2011) presented exact solution methods using integer linear
programming and a combination of binary search with constraint programming for the problem.

US
One more problem that has been investigated extensively in the literature is Jm/no-
wait/Cmax, which is summarized in Table 6, and thus, not all the research on the problem is
discussed. Mascis and Pacciarelli (2002) formulated the problem by using alternative graphs
where they presented fast heuristics and indicated that a key property used in most TS algorithms
AN
for the regular job shop problems is not valid for the no-wait environments. Ahani and Asyabani
(2014) proposed a TS algorithm to resolve the problem identified by Mascis and Pacciarelli
(2002). Furthermore, Framinan and Schuster (2006) proposed a metaheuristic, called complete
local search with memory, by integrating a new timetabling procedure for the problem. Besides,
M

Pan and Huang (2009) proposed a hybrid GA, where a section of genes from a chromosome is
cut and treated as a sub-problem. This sub-problem is then transformed into an asymmetric
traveling salesman problem, which is solved by a heuristic algorithm. Next, this section with new
ED

sequence is put back to substitute the original section of chromosome. They showed that the
hybrid GA algorithm outperforms the heuristics of Mascis and Pacciarelli (2002). Moreover,
Bozejko and Makuchowski (2011) presented a GA with automatic adjustment. The automated
PT

adjustment of the mutation’s probability of designating individuals undergo mutation, and

automatic scaling of the fitness function value takes place during the run of the algorithm. They
showed that the GA with automatic adjustment outperforms the hybrid algorithm of Schuster and
CE

Framinan (2003). Furthermore, Zhu and Li (2012) presented a modified complete local search
memory algorithm where an efficient Shift Penalty-Based Timetabling method is proposed, that
constructs two preliminary timetables from time difference-based sets and improves them by an
investigated timetable tightening method. Next, a modified complete local search with memory
AC

is presented for the sequencing problem. They showed that their algorithm performs better than
those of Framinan and Schuster (2006) and Zhu et al. (2009a). Further, Li et al. (2015) proposed
a new local search method, based on memory and variable neighborhood structure along with a
new local search method, and showed that their method outperforms the algorithm of Zhu et al.
(2009a). On the other hand, Sundar et al. (2015) presented a hybrid artificial bee colony
algorithm, which coordinates different components of the algorithm such as solution initiation,
selection and determination of a neighboring solution with a local search in order to attain high
quality solutions. They showed that the hybrid algorithm performs better than those of Zhu et al.
(2009a) and Zhu and Li (2012).

18
 ACCEPTED MANUSCRIPT

Chang et al. (2008) proposed a real-time (on line) scheduling algorithm, which utilizes
resources efficiently while controlling the WIP level, for the Jm/no-wait/Cmax. On the other hand,
Bürgy and Gröflin (2013) presented an efficient algorithm for the Jm/no-wait, STsd/Cmax problem
They also proposed a heuristic, based on job insertion, and showed that the heuristic performs
well based on current benchmarks.
Sundar et al. (2013) proposed an artificial bee colony algorithm and investigated its
performance on standard benchmark instances for the FJm/no-wait/Cmax problem. On the other
hand, Raaymakers and Hoogeveen (2000) proposed an SA algorithm for the FJm/no-wait/Cmax
problem where there might be overlapping operations.

T
5.2. No-wait open shop

IP
Giaro (2001) investigated the complexity of some simplified scheduling problems for no-
wait open shops. He showed that even the two-machine problem is NP-hard. He further showed
that the problem is NP-hard if the scheduling graph of a system is a path or a cycle.

CR
Sidney and Sriskandarajah (1999) proposed a heuristic algorithm and analyzed its
complexity and worst-case performance measure for the O2/no-wait/Cmax problem. Moreover,
Liaw et al. (2005) presented few dominance rules and proposed a B&B algorithm for the

US
problem. They also presented a two-phase heuristic for the problem. Furthermore, Panwalkar and
Koulamas (2014) showed that, under certain cases, the O2/no-wait/Cmax problem can be reduced
to the traveling salesman problem which can be solved in O(n log n) time.
Naderi and Zandieh (2014) provided three mixed integer linear formulations for the Om/no-
AN
wait/Cmax problem. The formulations can be used to solve the problem optimally for small size
problems. For large size problems, they proposed a metaheuristic, which is based on GA and
VNS algorithms. Furthermore, Lin et al. (2008) presented a two-stage heuristic for the Om/no-
wait problem with the objective of minimizing total occupational time of the m processing
M

stages, or equivalently minimizing the social costs, with movable dedicated machines. This
scheduling problem is related to the road construction works that include laying pipes for phone,
gas, and water.
ED

6. Conclusions
Scheduling with no-wait constraint is applicable in industries such as plastic, chemical, and
PT

pharmaceutical. Making the right scheduling decisions, in such environments, is important in

order to increase productivity and eliminate waste. Therefore, the research interest in scheduling
problems with no-wait constraint has been growing. This paper is the second survey paper
CE

providing analysis and an extensive review of more than 300 papers that appeared since the mid-
1993 to the beginning of 2016. This paper classifies scheduling problems with no-wait
constraint, based on shop type environments, performance measures, setup types, and others.
Moreover, some potential research venues are proposed.
AC

Some papers have independently investigated the same problem. For example, the problems
Fm/no-wait/Cmax and Fm/no-wait/Cj were addressed by about 15 papers and their results have
not been compared. Such problems have been determined and summarized in Table 7 for
researchers for convenience. Since the solution methodologies proposed in these papers have not
been compared, this is a direction of research for those researchers willing to conduct research on
scheduling problems with no-wait constraint. The first column in Table 7 denotes the addressed
problem. The third column in the table indicates the methodology utilized while the second
column shows the references addressing the problem. For example, the FFm/no-wait/Cmax
problem was independently investigated by Hecker et al. (2014) and Naderi et al. (2014). Hecker

19
 ACCEPTED MANUSCRIPT

et al. (2014) proposed a modified GA algorithm while Naderi et al. (2014) presented a hunting
search metaheuristic for the same problem. Hence, the modified GA algorithm of Hecker et al.
(2014) should be compared with the hunting search metaheuristic of Naderi et al. (2014). Many
such problems are presented in Table 7.
The vast majority of research addressed job completion time related performance measures,
i.e., Cmax and Cj. More than 50% of papers addressed the Cmax performance measure while
about 25% of the papers addressed the Cj performance measure. Moreover, mainly the Cmax
performance measure was addressed for job shop and open shop environments. Thus, more
research is needed for other performance measures, i.e., other than Cmax, in these two
environments. Moreover, it should be noted that on time delivery of products is very important in

T
the current competitive work environments. However, job due date related performance

IP
measures are only addressed in about 8% of the papers. Therefore, more research on scheduling
problems with due date related performance measures is needed.
Scheduling problems addressing more than a single criterion, i.e., multiple criteria constitute

CR
about 10% of the papers. However, many real life scheduling problems require multiple criteria.
Therefore, there exists a need to address more scheduling problems with multiple criteria.
Moreover, the existing results with multiple criteria are for flowshop environments and no result

US
exists for job shop or open shop environments. Hence, job shop or open shop scheduling
problems with multiple criteria are venues for new research.
The concept of past-sequence-dependent setup times was introduced by Koulamas and
Kyparisis (2008) where the setup time is defined to be dependent on the jobs that have already
AN
been scheduled. More specifically, the setup time of a job is proportionate to the sum of
processing times of the jobs already scheduled. Research, on scheduling problems with past-
sequence-dependent setup times, is limited to the environments of single machine or regular
flowshops, e.g., Soroush (2014, 2015). Therefore, another research area to consider is the past-
M

sequence-dependent setup times for scheduling problems with no-wait constraint.

7. Acknowledgements
ED

I would like to express my sincere gratitude to three referees for their comprehensive review of
the long paper and for the exceptional comments, which significantly improved the quality and
presentation of the paper. This research was supported and funded by Kuwait University
PT

Research Grant No. EI02/14.

CE
AC

20
 ACCEPTED MANUSCRIPT

T
Table 3: Summary of the research on two/three machine no-wait flowshop scheduling problems
Criterion F/ Setup # of Approach Comments Reference

IP
FF type stages
Cmax F ZS 2 Heuristics rj, machine availability constraint Ben Chihaoui et al. (2009)
2 Lower and upper bounds, B&B rj, machine availability constraint Ben Chihaoui et al. (2011)

CR
2 An algorithm and its complexity analysis Chen and Wang (2013)
2 A Polynomial approximation algorithm Machine availability constraint Cheng and Liu (2003a)
2 3/2-approximation algorithm Machine availability constraint Cheng and Liu (2003b)
2 Heuristic algorithms Machine availability constraint Espinouse et al. (1999)
2 Complexity analysis Machine availability constraint Espinouse et al. (2001)
2 A heuristic with worst-case ratio of 4/3 Jobs with missing operations Glass et al. (1999)

STsi
2
2
2, 3
2
An algorithm with worst-case ratio of 3/2
Polynomial time approximation scheme
GA, SA
Problem is reduced to traveling salesman
problem
US
A non-availability interval
Machine maintenance

Removal times also separate from

processing times
Kubzin and Strusevich (2004)
Kubzin and Strusevich (2005)
Wang et al. (2006b)
Gupta et al. (1997)
AN
2 A heuristic algorithm and its worst-case Setup times on the second machine consist Sidney et al. (2000)
performance of two parts
2 A hybrid algorithm consisting of VNS and Setups are conducted by a single server Samarghandi and ElMekkawy (2011)
TS
FF ZS 2 An algorithm based on neural network and Shafaei et al. (2011)
fuzzy theory
M

2 Integer programming model, discrete PSO Song and Tang (2008)

2 GA Wang and Liu (2013)
2 Lower bounds, B&B Wang et al. (2015b)
2 Mathematical model Wu and Chen (2006)
2 A heuristic algorithm Xie et al. (2004)
ED

2, 3 Polynomial time algorithms Cheng et al. (2000)

2 TS, PSO Ghaleb et al. (2015)
2 A greedy heuristic A single machine in either stage Liu et al. (2003)
STsd 2 A hybrid algorithm based on ICA Rabiee et al. (2014)
Cj F ZS 2 ICA Jobs might have rework Rabiee et al. (2012)
PT

STsi 2 Dominance relation, heuristic Optimal solutions for special cases Aldowaisan and Allahverdi (1998)
2 Dominance relation, B&B Aldowaisan (2001)
2 An algorithm Removal times are also separate, optimal Chang and Shao (2005)
properties are analyzed
2 A heuristic, B&B Setups are conducted by a single server Su and Lee (2008)
CE

3 Dominance relation, block insertion Removal times also separate Aldowaisan and Allahverdi (2004a)
heuristic
3 Dominance relation, insertion heuristics Optimal solutions for special cases Allahverdi and Aldowaisan (2000)
3 Heuristics An optimal property is provided Chang and Shao (2006)
21
AC
 ACCEPTED MANUSCRIPT

T
STsd 2 Dominance relation, insertion heuristics Optimal solutions for special cases Allahverdi and Aldowaisan (2001)
FF STsi 2 An optimal algorithm with O(n log n) time Unit processing times Guirchoun et al. (2005)

IP
2 ACO Unit setup times Huang et al. (2009)
2 GA, adaptive ICA Unit setup times Moradinasab et al. (2013)
Lmax STsi 2 Dominance relations Dileepan (2004)

CR
2 Dominance relation, B&B Removal times also separate, optimal Fondrevelle et al. (2005)
solutions for special cases
STsi,f 2 GA Pang (2013)
2 Dominance relations, heuristic algorithm Wang and Cheng (2006)
Tj FF ZS 2 PSO, ICA Moradinasab et al. (2012)

Paper
#
Criterion F/
FF
Setup
type
Approach US
Table 4: Summary of the research on m-machine no-wait flowshop scheduling problems with single criterion
Comments Reference Better than
AN
P1 Cmax F ZS A hybrid algorithm which is a combination of Akrout et al. (2013) P12, P14, P32, P42,
GRASP and DE (1*)
P2 Heuristics based on SA and GA Improved SA and GA Aldowaisan and Allahverdi (2003) P9, P24
P3 Quantum based PSO Chang et al. (2010)
P4 GA rj Chaudhry and Khan (2012) P24
P5 A discrete self-organizing migrating algorithm Davendra et al. (2013) (1*)
M

P6 A tabu mechanism improved greedy algorithm Ding et al. (2014, 2015a) P14, P32, P35, P36,
P42, (1*)
P7 An algorithm based on adaptive learning Engin and Günaydin (2011) P2, (1*)
approach
P8 A heuristic Framinan and Nagano (2008) P24, (1*)
ED

P9 An insertion heuristic Gangadharan and Rajendran (1993)

P10 A discrete harmony search algorithm Gao et al. (2011a) (1*)
P11 Hybrid GA Gonzalez et al. (1995) (1*)
P12 A descending search algorithm, TS Grabowski and Pempera (2005)
P13 A constructive heuristic Hong and Pang (2009)
PT

P14 A hybrid GA Jarboui et al. (2011) P12, P32

P15 Lower bounds, solvable cases New network Kalczynski and Kamburowski (2007)
representation
P16 Decomposition method based on fuzzy logic Macchiaroli et al. (1996)
P17 TS Macchiaroli et al. (1999) (1*)
CE

P18 A constructive heuristic Laha and Chakraborty (2009) P2, P9, P24, (1*)
P19 A composite heuristic Li and Wu (2008) P2, (1*)
P20 A composite heuristic Li et al. (2006, 2008) P2, (1*)
P21 Hybrid PSO Liu et al. (2007)

22
AC
 ACCEPTED MANUSCRIPT

T
P22 Hybrid PSO Processing times are Liu et al. (2006, 2008a)
random variables

IP
P23 Polynomial solution Deteriorating jobs Ng et al. (2011)
P24 An insertion heuristic Rajendran (1994)
P25 Hybridization of ACO and local search Riyanto and Santosa (2015) P36, (1*)
P26 PSO dj Samarghandi (2015a)

CR
P27 Polynomial time approximation scheme Sviridenko (2003)
P28 Polynomial time approximation scheme Sviridenko and Woeginger (2000)
P29 VNS Pan and Zhu (2006) P12
P30 PSO Pan et al. (2005)
P31 ACO Pan et al. (2007)
P32
P33
P34
P35
P36
PSO
Upper bounds Taillard's benchmark suite
Hybrid PSO
An improved IG algorithm
Hybrid DE algorithm
US Pan et al. (2008a)
Pan et al. (2008b)
Pan et al. (2008d)
Pan et al. (2008e)
Qian et al. (2009a)
P12

P21, P30, (1*)

P12
AN
P37 Hybrid DE algorithm Dynamic job arrivals Qian et al. (2009b)
P38 Hybrid tabu search Samarghandi and Elmekkawy(2012a) P21, (1*)
P39 Discrete PSO Song and Tang (2010)
P40 An iterative neighborhood search algorithm Song et al. (2011)
P41 Polynomial solution Deteriorating jobs and Sun et al. (2012)
dominated machines
M

P42 Hybrid GA Tseng and Lin (2010) P12, P21

P43 Fast ILS Wang (2014) P12, P32, (1*)
P44 ILS Wang et al. (2008) P32, (1*)
P45 A hybrid intelligence algorithm Wang et al. (2013)
P46 Distribution algorithms Wu et al. (2011)
ED

P47 An integrated scheduling algorithm Xie et al. (2013)

P48 PSO Zhang and Chen (2014)
P49 Hybrid quantum-inspired evolutionary Zheng and Yamashiro (2010)
algorithm
P50 Hybrid GA Zhu et al. (2011b) P2, (1*)
PT

P51 STsi PSO, GA Samarghandi and Elmekkawy(2012b) (2*)

P52 Polynomial and non-polynomial heuristics Brown et al. (2004) (2*)
P53 STsd A new constructive heuristic Araújo and Nagano (2011)
P54 Lower bounds, heuristics rj Bianco et al. (1999)
P55 Constructive heuristic Daniella and Marcelo (2010, 2011)
CE

P56 Hybrid GA rj França et al. (2006)

P57 MIP, heuristic algorithms Precedence constraints Lee and Jung (2005)
P58 Hybrid evolutionary cluster search Nagano et al. (2014) (3*)
metaheuristic

23
AC
 ACCEPTED MANUSCRIPT

T
P59 GA Server-side constraint Samarghandi (2015b, 2015c)
P60 PSO Samarghandi and Elmekkawy (2014) (3*)

IP
P61 IG algorithm Xu et al. (2012) P55, (3*)
P62 Iterative algorithm, iterative algorithm with Zhu et al. (2013a) P53, (3*)
local search
P63 An adaptive intelligent method Zhu et al. (2013b) P53, (3*)

CR
P64 Hybrid greedy algorithm Zhuang et al. (2014) (3*)
P65 FF ZS Evolutionary algorithms Hecker et al. (2013)
P66 Modified GA, ACO, random search Hecker et al. (2014) (4*)
P67 Mathematical model, heuristic Song et al. (2008)
P68 Mathematical model, heuristic Tao and Rongqiu (2006)
P69
P70

P71 STsd
Discrete PSO
MILP, a hunting search metaheuristic
algorithm
Adapted ICA, population based SA,
combination of both
US Tang and Song (2010)
Naderi et al. (2014)

Jolai et al. (2012)

(4*)

(5*)
AN
P72 A hybridized heuristic consisting of invasive Ramezani et al. (2015) (5*)
weed optimization, VNS, and SA
P73 STsd,f Metaheuristics based on SA, GA, and Ying et al. (2012)
integrated greedy
P74 Cj F ZS PSO based MA Akhshabi et al. (2014) P79
P75 An insertion heuristic Aldowaisan and Allahverdi (2004b) P79
M

P76 A heuristic Bertolissi (2000)

P77 GA Chang and Gong (2007) P75, (6*)
P78 GA Chaudry et al. (2014) P75, P84-87, (6*)
P79 GA Chen et al. (1996)
P80 PSO Czogalla and Fink (2008, 2009) P82, (6*)
ED

P81 A hybrid evolutionary algorithm Filho et al. (2007) P82, P96, (6*)
P82 Different metaheuristics including SA and TS Fink and Voß (2003)
P83 A constructive heuristic Framinan et al. (2010) P75, P76, P82
P84 A harmony search algorithm Gao et al. (2010)
PT

P85 A discrete harmony search algorithm Gao et al. (2011b)

P86 A hybrid harmony search algorithm Gao et al. (2012)
P87 Composite heuristics Gao et al. (2013a)
P88 A migrating birds optimization algorithm Gao et al. (2013b) P87, (6*)
CE

P89 A psycho-clonal algorithm Kumar et al. (2006) P75, (6*)

P90 A constructive heuristic Laha and Sapkal (2011) P76, (6*)
P91 A constructive heuristic Laha and Sapkal (2014) P75, P83, (6*)
P92 A penalty-shift insertion algorithm Laha et al. (2014) P75, P76, (6*)
24
AC
 ACCEPTED MANUSCRIPT

T
P93 A composite heuristic algorithm Li and Zhu (2013)
P94 Orthogonal GA Liao (2009)

IP
P95 Polynomial solution Deteriorating jobs Ng et al. (2011)
P96 PSO Pan et al. (2008a) P82
P97 Hybrid algorithm based on TS Qi and Qiu (2008)

CR
P98 Lower bound, asymptotic analysis rj Ren et al. (2014)
P99 A heuristic Sapkal and Laha (2011a)
P100 A heuristic Sapkal and Laha (2011b)
P101 A heuristic based on Vogel’s approximation Sapkal and Laha (2012)
method
P102 A constructive heuristic Sapkal and Laha (2013) P76, (6*)
P103
P104
P105
P106
P107
A discrete harmony search algorithm
A heuristic
A discrete DE algorithm
A hybrid GA and VNS algorithm
A new lower bound
US Sun and Dong (2014)
Sun et al. (2011)
Tasgetiren et al. (2007)
Yang et al. (2008)
Yuan et al. (2013)
(6*)

P82, (6*)
P82, (6*)
AN
P108 An artificial immune algorithm Zhao and Tang (2010)
P109 A hybrid heuristic Zhu et al. (2007) P75, P76
P110 Hybrid GA Zhu et al. (2008a) P75, P82, (6*)
P111 A hybrid heuristic Zhu et al. (2008b) P75, P76, (6*)
P112 An IG algorithm Zhu et al. (2009b)
P113 An evolutionary algorithm Zhu et al. (2011a) P75, P82, P96, (6*)
M

P114 STsi Polynomial and non-polynomial heuristics Brown et al. (2004)

P115 An evolutionary clustering search heuristic Nagano et al. (2012) P116
P116 Dominance relation, heuristics, stochastic Dominance relation for Ruiz and Allahverdi (2007a) P114
local search algorithm the case m=4
ED

P117 STsd A new constructive heuristic Nagano et al. (2015)

P118 Hybrid DE rj Qian et al. (2011)
P119 DE algorithm with two speed-up methods rj Qian et al. (2012) P118
P120 Lmax F ZS TS Properties to speed up Wang et al. (2010a,b)
operations
PT

P121 STsi Heuristics, GA, dominance relation Dominance relation for Ruiz and Allahverdi (2007b)
the case m=3
P122 Tj F ZS SA, GA, enhanced SA, enhanced GA Aldowaisan and Allahverdi (2012a)
P123 Accelerated NEH and IG algorithms Ding et al. (2015b) P122, P124
CE

P124 Dispatching rules, constructive heuristics, Liu et al. (2013)

modified NEH
P125 STsi Dispatching rules, SA, GA, improved versions Aldowaisan and Allahverdi (2015)
of SA and GA

25
AC
 ACCEPTED MANUSCRIPT

T
P126 U j F ZS Heuristics based on SA and insertion Aldowaisan and Allahverdi (2012b)
P127 STsd DE algorithm rj Hu et al. (2012)

IP
Table 5: Summary of the research on m-machine no-wait flowshop scheduling problems with multi-criteria
Criteria F/ Setup Approach Comments Reference

CR
FF type
Fl (Cmax, Cj) F ZS Dominance relation, B&B, insertion heuristic Dominance relation, B&B, and optimal Allahverdi and Aldowaisan (2002)
solutions for special cases when m=2
A discrete PSO Tan (2011)
Fl (Cmax, Lmax) Hybrid SA, hybrid GA, dominance relation, Dominance relation and B&B for m=2 Allahverdi and Aldowaisan (2004)

Fl (Cmax, Tj)
Fl (wjCj,
B&B
Heuristics, local search algorithms based on GA
and IG procedure
MILP, multi-objective ILS
A fuzzy multi-objective linear programming
US
Dominance relation for the case m=3 Ruiz and Allahverdi (2009)

Jenabi et al. (2010)

Javadi et al. (2008)
AN
(wjEj) model
ε(Cmax/Cj) SA, modified SA, combination of both Aydilek and Allahverdi (2012)
Enhanced versions of SA Aydilek and Allahverdi (2013)
ε(Cj/Cmax) Different versions of insertion algorithm, GA Dominance relation for the case m=4 Allahverdi and Aydilek (2013)
# (Cmax, Tmax) Multi-objective PSO Pan et al. (2008c)
Discrete DE algorithm Pan et al. (2009)
M

# (Cmax, Cj) An evolutionary algorithm Liao et al. (2008a)

A hybrid evolutionary algorithm Liao et al. (2008b)
Hybrid GA Liu et al. (2008b)
# (Cmax, Tmax, An enhanced shuffled frog-leaping algorithm Pan et al. (2011)
Cj)
ED

An evolved discrete harmony search algorithm Xie and Li (2012)

# (wjCj, wjTj) A multi-objective scatter search algorithm Rahimi-Vahedi et al. (2008)
A hybrid multi objective algorithm Tavakkoli-Moghaddam et al. (2007)
An immune algorithm Tavakkoli-Moghaddam et al. (2008)
ε(Cj/Cmax) STsi An insertion algorithm, SA, GA, DEA Allahverdi and Aydilek (2014)
PT

(Ej+Tj) STsd TS, PSO Arabameri and Salmasi (2013)

Fl (Cmax, Tj) MILP, fuzzy programming rj, Removal times are also separate Naderi-Beni et al. (2012)
# (Cmax, Tj) FF ZS A multi-objective EM algorithm Transportation times Khalili (2012)
MILP, multi-objective EM algorithm Khalili (2014)
CE

STsd A hybrid metaheuristic algorithm Asefi et al. (2014)

Fl (Cmax, Tj) STsd MILP, a bi-objective ICA Khalili and Naderi (2015)

26
AC
 ACCEPTED MANUSCRIPT

T
Table 6: Summary of the research on no-wait job shop and open shop scheduling problems
Shop # of Setup Criterion Approach (comments) Reference

IP
type stages type
J 2 ZS Cmax Complexity analysis (proportionate job shop) Koulamas and Panwalkar (2016)
A heuristic, TS Liaw (2008)

CR
A neuro-evolutionary algorithm Mokhtari (2014)
Cj A polynomial time algorithm (each job a chain of unit processing time) Kravchenko (1998)
STsi Cmax Mathematical model, GA Samarghandi and Elmekkawy (2013)
2, 3 ZS Cmax Analysis of complexity of the problems Woeginger (2004)
m ZS Cmax TS Ahani and Asyabani (2014)
B&B algorithm AitZai et al. (2015)

Hybrid TS
GA, PSO
A distribution algorithm
US
Analysis of complexity of the problem

A complete local search with memory algorithm

Bansal et al. (2005)
Bozejko and Makuchowski (2009)
Bozejko and Makuchowski (2011)
Chen et al. (2014)
Framinan and Schuster (2006)
AN
Disjunctive graph approach Gröflin and Klinkert (2007)
Relationship between the problem and traveling salesman problem Lennartz (2003)
A new local search method Li et al. (2015)
Problem formulation, heuristics, TS Mascis and Pacciarelli (2002)
A metaheuristic Meloni et al. (2004)
Two-phase GA (with controllable processing times) Mokhtari (2011)
M

Hybrid GA Pan and Huang (2009)

TS, hybrid TS, hybrid TS and PSO Samarghandi et al. (2013)
Analysis of complexity of the problem, TS Schuster (2006)
VNS, hybrid algorithm using GA and SA Schuster and Framinan (2003)
ED

A hybrid artificial bee colony algorithm. Sundar et al. (2015)

Integer linear programming, binary search Vermeulen et al. (2011)
Modified local search with memory algorithm Zhu and Li (2012)
Complete local search with limited memory algorithm Zhu et al. (2009a)
Resource level, WIP An algorithm (on line scheduling) Chang et al. (2008)
STsd Cmax A heuristic Bürgy and Gröflin (2013)
PT

FJ m ZS Cmax SA (overlapping operations) Raaymakers and Hoogeveen (2000)

Artificial bee colony algorithm Sundar et al. (2013)
O 2 ZS Cmax Dominance rules, B&B algorithm, heuristic Liaw et al. (2005)
Connection to traveling salesman problem Panwalkar and Koulamas (2014)
Heuristic, worst case performance analysis Sidney and Sriskandarajah (1999)
CE

m ZS Occupational time A two-stage heuristic Lin et al. (2008)

Cmax Mixed integer linear formulation, metaheuristic based on GA and VNS Naderi and Zandieh (2014)
Analysis of complexity of the problem Giaro (2001)

27
AC
 ACCEPTED MANUSCRIPT
Table 7: Independently addressed problems
Problem References Methodology
Fm/no-wait/Cmax Riyanto and Santosa (2015)
Akrout et al. (2013)
Davendra et al. (2013)
Wang (2014)
Wang et al. (2008)
Macchiaroli et al. (1999)
Gonzalez et al. (1995)
Gao et al. (2011)
Engin and Günaydin (2011)
Laha and Chakraborty (2009)
Zhu et al. (2011b)
Framinan and Nagano (2008)
Pan et al. (2008d)
US
Li and Wu (2008)
Li et al. (2008)
Lin and Ying (2016)
Fm/no-wait, STsi/Cmax Brown et al. (2004)
AN
Samarghandi and Elmekkawy (2012b)
Fm/no-wait, STsd/Cmax Zhuang et al. (2014)
Samarghandi and Elmekkawy (2014)
Nagano et al. (2014)
M
Zhu et al. (2013a)
Zhu et al. (20113b)
Xu et al. (2012)
ED
FFm/no-wait/Cmax Hecker et al. (2014)
Naderi et al. (2014)
FFm/no-wait, STsd/Cmax Jolai et al. (2012)
Ramezani et al. (2015)
PT
Fm/no-wait/Cj Tasgetiren et al. (2007)
Kumar et al. (2006)
Chang and Gong (2007)
CE
Filho et al. (2007)
Yang et al. (2008)
Czogalla and Fink (2008)
Zhu et al. (2008a)
AC
Zhu et al. (2008b)
Zhu et al. (2011a)
Sapkal and Laha (2013)
Gao et al. (2013b)
Laha and Sapkal (2011, 2014)
Laha et al. (2014)
Chaudry et al. (2014)
Fm/no-wait/Fl (Cmax, Cj) Allahverdi and Aldowaisan (2002)
Tan (2011)
Fm/no-wait/ #(wjCj, wjTj) Tavakkoli-Moghaddam et al. (2007)
Tavakkoli-Moghaddam et al. (2008)
28
Hybridization of ACO algorithm with local search
A hybrid algorithm, which combines GRASP with
DE algorithm
A discrete self-organizing migrating algorithm
Fast ILS algorithm
ILS algorithm
TS algorithm
T
Hybrid GA
A discrete harmony search algorithm
IP
An algorithm based on adaptive learning approach
A constructive heuristic
CR
Hybrid GA
A heuristic
Hybrid PSO
A composite heuristic
A composite heuristic
A heuristic consisting of three phases
A polynomial heuristic
Hybrid GA and PSO algorithm
A hybrid greedy algorithm
PSO algorithm
A hybrid evolutionary cluster search metaheuristic
An iterated algorithm
A adaptive intelligent method
An IG algorithm
Modified GA algorithm
A hunting search metaheuristic
Hybridized algorithm of ICA and SA
Hybridized algorithm of VNS, SA, and invasive weed
optimization
Discrete DE algorithm
A psycho-clonal algorithm
GA algorithm
A hybrid evolutionary algorithm
Hybrid GA and VNS algorithm
PSO algorithm
Hybrid GA algorithm
A hybrid heuristic
An evolutionary algorithm
A constructive heuristic
A migrating birds optimization algorithm
A constructive heuristic
A penalty-shift insertion algorithm
GA algorithm
An insertion heuristic
PSO algorithm
A hybrid algorithm
An immune algorithm
 ACCEPTED MANUSCRIPT

Rahimi-Vahedi et al. (2008) A scatter search algorithm

Fm/no-wait/#(Cmax, Tmax)
Fm/no-wait/#(Cmax, Cj)
Fm/no-wait/#(Cmax, Tmax,
Cj)
J2/no-wait/Cmax
Jm/no-wait/Cmax
Pan et al. (2008c) PSO algorithm
Pan et al. (2009) DE algorithm
Qian et al. (2009c) MA algorithm
Liao et al. (2008b) A hybrid evolutionary algorithm
Liu et al. (2008b) Hybrid GA
Pan et al. (2011) A shuffled frog-leaping algorithm
Xie and Li (2012) A discrete harmony search algorithm
Liaw (2008) TS
Mokhtari (2014) A neuro evolutionary algorithm
Ahani and Asyabani (2014) TS

T
Meloni et al. (2004) A metaheuristic
Pan and Huang (2009) Hybrid GA

IP
Bozejko and Makuchowski (2009) Hybrid TS
Bozejko and Makuchowski (2011) GA
Li et al. (2015) A new local search algorithm

CR
Samarghandi et al. (2013) Hybrid TS and PSO
Chen et al. (2014) An enhanced distribution algorithm
Sundar et al. (2015) An artificial bee algorithm

1.
US
References

Adressi, A., Hassanpour, S.T., Azizi, V., 2016. Solving group scheduling problem in no-wait flexible flowshop with
random machine breakdown. Decision Science Letters 5 (1), 157-168.
AN
2. Agnetis, A., 2000. Scheduling no-wait robotic cells with two and three machines. European Journal of Operational
Research 123 (2), 303-314.
3. Agnetis, A., Pacciarelli, D., 2000. Part sequencing in three-machine no-wait robotic cells. Operations Research Letters
27 (4), 185-192.
M

4. Ahani, G., Asyabani, M., 2014. A tabu search algorithm for no-wait job shop scheduling problem. International Journal
of Operational Research 19 (2), 246-258.
5. AitZai, A., Benmedjdoub, B., Boudhar, M., 2015. Branch-and-bound and PSO algorithms for no-wait job shop
scheduling. Journal of Intelligent Manufacturing, in Press.
ED

6. Akhshabi, M., Tavakkoli-Moghaddam, R., Rahnamay-Roodposhti, F., 2014. A hybrid particle swarm optimization
algorithm for a no-wait flow shop scheduling problem with the total flow time. International Journal of Advanced
Manufacturing Technology 70 (5-8), 1181-1188.
7. Akrout, H., Jarboui, B., Rebaï, A., Siarry, P., 2013. New Greedy Randomized Adaptive Search Procedure based on
PT

differential evolution algorithm for solving no-wait flowshop scheduling problem. International Conference on Advanced
Logistics and Transport, ICALT 2013, 6568480, 327-334.
8. Aldowaisan, T., 2001. A new heuristic and dominance relations for no-wait flowshops with setups. Computers and
CE

Operations Research 28 (6), 563-584.

9. Aldowaisan, T., Allahverdi, A., 2015. Total tardiness performance in m-machine no-wait flowshops with separate setup
times. Intelligent Control and Automation 6, 38-4.
10. Aldowaisan, T., Allahverdi, A., 2012a. Minimizing total tardiness in no-wait flowshops. Foundations of Computing and
AC

Decision Sciences 37 (3), 149-162.

11. Aldowaisan, T., Allahverdi, A., 2012b. No-wait flowshop scheduling problem to minimize the number of tardy jobs.
International Journal of Advanced Manufacturing Technology 61 (1-4), 311-323.
12. Aldowaisan, T., Allahverdi, A., 2004a. Three-machine no-wait flowshop with separate setup and removal times to
minimize total completion time. International Journal of Industrial Engineering: Theory Applications and Practice 11
(2), 113-123.
13. Aldowaisan, T., Allahverdi, A., 2004b. New heuristics for m-machine no-wait flowshop to minimize total completion
time. Omega 32 (5), 345-352.
14. Aldowaisan, T., Allahverdi, A., 2003. New heuristics for no-wait flowshops to minimize makespan. Computers and
Operations Research 30 (8), 1219-1231.

29
 ACCEPTED MANUSCRIPT

15. Aldowaisan, T., Allahverdi, A., 1998. Total flowtime in no-wait flowshops with separated setup times. Computers and
Operations Research 25 (9), 757-765.
16. Allahverdi, A., 2015. The third comprehensive survey on scheduling problems with setup times/costs. European Journal
of Operational Research 246, 345-378.
17. Allahverdi, A., Aldowaisan, T., 2004. No-wait flowshops with bicriteria of makespan and maximum lateness. European
Journal of Operational Research 152 (1), 132-147.
18. Allahverdi, A., Aldowaisan, T., 2002. No-wait flowshops with bicriteria of makespan and total completion time. Journal
of the Operational Research Society 53 (9), 1004-1015.
19. Allahverdi, A., Aldowaisan, T., 2001. Minimizing total completion time in a no-wait flowshop with sequence-dependent
additive changeover times. Journal of the Operational Research Society 52 (4), 449-462.
20. Allahverdi, A., Aldowaisan, T., 2000. No-wait and separate setup three-machine flowshop with total completion time
criterion. International Transactions in Operational Research 7, 245-264.

T
21. Allahverdi, A., Aydilek, H., 2014. Total completion time with makespan constraint in no-wait flowshops with setup
times. European Journal of Operational Research 238 (3), 724-734.

IP
22. Allahverdi, A., Aydilek, H., 2013. Algorithms for no-wait flowshops with total completion time subject to makespan.
Journal of Advanced Manufacturing Technology 68 (9-12), 2237-2251.
23. Allahverdi, A., Gupta, J.N.D., and Aldowaisan, T., 1999. A review of scheduling research involving setup considerations.

CR
OMEGA The International Journal of Management Sciences 27, 219-239.
24. Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y., 2008. A survey of scheduling problems with setup times or
costs. European Journal of Operational Research 187 (3), 985-1032.
25. Allahverdi, A., Soroush, H.M., 2008. The significance of reducing setup times/setup costs. European Journal of

26.

27.
Operational Research 187, 978-984.
US
Alvarez-Valdes, R., Fuertes, A., Tamarit, J.M., Giménez, G., Ramos, R., 2005. A heuristic to schedule flexible job-shop
in a glass factory. European Journal of Operational Research 165 (2), 525-534.
Arabameri, S., Salmasi, N., 2013. Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup
AN
times flowshop scheduling problem. Computers and Industrial Engineering 64 (4), 902-916.
28. Araújo, D.C., Nagano, M.S., 2011. A new effective heuristic method for the no-wait flowshop with sequence-dependent
setup times problem. International Journal of Industrial Engineering Computations 2 (1), 155-166.
29. Asefi, H., Jolai, F., Rabiee, M., Tayebi Araghi, M.E., 2014. A hybrid NSGA-II and VNS for solving a bi-objective no-
M

wait flexible flowshop scheduling problem. The International Journal of Advanced Manufacturing Technology 75 (5-8),
1017-1033.
30. Aydilek, H., Allahverdi, A., 2013. New heuristics for no-wait flowshops with performance measures of makespan and
ED

mean completion time. International Journal of Operations Research 10, 29-37.

31. Aydilek, H., Allahverdi, A., 2012. Heuristics for no-wait flowshops with makespan subject to mean completion time.
Applied Mathematics and Computation 219 (1), 351-359.
32. Azizi, V., Jabbari, M., Kheirkhah, A.S., 2016. M-machine, no-wait flowshop scheduling with sequence dependent setup
PT

times and truncated learning function to minimize the makespan. International Journal of Industrial Engineering
Computations 7 (2), 309-322.
33. Bagchi, T.P., Gupta, J.N.D., Sriskandarajah, C., 2006. A review of TSP based approaches for flowshop scheduling.
European Journal of Operational Research 169 (3), 816-854.
CE

34. Bagassi, S., Francia, D., Persiani, C.A., 2010. Terminal area "green" optimization using job-shop scheduling techniques.
27th Congress of the International Council of the Aeronautical Sciences 2010, ICAS 2010 6, 5135-5143.
35. Bansal, N., Mahdian, M., Sviridenko, M., 2005. Minimizing makespan in no-wait job shops. Mathematics of Operations
Research 30 (4), 817-831.
AC

36. Ben Chihaoui, F., Dridi, N., Hadj-Alouane, A.B., 2009. en. International Conference on Computers and Industrial
Engineering, CIE 2009 5223750, 170-175.
37. Ben Chihaoui, F., Kacem, I., Hadj-Alouane, A.B., Dridi, N., Rezg, N., 2011. No-wait scheduling of a two-machine flow-
shop to minimise the makespan under non-availability constraints and different release dates. International Journal of
Production Research 49 (21), 6273-6286.
38. Ben-Yehoshua, Y., Hariri, E., Mosheiov, G., 2015. A note on minimising total absolute deviation of job completion times
on a two-machine no-wait proportionate flowshop. International Journal of Production Research 53 (19), 5717-5724.
39. Bertolissi, E., 2000. Heuristic algorithm for scheduling in the no-wait flow-shop. Journal of Materials Processing
Technology 107 (1-3), 459-465
40. Bianco, L., Dell'olmo, P., Giordani, S., 1999. Flow shop no-wait scheduling with sequence dependent setup times and
release dates. INFOR 37 (1), 3-18.
30
 ACCEPTED MANUSCRIPT

41. Blömer, F., Günther, H.-O., 1998. Scheduling of a multi-product batch process in the chemical industry. Computers in
Industry 36 (3), 245-259.
42. Bouquarcd, J. L., Billaut, J.-C., Kubzin, M.A., Strusevich, V.A., 2005. Two-machine flow shop scheduling problems with
no-wait jobs. Operations Research Letters 33 (3), 255-262.
43. Bozejko, W., Makuchowski, M., 2011 Solving the no-wait job-shop problem by using genetic algorithm with automatic
adjustment. International Journal of Advanced Manufacturing Technology 57 (5-8), 735-752.
44. Bozejko, W., Makuchowski, M., 2009. A fast hybrid tabu search algorithm for the no-wait job shop problem. Computers
and Industrial Engineering 56 (4), 1502-1509.
45. Brown, S.I., McGarvey, R.G., Ventura, J.A., 2004. Total flowtime and makespan for a no-wait m-machine flowshop with
set-up times separated. Journal of the Operational Research Society 55 (6), 614-621
46. Bürgy, R., Gröflin, H., 2013. Optimal job insertion in the no-wait job shop. Journal of Combinatorial Optimization 26
(2), 345-371.

T
47. Chang, G. J., Xu, J.-Q., Zhang, J.-H., 2008. On-line no-wait job shop scheduling in supply chain. Proceedings of the
Chinese Control and Decision Conference, 176-180.

IP
48. Chang, J., An, F., Su, P., 2010. A quantum-PSO algorithm for no-wait flow shop scheduling problem. Chinese Control
and Decision Conference, CCDC 2010 5499096, 179-184.
49. Chang, J. L., Gong, D. W., Ma, X. P., 2007. A Heuristic Genetic Algorithm for No-Wait Flowshop Scheduling Problem.

CR
Journal of China University of Mining and Technology 17 (4), 582-586.
50. Chang, J. L., Shao, H.-H., 2006. Scheduling a three-machine no-wait flowshop with separated setup time. Journal of
Harbin Institute of Technology (New Series) 13 (2), 206-210.
51. Chang, J. L., Shao, H. H., 2005. Heuristic algorithm for two-machine no-wait flowshop scheduling problem. Computer

52.

53.
US
Integrated Manufacturing Systems, CIMS 11 (8), 1147-1153.
Chaudhry, I.A., Ahmed, R., Khan, A.M., 2014. Genetic Algorithm to minimize flowtime in a no-wait flowshop
scheduling problem. IOP Conference Series: Materials Science and Engineering 65 (1), 012007.
Chaudhry, I.A., Khan, A.M., 2012. Minimizing makespan for a no-wait flowshop using genetic algorithm. Sadhana -
AN
Academy Proceedings in Engineering Sciences 37 (6), 695-707.
54. Chauvet, F., Proth, J.-M., Wardi, Y., 2001. Scheduling no-wait production with time windows and flexible processing
times. IEEE Transactions on Robotics and Automation 17 (1), 60-69.
55. Che, A., Chabrol, M., Gourgand, M., Wang, Y., 2012. Scheduling multiple robots in a no-wait re-entrant robotic
M

flowshop. International Journal of Production Economics 135 (1), 199-208.

56. Che, A., Chu, C., 2009. Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots. European Journal
of Operational Research 199 (1), 77-88.
ED

57. Che, A., Chu, C., Levner, E., 2003. A polynomial algorithm for 2-degree cyclic robot scheduling. European Journal of
Operational Research 145 (1), 31-44.
58. Che, A., Hu, H., Chabrol, M., Gourgand, M., 2011. A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-
wait robotic cell. Computers and Operations Research 38 (9), 1275-1285.
PT

59. Che, A. D., Yan, P.-Y., Yang, N.-D., 2007. Polynomial algorithm for cyclic scheduling of a complex no-wait robotic
production system. Computer Integrated Manufacturing Systems, CIMS 13 (8), 1616-1623.
60. Chen, C.-L., Neppalli, R.V., Aljaber, N., 1996. Genetic algorithms applied to the continuous flow shop problem.
Computers and Industrial Engineering 30 (4), 919-929.
CE

61. Chen, K. J., Wang, X., 2013. Properties of two-machine no-wait flowshop scheduling problems. Control and Decision 28
(10), 1502-1506+1512.
62. Chen, S.-F., Qian, B., Hu, R., Li, Z.-C., 2014. An enhanced estimation of distribution algorithm for no-wait job shop
scheduling problem with makespan criterion. Lecture Notes in Computer Science 8589, 675-685.
AC

63. Cheng, T.C.E., Liu, Z., 2003a. Approximability of two-machine no-wait flowshop scheduling with availability
constraints. Operations Research Letters 31 (4), 319-322.
64. Cheng, T.C.E., Liu, Z., 2003b. 3/2-approximation for two-machine no-wait flowshop scheduling with availability
constraints. Information Processing Letters 88 (4), 161-165.
65. Cheng, T.C.E., Sriskandarajah, C., Wang, G., 2000. Two- and three-stage flowshop scheduling with no-wait in process.
Production and Operations Management 9 (4), 367-378.
66. Chu, C., 2006. A faster polynomial algorithm for 2-cyclic robotic scheduling. Journal of Scheduling 9 (5), 453-468.
67. Czogalla, J., Fink, A., 2012. Fitness landscape analysis for the no-wait flow-shop scheduling problem. Journal of
Heuristics 18 (1), 25-51.
68. Czogalla, J., Fink, A., 2009. Design and analysis of evolutionary algorithms for the no-wait flow-shop scheduling
problem. Lecture Notes in Economics and Mathematical Systems 624, 99-126.
31
 ACCEPTED MANUSCRIPT

69. Czogalla, J., Fink, A., 2008. On the effectiveness of particle swarm optimization and variable neighborhood descent for
the continuous flow-shop scheduling problem. Studies in Computational Intelligence 128, 61-89.
70. Daniella, C.A., Marcelo, S.N., 2011. A new effective heuristic method for the no-wait flowshop with sequence-dependent
setup times problem. International Journal of Industrial Engineering Computations 2, 155-166.
71. Daniella, C.A., Marcelo, S.N., 2010. A new effective heuristic method for the no-wait flowshop with sequence-dependent
setup times problem. Lecture Notes in Computer Science 6437, 187-196.
72. Davendra, D., Zelinka, I., Bialic-Davendra, M., Senkerik, R., Jasek, R., 2013. Discrete Self-Organising Migrating
Algorithm for flow-shop scheduling with no-wait makespan. Mathematical and Computer Modelling 57 (1-2), 100-110.
73. Deng, G., Wei, M., Su, Q., Zhao, M., 2015. An effective co-evolutionary quantum genetic algorithm for the no-wait flow
shop scheduling problem. Advances in Mechanical Engineering 7 (12), 15622900.
74. Dileepan, P., 2004. A note on minimizing maximum lateness in a two-machine no-wait flowshop. Computers and
Operations Research 31 (12), 2111-2115.

T
75. Ding, J.-Y., Song, S., Gupta, J.N.D., Zhang, R., Chiong, R., Wu, C., 2015a. An improved iterated greedy algorithm with a
Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing 30, 604-613.

IP
76. Ding, J.-Y., Song, S., Zhang, R., Gupta, J.N.D., Wu, C., 2015b. Accelerated methods for total tardiness minimization in
no-wait flowshops. International Journal of Production Research 53 (4), 1002-1018.
77. Ding, J.-Y., Song, S., Zhang, R., Wu, C., 2014. Minimizing makespan for a no-wait flowshop using tabu mechanism

CR
improved iterated greedy algorithm. Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
6900460, 1906-1911.
78. Engin, O., Günaydin, C., 2011. An adaptive learning approach for no-wait flowshop scheduling problems to minimize
makespan. International Journal of Computational Intelligence Systems 4 (4), 521-529.
79.

80.
US
Espinouse, M.-L., Formanowicz, P., Penz, B., 2001. Complexity results and approximation algorithms for the two
machine no-wait flow-shop with limited machine availability. Journal of the Operational Research Society 52 (1), 116-
121.
Espinouse, M.L., Formanowicz, P., Penz, B., 1999. Minimizing the makespan in the two-machine no-wait flow-shop with
AN
limited machine availability. Computers and Industrial Engineering 37 (1), 497-500.
81. Filho, G.R., Nagano, M.S., Lorena, L.A.N., 2007. Hybrid evolutionary algorithm for flowtime minimisation in no-wait
flowshop scheduling. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and
Lecture Notes in Bioinformatics) 4827 LNAI, 1099-1109.
M

82. Fink, A., Voß, S., 2003. Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of
Operational Research 151 (2), 400-414.
83. Fondrevelle, J., Allahverdi, A., Oulamara, A., 2005. Two-machine no-wait flowshop scheduling problem to minimize
ED

maximum lateness with separate set-up and removal times. International Journal of Agile Manufacturing 8 (2), 165-174.
84. Framinan, J.M., Nagano, M.S., 2008. Evaluating the performance for makespan minimisation in no-wait flowshop
sequencing. Journal of Materials Processing Technology 97 (1-3), 1-9.
85. Framinan, J.M., Nagano, M.S., Moccellin, J.V., 2010. An efficient heuristic for total flowtime minimisation in no-wait
PT

flowshops. International Journal of Advanced Manufacturing Technology 46 (9-12), 1049-1057.

86. Framinan, J.M., Schuster, C., 2006. An enhanced timetabling procedure for the no-wait job shop problem: A complete
local search approach. Computers and Operations Research 33 (5), 1200-1213
87. França, P.M., Tin Jr., G., 2006. Buriol, L.S., Genetic algorithms for the no-wait flowshop sequencing problem with time
CE

restrictions. International Journal of Production Research 44 (5), 939-957.

88. Gangadharan, R., Rajendran, C., 1993. Heuristic algorithms for scheduling in the no-wait flowshop. International Journal
of Production Economics 32 (3), 285-290.
89. Gao, K., Pan, Q., Suganthan, P.N., Li, J., 2013a. Effective heuristics for the no-wait flow shop scheduling problem with
AC

total flow time minimization. International Journal of Advanced Manufacturing Technology 66 (9-12), 1563-1572.
90. Gao, K., Suganthan, P.N., Chua, T.J., 2013b. An enhanced migrating birds optimization algorithm for no-wait flow shop
scheduling problem. Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Scheduling, CISched
2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013 6613246, 9-13.
91. Gao, K. Z., Pan, Q., Zuo, F., Duan, J., 2010. A harmony search algorithm for the no-wait flow shop optimization
scheduling. Proceedings of the 29th Chinese Control Conference, CCC'10 5573978, 1723-1726.
92. Gao, K. Z., Xie, S., Jiang, H., Li, J., 2011a. Discrete harmony search algorithm for the no wait flow shop scheduling
problem with makespan criterion. Lecture Notes in Computer Science 6838 LNCS, 592-599.
93. Gao, K. Z., Pan, Q.-K., Li, J.-Q., 2011b. Discrete harmony search algorithm for the no-wait flow shop scheduling
problem with total flow time criterion. International Journal of Advanced Manufacturing Technology 56 (5-8), 683-692.

32
 ACCEPTED MANUSCRIPT

94. Gao, K. Z., Pan, Q. K., Li, J.-Q., Wang, Y.-T., Liang, J., 2012. A hybrid harmony search algorithm for the no-wait flow-
shop scheduling problems. Asia-Pacific Journal of Operational Research 29 (2), 12500121.
95. Gerstl, E., Mor, B., Mosheiov, G., 2015. A note: Maximizing the weighted number of just-in-time jobs on a proportionate
flowshop. Information Processing Letters 115 (2), 159-162.
96. Ghaleb, M.A., Suryahatmaja, U.S., Alharkan, I.M., 2015. Metaheuristics for two-stage no-wait flexible flow shop
scheduling problem. IEOM 2015 - 5th International Conference on Industrial Engineering and Operations Management,
Proceeding 7093943.
97. Giaro, K., 2001. NP-hardness of compact scheduling in simplified open and flow shops. European Journal of Operational
Research 130 (1), 90-98.
98. Glass, C.A., Gupta, J.N.D., Potts, C.N., 1999. Two-machine no-wait flow shop scheduling with missing operations.
Mathematics of Operations Research 24 (4), 911-924.
99. Gonzalez, B., Torres, M., Moreno, J. A., 1995. Hybrid genetic algorithm approach for the `no-wait' flowshop scheduling

T
problem. IEE Conference Publication (414), 59-64.
100. Goyal, S.K., Sriskandarajah, C., 1988. No wait shop scheduling: Computational complexity and approximate algorithms.

IP
Opsearch 25, 220-244.
101. Grabowski, J., Pempera, J., 2005. Some local search algorithms for no-wait flow-shop problem with makespan criterion.
Computers and Operations Research 32 (8), 2197-2212.

CR
102. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., 1979. Optimization and approximation in deterministic
sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287-326.
103. Gröflin, H., Klinkert, A., 2007. Feasible insertions in job shop scheduling, short cycles and stable sets. European Journal
of Operational Research 177 (2), 763-785.
104.

105.
US
Guirchoun, S., Martineau, P., Billaut, J.-C., 2005. Total completion time minimization in a computer system with a server
and two parallel processors. Computers and Operations Research 32 (3), 599-611.
Gupta, J.N.D., Strusevich, V.A., Zwaneveld, C.M., 1997. Two-stage no-wait scheduling models with setup and removal
times separated. Computers and Operations Research 24 (11), 1025-1031.
AN
106. Hall, N.G., Sriskandarajah, C., 1996. A survey of machine scheduling problems with blocking and no-wait in process.
Operations Research 44 (3), 510-525.
107. Hecker, F.T., Hussein, W.B., Paquet-Durand, O., Hussein, M.A., Becker, T., 2013. A case study on using evolutionary
algorithms to optimize bakery production planning. Expert Systems with Applications 40 (17), 6837-6847.
M

108. Hecker, F.T., Stanke, M., Becker, T., Hitzmann, B., 2014. Application of a modified GA, ACO and a random search
procedure to solve the production scheduling of a case study bakery. Expert Systems with Applications 41 (13), 5882-
5891.
ED

109. Hong, Z.-Y., Pang, H.-L., 2009. Heuristic algorithm based on the crucial machine for the no-wait flow-shop scheduling.
Chinese Control and Decision Conference, CCDC 2009 5194981, 5121-5124.
110. Höhn, W., Jacobs, T., Megow, N., 2012. On Eulerian extensions and their application to no-wait flowshop scheduling.
Journal of Scheduling 15 (3), 295-309.
PT

111. Hsu, V.N., De Matta, R., Lee, C.-Y., 2003. Scheduling patients in an ambulatory surgical center. Naval Research
Logistics 50 (3), 218-238.
112. Hu, R., Meng, X., Qian, B., Li, K., 2012. A differential evolution approach for NTJ-NFSSP with SDSTs and RDs.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in
CE

Bioinformatics) 7390 LNAI, 288-299.

113. Huang, R.-H., Yang, C.-L., Huang, Y.-C., 2009. No-wait two-stage multiprocessor flow shop scheduling with unit setup.
International Journal of Advanced Manufacturing Technology 44 (9-10), 921-927.
114. Huang, R.-H., Yang, C.-L., Liu, S.-C., 2015. No-wait flexible flow shop scheduling with due windows. Mathematical
AC

Problems in Engineering 456719.

115. Jarboui, B., Eddaly, M., Siarry, P., 2011. A hybrid genetic algorithm for solving no-wait flowshop scheduling problems.
International Journal of Advanced Manufacturing Technology 54 (9-12), 1129-1143.
116. Javadi, B., Saidi-Mehrabad, M., Haji, A., (...), Jolai, F., Mahdavi-Amiri, N., 2008. No-wait flow shop scheduling using
fuzzy multi-objective linear programming. Journal of the Franklin Institute 345 (5), 452-467.
117. Jenabi, M., Naderi, B., Ghomi, S.M.T.F., 2010. A bi-objective case of no-wait flowshops. Proceedings 2010 IEEE 5th
International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010 5645110, 1048-1056.
118. Jolai, F., Asefi, H., Rabiee, M., Ramezani, P., 2013. Bi-objective simulated annealing approaches for no-wait two-stage
flexible flow shop scheduling problem. Scientia Iranica 20 (3), 861-872.

33
 ACCEPTED MANUSCRIPT

119. Jolai, F., Kor, H., Hatefi, S.M., Iranmanesh, H., 2009a. A genetic algorithm for Makespan minimization in a no-wait flow
shop problem with two batching machines. Proceedings- 2009 International Conference on Computer Engineering and
Technology, ICCET 2009 2, 4769596, 238-242.
120. Jolai, F., Sheikh, S., Rabbani, M., Karimi, B., 2009b. A genetic algorithm for solving no-wait flexible flow lines with due
window and job rejection. International Journal of Advanced Manufacturing Technology 42 (5-6), 523-532.
121. Jolai, F., Rabiee, M., Asefi, H., 2012. A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling
problem with sequence dependent setup times. International Journal of Production Research 50 (24), 7447-7466.
122. Kalczynski, P.J., Kamburowski, J., 2007. On no-wait and no-idle flow shops with makespan criterion. European Journal
of Operational Research 178 (3), 677-685.
123. Kats, V., Levner, E., 2009. A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case. Discrete
Applied Mathematics 157 (2), 339-355.
124. Kats, V., Levner, E., 1997. Minimizing the number of robots to meet a given cyclic schedule. Annals of Operations

T
Research 69, 209-226.
125. Khalili, M., 2014. A multi-objective electromagnetism algorithm for a bi-objective hybrid no-wait flowshop scheduling

IP
problem. International Journal of Advanced Manufacturing Technology 70 (9-12), 1591-1601.
126. Khalili, M., 2012. Multi-objective no-wait hybrid flowshop scheduling problem with transportation times. International
Journal of Computational Science and Engineering 7 (2), 147-154.

CR
127. Khalili, M., Naderi, B., 2015. A bi-objective imperialist competitive algorithm for no-wait flexible flow lines with
sequence dependent setup times. The International Journal of Advanced Manufacturing Technology 76 (1-4), 461-469.
128. Kim, K., Jeong, I. J., 2009. Document Flow shop scheduling with No-wait flexible lot streaming using an adaptive
genetic algorithm. International Journal of Advanced Manufacturing Technology 44 (11-12), 1181-1190.
129.

130.
Access Series in Informatics 12. US
Kim, J., Kröller, A., Mitchell, J.S.B., Sabhnani, G.R., 2009. Scheduling aircraft to reduce controller workload. Open

Koulamas, C., and Kyparisis, G.J., 2008. Single machine scheduling with past-sequence-dependent setup times. European
Journal of Operation Research 187, 1045-1049.
AN
131. Koulamas, C., Panwalkar, S.S., 2016. The proportionate two-machine no-wait job shop scheduling problem. European
Journal of Operational Research (in press).
132. Kravchenko, S.A., 1998. A polynomial algorithm for a two-machine no-wait job-shop scheduling problem. European
Journal of Operational Research 106 (1), 101-107
M

133. Kubzin, M.A., Strusevich, V.A., 2005. Two-machine flow shop no-wait scheduling with machine maintenance. 4OR 3
(4), 303-313.
134. Kubzin, M.A., Strusevich, V.A., 2004. Two-machine flow shop no-wait scheduling with a nonavailability interval. Naval
ED

Research Logistics 51 (4), 613-631.

135. Kumar, A., Prakash, A., Shankar, R., Tiwari, M.K., 2006. Psycho-Clonal algorithm based approach to solve continuous
flow shop scheduling problem. Expert Systems with Applications 31 (3), 504-514.
136. Laha, D., Chakraborty, U.K., 2009. A constructive heuristic for minimizing makespan in no-wait flow shop scheduling.
PT

International Journal of Advanced Manufacturing Technology 41 (1-2), 97-109.

137. Laha, D., Gupta, J.N.D., Sapkal, S.U., 2014. A penalty-shift-insertion-based algorithm to minimize total flow time in no-
wait flow shops. Journal of the Operational Research Society 65 (10), 1611-1624.
138. Laha, D., Sapkal, S.U., 2014. An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait
CE

flow shop. Computers and Industrial Engineering 67 (1), pp. 36-43.

139. Laha, D., Sapka, S.U., 2011. An efficient heuristic algorithm for m-machine no-wait flow shops. IMECS 2011 -
International MultiConference of Engineers and Computer Scientists 2011 1, 132-136.
140. Lee, T. E., Lee, H.-Y., Lee, S.-J., 2007. Scheduling a wet station for wafer cleaning with multiple job flows and multiple
AC

wafer-handling robots. International Journal of Production Research 45 (3), 487-507.

141. Lee, Y.H., Jung, J.W., 2005. New heuristics for no-wait flowshop scheduling with precedence constraints and sequence
dependent setup time. Lecture Notes in Computer Science 3483 (IV), 467-476.
142. Lennartz, P., 2003. The Relation between the no-wait Job Shop Problem and the Traveling Salesman Problem. Electronic
Notes in Discrete Mathematics 13, 61-63.
143. Leung, J.M.Y., Levner, E., 2006. An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times.
Operations Research Letters 34 (4), 465-472.
144. Li, M., Zhu, J., Li, X., 2012. A memory and variable neighborhood structure based complete local search for the no-wait
job shop problem. Proceedings of the 2012 IEEE 16th International Conference on Computer Supported Cooperative
Work in Design, 786-792.

34
 ACCEPTED MANUSCRIPT

145. Li, X., Wang, Q., Wu, C., 2008. Heuristic for no-wait flow shops with makespan minimization. International Journal of
Production Research 46 (9), 2519-2530.
146. Li, X., Wang, Q., Wu, C., 2006. An efficient method for no-wait flow shop scheduling to minimize makespan.
Proceedings of 10th International Conference on Computer Supported Cooperative Work in Design, 1296-1301.
147. Li, X., Wu, C., 2008. Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments.
Science in China, Series F: Information Sciences 51 (7), 896-909.
148. Li, X., Xu, H., Li, M., 2015. A memory-based complete local search method with variable neighborhood structures for
no-wait job shops. International Journal of Advanced Manufacturing Technology (in press).
149. Li, Y., Zhu, X., 2013. Insertion-segment based composite heuristic algorithm for no-wait flow shop scheduling problems.
Journal of Southeast University (Natural Science Edition) 43 (3), 483-488.
150. Liao, X. P., 2009. An orthogonal genetic algorithm with total flowtime minimization for the no-wait flow shop problem.
Proceedings of the 2009 International Conference on Machine Learning and Cybernetics 3, 5212254, 1706-1711.

T
151. Liao, X. P., Deng, J., Li, X.-P., 2008a. An evolutionary algorithm for constraint flow shops with multi-criteria
optimization. Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC 2,

IP
4620533, 904-908.
152. Liao, X.P., Liu, Y., Li, X., 2008b. Hybrid evolutionary algorithm for no-wait flow shops to minimize makespan and total
flowtime. Journal of Southeast University (English Edition) 24 (4), 450-454.

CR
153. Liaw, C. F., 2008. An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops.
Computers and Operations Research 35 (10), 3276-3283.
154. Liaw, C. Y., Cheng, C.-Y., Chen, M., 2005. Scheduling two-machine no-wait open shops to minimize makespan.
Computers and Operations Research 32 (4), 901-917.
155.

156.
US
Lin, B.M.T., Cheng, T.C.Edwin, 2001. Batch scheduling in the no-wait two-machine flowshop to minimize the
makespan. Computers and Operations Research 28 (7), 613-624.
Lin, H.-T., Lee, H.-T., Pan, W.-J., 2008. Heuristics for scheduling in a no-wait open shop with movable dedicated
machines. International Journal of Production Economics 111 (2), 368-377.
AN
157. Lin, S.-W., Ying, K.-C., 2016. Optimization of makespan for no-wait flowshop scheduling problems using efficient
matheuristics. Omega (United Kingdom) (in press).
158. Liu, B., Wang, L., Jin, Y.-H., 2007. An effective hybrid particle swarm optimization for no-wait flow shop scheduling.
International Journal of Advanced Manufacturing Technology 31 (9-10), 1001-1011.
M

159. Liu, B., Wang, L., Jin, Y.-H., Huang, D.-X., 2006. Hybrid particle swarm optimization for stochastic flow shop
scheduling with no-wait constraint. Summer Computer Simulation Conference 2006, SCSC'06, Part of the 2006 Summer
Simulation Multiconference, SummerSim'06 334-340.
ED

160. Liu, B., Wang, L., Qian, B., Jin, Y., 2008a. Hybrid particle swarm optimization for stochastic flow shop scheduling with
no-wait constraint. Proceedings of the 17th World Congress, The International Federation of Automatic Control, 158-55-
15860.
161. Liu, G., Song, S., Wu, C., 2013. Some heuristics for no-wait flowshops with total tardiness criterion. Computers and
PT

Operations Research 40 (2), 521-525.

162. Liu, J., Jiang, Y., 2005. An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem. Operations
Research 53 (2), 313-327.
163. Liu, S.Q., Kozan, E., 2011. Scheduling trains with priorities: A no-wait Blocking Parallel-Machine Job-Shop Scheduling
CE

model. Transportation Science 45 (2), 175-198.

164. Liu, Y., Feng, Z., 2014. Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent
processing times. Computers and Industrial Engineering 75 (1), 170-175.
165. Liu, Y. G., Zhu, X., Li, X.-P., 2008b. A new hybrid genetic algorithm for the Bi-criteria no-wait flowshop scheduling
AC

problem with makespan and total flow time minimization. Proceedings of the 7th International Conference on Machine
Learning and Cybernetics, ICMLC 2, 4620529, 883-888.
166. Liu, Z., Xie, J., Li, J., Dong, J., 2003. Heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine
in either stage. Tsinghua Science and Technology 8 (1), 43-48.
167. Macchiaroli, R., Molè, S., Riemma, S., 1999. Modelling and optimization of industrial manufacturing processes subject to
no-wait constraints. International Journal of Production Research 37 (11), 2585-2607.
168. Macchiaroli, Roberto, Mole, Salvatore, Riemma, Stefano, 1996. Fuzzy approach to optimize manufacturing processes
with no-wait constraints. IEEE Conference on Control Applications – Proceedings 474-479
169. Mannino, C., Mascis, A., 2009. Optimal real-time traffic control in metro stations. Operations Research 57 (4), 1026-
1039.

35
 ACCEPTED MANUSCRIPT

170. Mascis, A., Pacciarelli, D., 2002. Job-shop scheduling with blocking and no-wait constraints. European Journal of
Operational Research 143 (3), 498-517.
171. Maya, J., Muthuswamy, S., Vélez-Gallego, M.C., Rojas-Santiago, M., 2014. Minimising makespan in a no-wait flow
shop with two batch processing machines: A grasp algorithm. International Journal of Industrial and Systems
Engineering 17 (2), 152-169.
172. Meloni, C., Pacciarelli, D., Pranzo, M., 2004. A rollout metaheuristic for job shop scheduling problems. Annals of
Operations Research 131 (1-4), 215-235.
173. Mokhtari, H., 2014. A two-stage no-wait job shop scheduling problem by using a neuro-evolutionary variable
neighborhood search. International Journal of Advanced Manufacturing Technology 74 (9-12), 1595-1610.
174. Mokhtari, H., Abadi, I.N.K., Zegordi, S.H., 2011. Production capacity planning and scheduling in a no-wait environment
with controllable processing times: An integrated modeling approach. Expert Systems with Applications 38 (10), 12630-
12642.

T
175. Moradinasab, N., Shafaei, R., Rabiee, M., Ramezani, P., 2013. No-wait two stage hybrid flow shop scheduling with
genetic and adaptive imperialist competitive algorithms. Journal of Experimental and Theoretical Artificial Intelligence

IP
25 (2), 207-225.
176. Moradinasab, N., Shafaei, R., Rabiee, M., Mazinani, M., 2012. Minimization of maximum tardiness in a no-wait two
stage flexible flow shop. International Journal of Artificial Intelligence 8 (12 S), 166-181.

CR
177. Mucha, M., Sviridenko, M., 2013. No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in
Bioinformatics) 7965 LNCS (PART 1), 769-779.
178. Muthuswamy, S., Maya, J., Velez-Gallego, M.C., Rojas-Santiago, M., 2012a. GRASP algorithm to minimize makespan

179. US
in a no-wait flow shop with batch processing machines. 62nd IIE Annual Conference and Expo 2012 606-615.
Muthuswamy, S., Velez-Gallego, M.C., Maya, J., Rojas-Santiago, M., 2012b. Minimizing makespan in a two-machine
no-wait flow shop with batch processing machines. International Journal of Advanced Manufacturing Technology 63 (1-
4), 281-290.
AN
180. Muthuswamy, S., Velez-Gallego, M.C., Maya, J., 2011. Minimizing makespan in a no-wait flow shop with batch
processing machines. 61st Annual IIE Conference and Expo Proceedings.
181. Na, B., Ahmed, S., Nemhauser, G., Sokol, J., 2014. A cutting and scheduling problem in float glass manufacturing.
Journal of Scheduling 17 (1), 95-107.
M

182. Naderi, B., Khalili, M., Khamseh, A.A., 2014. Mathematical models and a hunting search algorithm for the no-wait
flowshop scheduling with parallel machines. International Journal of Production Research 52 (9), 2667-2681.
183. Naderi, B., Zandieh, M., 2014. Modeling and scheduling no-wait open shop problems. International Journal of
ED

Production Economics 158, 256-266.

184. Naderi-Beni, M., Tavakkoli-Moghaddam, R., Naderi, B., Ghobadian, E., Pourroust, A., 2012. A two-phase fuzzy
programming model for a complex bi-objective no-wait flow shop scheduling. International Journal of Industrial
Engineering Computations 3 (4), 617-626.
PT

185. Nagano, M.S., Araújo, D.C., 2014. New heuristics for the no-wait flowshop with sequence-dependent setup times
problem. Journal of the Brazilian Society of Mechanical Sciences and Engineering 36 (1), 139-151.
186. Nagano, M.S., Da Silva, A.A., Lorena, L.A.N., 2012. A new evolutionary clustering search for a no-wait flow shop
problem with set-up times. Engineering Applications of Artificial Intelligence 25 (6), 1114-1120.
CE

187. Nagano, M.S., Da Silva, A.A., Nogueira Lorena, L.A., 2014. An evolutionary clustering search for the no-wait flow shop
problem with sequence dependent setup times. Expert Systems with Applications 41 (8), 3628-3633.
188. Nagano, M.S., Miyata, H.H., Araújo, D.C., 2015. A constructive heuristic for total flowtime minimization in a no-wait
flowshop with sequence-dependent setup times. Journal of Manufacturing Systems 36, 224-230.
AC

189. Ng, C.T., Wang, J.-B., Cheng, T.C.E., Lam, S.S., 2011. Flowshop scheduling of deteriorating jobs on dominating
machines. Computers and Industrial Engineering 61 (3), 647-654.
190. Oulamara, A., 2007. Makespan minimization in a no-wait flow shop problem with two batching machines. Computers
and Operations Research 34 (4), 1033-1050.
191. Oulamara, A., Kovalyov, M.Y., Finke, G., 2005. Scheduling a no-wait flow shop containing unbounded batching
machines. IIE Transactions (Institute of Industrial Engineers) 37 (8), 685-696.
192. Pan, J.C.-H., Huang, H.-C., 2009. A hybrid genetic algorithm for no-wait job shop scheduling problems. Expert Systems
with Applications 36, 5800-5806.
193. Pan, Q.K., Tasgetiren, M.F., Liang, Y.C., 2005. A discrete particle swarm optimization algorithm for the no-wait
flowshop scheduling problem with makespan criterion. Proceedings of the 24th Annual Workshop of the UK Planning and
Scheduling Special Interest Group, London, UK, December 2005, 31–41.
36
 ACCEPTED MANUSCRIPT

194. Pan, Q. K., Tasgetiren, M.F., Liang, Y.-C., 2008a. A discrete particle swarm optimization algorithm for the no-wait
flowshop scheduling problem. Computers and Operations Research 35 (9), 2807-2839.
195. Pan, Q. K., Tasgetiren, M.F., Liang, Y.-C., Suganthan, P.N., 2008b. Upper bounds on taillard's benchmark suite for the
no-wait flowshop scheduling problem with makespan criterion. 2008 IEEE Congress on Evolutionary Computation, CEC
2008 4631196, 2955-2961.
196. Pan, Q. K., Wang, L., Qian, B., 2008c. A novel multi-objective particle swarm optimization algorithm for no-wait flow
shop scheduling problems. Journal of Engineering Manufacture 222 (4), 519-539.
197. Pan, Q. K., Wang, L., Tasgetiren, M.F., Zhao, B.-H., 2008d. A hybrid discrete particle swarm optimization algorithm for
the no-wait flow shop scheduling problem with makespan criterion. International Journal of Advanced Manufacturing
Technology 38 (3-4), 337-347.
198. Pan, Q. K., Wang, L., Zhao, B. H., 2008e. An improved iterated greedy algorithm for the no-wait flow shop scheduling
problem with makespan criterion. International Journal of Advanced Manufacturing Technology 38 (7-8), 778-786.

T
199. Pan, Q. K., Wang, L., Qian, B., 2009. A novel differential evolution algorithm for bi-criteria no-wait flow shop
scheduling problems. Computers and Operations Research 36 (8), 2498-2511.

IP
200. Pan, Q. K., Zhao, B. H., Qu, Y. G., Bi, Y.-H., 2007. Ant-colony heuristic algorithm for no-wait flow shop problem with
makespan criterion. Computer Integrated Manufacturing Systems 13 (9), 1801-1815.
201. Pan, Q., Zhu, J., 2006. Variable neighborhood search for no-wait flow shop scheduling. China Mechanical Engineering

CR
17 (16), 1741-1743.
202. Pan, Y. X., Pan, Q.-K., Li, J.-Q., 2011. Shuffled frog-leaping algorithm for multi-objective no-wait flowshop scheduling.
Control Theory and Applications 28 (10), 1363-1370.
203. Pang, K.-W., 2013. A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with

204.

205.
US
class setup times that minimizes maximum lateness. International Journal of Production Economics 141 (1), 127-136.
Panwalkar, S.S., Koulamas, C., 2014. The two-machine no-wait general and proportionate open shop makespan problem.
European Journal of Operational Research 238 (2), 471-475.
Qi, H.-Y., Qiu, Z.-Z., 2008. A hybrid algorithm based on Tabu search for no-wait flow shop. Chinese Control and
AN
Decision Conference, CCDC 2008 4597598, 1645-1648.
206. Qian, B., Du, P., Hu, R., Che, G., 2012. A differential evolution algorithm with two speed-up methods for NFSSP with
SDSTs and RDs. Proceedings of the World Congress on Intelligent Control and Automation (WCICA) 6357925, 490-495.
207. Qian, B., Wang, L., Hu, R., Huang, D.X., Wang, X., 2009a. A DE-based approach to no-wait flow-shop scheduling.
M

Computers and Industrial Engineering 57 (3), 787-805.

208. Qian, B., Wang, L., Huang, D. X., Jiang, Y.-H., Wang, X., 2009b. Rolling strategy and optimization algorithm for
dynamic no-wait flow shop scheduling problem. Control and Decision 24 (4), 481-487.
ED

209. Qian, B., Wang, L., Huang, D. X., Wang, X., 2009c. Multi-objective no-wait flow-shop scheduling with a memetic
algorithm based on differential evolution. Soft Computing 13 (8-9), 847-869.
210. Qian, B., Zhou, H.-B., Hu, R., Xiang, F.-H., 2011. Hybrid differential evolution optimization for no-wait flow-shop
scheduling with sequence-dependent setup times and release dates. Lecture Notes in Computer Science 6838, 600-611.
PT

211. Raaymakers, W.H.M., Hoogeveen, J.A., 2000. Scheduling multipurpose batch process industries with no-wait restrictions
by simulated annealing. European Journal of Operational Research 126 (1), 131-151.
212. Rabiee, M., Jolai, F., Asefi, H., Fattahi, P., Lim, S., 2016. A biogeography-based optimization algorithm for a realistic no-
wait hybrid flow shop with unrelated parallel machines to minimize mean tardiness. International Journal of Computer
CE

Integrated Manufacturing (in press).

213. Rabiee, M., Sadeghi Rad, R., Mazinani, M., Shafaei, R., 2014. An intelligent hybrid meta-heuristic for solving a case of
no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines. International Journal of
Advanced Manufacturing Technology 71 (5-8), 1229-1245.
AC

214. Rabiee, M., Zandieh, M., Jafarian, A., 2012. Scheduling of a no-wait two-machine flow shop with sequence-dependent
setup times and probable rework using robust meta-heuristics. International Journal of Production Research 50 (24),
7428-7446.
215. Rahimi-Vahed, A.R., Javadi, B., Rabbani, M., Tavakkoli-Moghaddam, R., 2008. A multi-objective scatter search for a bi-
criteria no-wait flow shop scheduling problem. Engineering Optimization 40 (4), 331-346.
216. Rajendran, C., 1994. No-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research
Society 45 (4), 472-478.
217. Ramezani, P., Rabiee, M., Jolai, F., 2015. No-wait flexible flowshop with uniform parallel machines and sequence-
dependent setup time: a hybrid meta-heuristic approach. Journal of Intelligent Manufacturing 26 (4), 731-744.
218. Ren, T., Zhang, C., Lin, L., Guo, M., Xie, X., 2014. Asymptotic analysis of SPTA-based algorithms for no-wait flow shop
scheduling problem with release dates. The Scientific World Journal 2014, 979238.
37
 ACCEPTED MANUSCRIPT

219. Riyanto, O.A.W., Santosa, B., 2015. ACO-LS algorithm for solving no-wait flow shop scheduling problem.
Communications in Computer and Information Science 516, 89-97.
220. Rojas-Santiago, M., Muthuswamy, S., Damodaran, P., Velez-Gallego, M.C., 2013. Minimizing makespan in a no-wait
flow shop using Ant Colony Optimization. IIE Annual Conference and Expo 2013 3024-3032.
221. Ruiz, R., Allahverdi, A., 2009. New heuristics for no-wait flow shops with a linear combination of makespan and
maximum lateness. International Journal of Production Research 47 (20), 5717-5738.
222. Ruiz, R., Allahverdi, A., 2007a. Some effective heuristics for no-wait flowshops with setup times to minimize total
completion time. Annals of Operations Research 156 (1), 143-171.
223. Ruiz, R., Allahverdi, A., 2007b. No-wait flowshop with separate setup times to minimize maximum lateness.
International Journal of Advanced Manufacturing Technology 35 (5-6), 551-565.
224. Samarghandi, H., 2015a. A particle swarm optimisation for the no-wait flow shop problem with due date constraints.
International Journal of Production Research 53 (9), 2853-2870.

T
225. Samarghandi, H., 2015b. Studying the effect of server side-constraints on the makespan of the no-wait flow-shop problem
with sequence-dependent set-up times. International Journal of Production Research 53(9), 2652-2673.

IP
226. Samarghandi, H. , 2015c. A no-wait flow shop system with sequence dependent setup times and server constraints. IFAC
Proceedings Volumes 48 (3), 1604-1609.
227. Samarghandi, H., Elmekkawy, T.Y., 2014. Solving the no-wait flow-shop problem with sequence-dependent set-up times.

CR
International Journal of Computer Integrated Manufacturing 27 (3), 213-228.
228. Samarghandi, H., Elmekkawy, T.Y., 2013. Two-machine, no-wait job shop problem with separable setup times and
single-server constraints. International Journal of Advanced Manufacturing Technology 65 (1-4), 295-308.
229. Samarghandi, H., Elmekkawy, T.Y., 2012a. A meta-heuristic approach for solving the no-wait flow-shop problem.

230. US
International Journal of Production Research 50 (24), 7313-7326.
Samarghandi, H., Elmekkawy, T.Y., 2012b. A genetic algorithm and particle swarm optimization for no-wait flow shop
problem with separable setup times and makespan criterion. International Journal of Advanced Manufacturing
Technology 61 (9-12), 1101-1114.
AN
231. Samarghandi, H., ElMekkawy, T.Y., 2011. An efficient hybrid algorithm for the two-machine no-wait flow shop
problem with separable setup times and single server. European Journal of Industrial Engineering 5 (2), 111-131.
232. Samarghandi, H., Elmekkawy, T.Y., 2013. Ibrahem, A.-M.M., 2013. Studying the effect of different combinations of
timetabling with sequencing algorithms to solve the no-wait job shop scheduling problem. International Journal of
M

Production Research 51 (16), 4942-4965.

233. Sapkal, S.U., Laha, D., 2013. A heuristic for no-wait flow shop scheduling. International Journal of Advanced
Manufacturing Technology 68 (5-8), 1327-1338.
ED

234. Sapkal, S.U., Laha, D., 2012. Application of VAM to manufacturing scheduling problems. Advanced Materials Research
488-489, 578-582.
235. Sapkal, S.U., Laha, D., 2011a. Comparison of initial solutions of heuristics for no-wait flow shop scheduling.
Communications in Computer and Information Science 250 CCIS, 294-298.
PT

236. Sapkal, S.U., Laha, D., 2011b. An improved scheduling heuristic algorithm for no-wait flow shops on total flow time
criterion. ICECT 2011 - 2011 3rd International Conference on Electronics Computer Technology 3, 5941822, 159-163.
237. Schuster, C.J., 2006. No-wait job shop scheduling: Tabu search and complexity of subproblems. Mathematical Methods
of Operations Research 63 (3), 473-491.
CE

238. Schuster, C.J., Framinan, J.M., 2003. Approximative procedures for no-wait job shop scheduling. Operations Research
Letters 31 (4), 308-318
239. Shabtay, D., Arviv, K., Stern, H., Edan, Y., 2014. A combined robot selection and scheduling problem for flow-shops
with no-wait restrictions. Omega (United Kingdom) 43, 96-107.
AC

240. Shabtay, D., Kaspi, M., Steiner, G., 2007. The no-wait two-machine flow shop scheduling problem with convex resource-
dependent processing times. IIE Transactions (Institute of Industrial Engineers) 39 (5), 539-557.
241. Shafaei, R., Rabiee, M., Mirzaeyan, M., 2011. An adaptive neuro fuzzy inference system for makespan estimation in
multiprocessor no-wait two stage flow shop. International Journal of Computer Integrated Manufacturing 24 (10), 888-
889.
242. Shyu, S.J., Lin, B.M.T., Yin, P.Y., 2004. Application of ant colony optimization for no-wait flowshop scheduling
problem to minimize the total completion time. Computers and Industrial Engineering 47 (2-3), 181-193.
243. Sidney, J.B., Potts, C.N., Sriskandarajah, C., 2000. Heuristic for scheduling two-machine no-wait flow shops with
anticipatory setups. Operations Research Letters 26 (4), 165-173.
244. Sidney, J.B., Sriskandarajah, C., 1999. A Heuristic for the Two-Machine No-Wait Openshop Scheduling Problem. Naval
Research Logistics 46 (2), 129-145.
38
 ACCEPTED MANUSCRIPT

245. Song, C.-L., Liu, X.-B., Wang, W., 2011. An iterative neighborhood search algorithm for large scale no-wait flow-shop.
Control and Decision 26 (4), 535-539.
246. Song, J., Tang, J., 2008. Scheduling model and discrete particle swarm optimization algorithm for roller annealing. Asia
Simulation Conference - 7th International Conference on System Simulation and Scientific Computing, ICSC 2008
4675465, 770-775.
247. Song, J., Tang, J., Luo, X., Liu, S., 2008. Scheduling model and heuristic algorithm for roller annealing. Chinese Control
and Decision Conference, CCDC 2008 4597473, 1052-1055.
248. Song, J. W., Tang, J.-F., 2010. No-wait hybrid flow shop scheduling method based on discrete particle swarm
optimization. Journal of System Simulation 22 (10), 2257-2261.
249. Soroush, H. M., 2015. Scheduling with job-dependent past-sequence-dependent setup times and job-dependent position-
based learning effects on a single processor. European Journal of Industrial Engineering 9 (3), 277-307.
250. Soroush, H. M., 2014. Stochastic bicriteria single machine scheduling with sequence-dependent job attributes and job-

T
dependent learning effects. European Journal of Industrial Engineering 8 (4), 421-456.
251. Spieksma, F.C.R., Woeginger, G.J., 2005. The no-wait flow-shop paradox. Operations Research Letters 33 (6), 603-608.

IP
252. Strusevich, V.A., 1995. Two machine flow shop scheduling problem with no wait in process: controllable machine
speeds. Discrete Applied Mathematics 59 (1), 75-86.
253. Su, L.-H., Lee, Y.-Y., 2008. The two-machine flowshop no-wait scheduling problem with a single server to minimize the

CR
total completion time. Computers and Operations Research 35 (9), 2952-2963.
254. Sun, L.-H., Sun, L.-Y., Wang, M.-Z., Wang, J.-B., 2012. Flow shop makespan minimization scheduling with deteriorating
jobs under dominating machines. International Journal of Production Economics 138 (1), 195-200.
255. Sun, Q.-Q., Dong, B., 2014. No-wait flow shop scheduling based on discrete harmony search algorithm. Applied

256.
Mechanics and Materials 513-517, 1523-1526.
US
Sun, Q.Q., Gao, K.Z., Li, H.Q., 2011. A heuristic for the no-wait flow shop scheduling optimization. CCIE 2011 -
Proceedings: 2011 IEEE 2nd International Conference on Computing, Control and Industrial Engineering 1, 6007990,
192-195.
AN
257. Sundar, S., Suganthan, P.N., Chua, T.J., 2013. A swarm intelligence approach to flexible job-shop scheduling problem
with no-wait constraint in remanufacturing. Lecture Notes in Computer Science (including subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics) 7895 LNAI (PART 2), 593-602.
258. Sundar, S., Suganthan, P.N., Jin, C.T., Xiang, C.T., Soon, C.C., 2015. A hybrid artificial bee colony algorithm for the
M

job-shop scheduling problem with no-wait constraint. Soft Computing (In press).
259. Sviridenko, M., 2003 Makespan minimization in no-wait flow shops: A polynomial time approximation scheme. SIAM
Journal on Discrete Mathematics 16 (2), 313-322.
ED

260. Sviridenko, M., Woeginger, G.J., 2000. Approximability and in-approximability results for no-wait shop scheduling.
Proceedings of Annual Symposium on Foundations of Computer Science, 116-125.
261. Tan, J., 2011. No-wait flow scheduling hybrid algorithm. International Conference on Computer Science and Service
System, CSSS 2011 – Proceedings 5974557, 520-523.
PT

262. Tang, J., Song, J., 2010. Discrete particle swarm optimisation combined with no-wait algorithm in stages for scheduling
mill roller annealing process. International Journal of Computer Integrated Manufacturing 23 (11), 979-991.
263. Tao, W., Rongqiu, C., 2006. Heuristic algorithm of scheduling model for cold coils annealing. Proceedings of the World
Congress on Intelligent Control and Automation (WCICA) 2, 1714496, 7263-7266.
CE

264. Tasgetiren, M.F., Pan, Q.-K., Suganthan, P.N., Liang, Y.-C., 2007. A discrete differential evolution algorithm for the no-
wait flowshop scheduling problem with total flowtime criterion. Proceedings of the 2007 IEEE Symposium on
Computational Intelligence in Scheduling, CI-Sched 2007 4218625, 251-258.
265. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A.R., Mirzaei, A.H., 2008. Solving a multi-objective no-wait flow shop
AC

scheduling problem with an immune algorithm. International Journal of Advanced Manufacturing Technology 36 (9-10),
969-981.
266. Tavakkoli-Moghaddam, R., Rahimi-Vahed, A., Mirzaei, A.H., 2007. A hybrid multi-objective immune algorithm for a
flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness.
Information Sciences 177 (22), 5072-5090.
267. Tseng, L.-Y., Lin, Y.-T., 2010. A hybrid genetic algorithm for no-wait flowshop scheduling problem. International
Journal of Production Economics 128 (1), 144-152.
268. T’Kindt, V., Billaut, J.C., 2002. Multicriteria Scheduling: Theory, Models and Algorithms. Springer.
269. Vermeulen, H., Hoogeveen, H., van den Akker, M., 2011. Solving the no-wait job shop problem: An ILP and CP
approach. Belgian/Netherlands Artificial Intelligence Conference, 1-8.

39
 ACCEPTED MANUSCRIPT

270. Wang, B., Han, X., Zhang, X., Zhang, S., 2015a. Predictive-reactive scheduling for single surgical suite subject to random
emergency surgery. Journal of Combinatorial Optimization 30 (4), 949-966.
271. Wang, S., Liu, M., Chu, C., 2015b. A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling.
International Journal of Production Research 53 (4), 1143-1167.
272. Wang, Y., Tang, J., Pan, Z., Yan, C., 2015c. Particle swarm optimization-based planning and scheduling for a laminar-
flow operating room with downstream resources. Soft Computing 19(10), 2913-2926.
273. Wang, C., 2014. Fast iterated local search algorithm with high order neighborhood for no-wait flowshop scheduling
problem. 26th Chinese Control and Decision Conference, CCDC 2014 6852966, 4460-4464.
274. Wang, C., Li, X., Wang, Q., 2010a. Tabu search for no-wait flowshop scheduling problem to minimize maximum
lateness. Journal of Southeast University (English Edition) 26 (1), 26-30.
275. Wang, C., Li, X., Wang, Q., 2010b. Accelerated tabu search for no-wait flowshop scheduling problem with maximum
lateness criterion. European Journal of Operational Research 206 (1), 64-72.

T
276. Wang, C., Li, X., Wang, Q., 2008. Iterative local search algorithm for no-wait flowshop scheduling problems to minimize
makespan. Proceedings of the 12th International Conference on Computer Supported Cooperative Work in Design, 908-

IP
912.
277. Wang, J. B., 2007. Flow shop scheduling problems with decreasing linear deterioration under dominant machines.
Computers and Operations Research 34 (7), 2043-2058.

CR
278. Wang, F., Rao, Y.-Q., Tang, Q.-H., 2013. A hybrid Intelligence algorithm for no-wait flow shop scheduling. Advanced
Materials Research 712-715, 2447-2451.
279. Wang, G., Cheng, T.C.E., 2001. Heuristics for two-machine no-wait flowshop scheduling with an availability constraint.
Information Processing Letters 80 (6), 305-309
280.

281.
US
Wang, J. B., Shan, F., Jiang, B., Wang, L.-Y., 2006a. Permutation flow shop scheduling with dominant machines to
minimize discounted total weighted completion time. Applied Mathematics and Computation 182 (1), 947-954.
Wang, T. Y., Yang, Y.-H., Lin, H.-J., 2006b. Comparison of scheduling efficiency in two/three-machine no-wait flow
shop problem using simulated annealing and genetic algorithm. Asia-Pacific Journal of Operational Research 23 (1), 41-
AN
59.
282. Wang, J. B., Xia, Z. Q., 2006a. Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34 (4),
327-336.
283. Wang, J. B., Xia, Z. Q., 2006b. Flow shop scheduling problems with deteriorating jobs under dominating machines.
M

Journal of the Operational Research Society 57 (2), 220-226.

284. Wang, J. B., Xia, Z. Q., 2005. No-wait or no-idle permutation flowshop scheduling with dominating machines. Journal
of Applied Mathematics and Computing 17 (1-2), 419-432.
ED

285. Wang, S., Liu, M., 2013. A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Computers and
Operations Research 40 (4), 1064-1075.
286. Wang, X., Cheng, T.C.E., 2006. A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and
class setups. Computers and Operations Research 33 (5), 1326-1344.
PT

287. Wang, X. R., Wu, T.-J., 2003. An Ant Colony Optimization Approach for No-Wait Flow-line Batch Scheduling with
Limited Batch Sizes. Proceedings of the IEEE Conference on Decision and Control 3, 2959-2964.
288. Wang, Z., Xing, W., Bai, F., 2005. No-wait flexible flowshop scheduling with no-idle machines. Operations Research
Letters 33 (6), 609-614.
CE

289. Woeginger, G.J., 2004. Inapproximability results for no-wait job shop scheduling. Operations Research Letters 32 (4),
320-325.
290. Wu, M. L., Zheng, J.-H., Liu, W.-P., Zou, J., 2011. Estimation of distribution algorithms for no-wait flow shop problem.
Proceedings - 2011 7th International Conference on Natural Computation, ICNC 2011 4, 6022405, 2054-2057.
AC

291. Wu, T., Chen, R., 2006. Heuristic algorithm of scheduling model for cold coils annealing. Journal of Huazhong
University of Science and Technology (Natural Science Edition) 34 (10), 58-60.
292. Xie, G., Li, J., 2012. Evolved discrete harmony search algorithm for multi-objective no-wait flow shop scheduling
problem. Proceedings of the 2012 International Conference on Computer Application and System Modeling, ICCASM
2012 0791-0794.
293. Xie, J., Xing, W., Liu, Z., Dong, J., 2004. Minimum deviation algorithm for two-stage no-wait flowshops with parallel
machines. Computers and Mathematics with Applications 47 (12), 1857-1863.
294. Xie, Z., Xin, Y., Yang, J., 2013. No-wait integrated scheduling algorithm based on reversed order signal-driven.
Computer Research and Development 50 (8), 1710-1721.

40
 ACCEPTED MANUSCRIPT

295. Xu, T., Zhu, X., Li, X., 2012. Efficient iterated greedy algorithm to minimize makespan for the no-wait flowshop with
sequence dependent setup times. Proceedings of the IEEE 16th International Conference on Computer Supported
Cooperative Work in Design, 780-785.
296. Yang, N., Li, X.-P., Zhu, J., Wang, Q., 2008. Hybrid Genetic-VNS algorithm with total flowtime minimization for the no-
wait flowshop problem. Proceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC
2, 4620539, 935-940.
297. Yang, L., Pan, Y., 2012. Discrete particle swarm optimization algorithm for lot-streaming no-wait flow shop scheduling
problem. Advanced Materials Research 538-541, 863-868.
298. Ying, K.-C., Lee, Z.-J., Lu, C.-C., Lin, S.-W., 2012. Metaheuristics for scheduling a no-wait flowshop manufacturing cell
with sequence-dependent family setups. International Journal of Advanced Manufacturing Technology 58 (5-8), 671-682.
299. Yuan, H., Jing, Y., Huang, J., Ren, T., 2013. Optimal research and numerical simulation for scheduling no-wait flow shop
in steel production. Journal of Applied Mathematics 2013, 498282.

T
300. Zhang, Q.-L., Chen, Y.-S., 2014. Hybrid PSO-NEH algorithm for solving no-wait flexible flow shop scheduling problem.
System Engineering Theory and Practice 34 (3), 802-809.

IP
301. Zhao, C., Tang, H., 2011. A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine
availability constraints. Optimization Letters 5 (1), 183-190.
302. Zhao, X., Tang, J., 2010. No-wait flow shop scheduling based on artificial immune system. Proceedings - 2nd IEEE

CR
International Conference on Advanced Computer Control, ICACC 2010 3, 5486821, 436-440
303. Zheng, T., Yamashiro, M., 2010. Solving no-wait flow shop scheduling problems by a hybrid quantum-inspired
evolutionary algorithm. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics) 6438 LNAI (PART 2), 315-324.
304.

305.
US
Zhou, Y., Gu, X., 2009. Research on no-wait flow shop scheduling problem with fuzzy due date based on evolution
games. Proceedings - 2009 2nd IEEE International Conference on Computer Science and Information Technology,
ICCSIT 2009 5234651, 495-499.
Zhu, X., Li, X., Gupta, J.N.D., 2013a. Iterative algorithms for no-wait flowshop problems with sequence-dependent setup
AN
times. 25th Chinese Control and Decision Conference, CCDC 2013 6561117, 1252-1257.
306. Zhu, X., Li, X., Wang, Q., 2013b. An adaptive intelligent method for manufacturing process optimization in steelworks.
Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design,
CSCWD 2013 6580989, 363-368.
M

307. Zhu, J., Li, X., 2012. An effective meta-heuristic for no-wait job shops to minimize makespan. IEEE Transactions on
Automation Science and Engineering 9 (1), 5976419, 189-198.
308. Zhu, X., Li, X., 2015. An enhanced greedy random adaptive search procedure with path-relinking for no-wait flowshop
ED

problem with setup times. Integrated Computer-Aided Engineering 23 (1), 51-68.

309. Zhu, J., Li, X., Wang, Q., 2009a. Complete local search with limited memory algorithm for no-wait job shops to minimize
makespan. European Journal of Operational Research 198 (2), 378-386.
310. Zhu, X., Li, X. P., Wang, Q., 2009b. Objective increment based iterative greedy heuristic for no-wait flowshops with total
PT

flowtime minimization. Chinese Journal of Computers 32 (1), 132-141.

311. Zhu, X., Li, X., Wang, Q., 2007. Hybrid heuristic for total flowtime minimization in no-wait flow shops. Proceedings of
the 2007 11th International Conference on Computer Supported Cooperative Work in Design, CSCWD 4281584, 1050-
1054.
CE

312. Zhu, X., Li, X., Wang, Q., 2011a. An evolutionary algorithm for no-wait flowshop problems with flowtime minimization.
Proceedings of the 2011 15th International Conference on Computer Supported Cooperative Work in Design, CSCWD
2011 5960087, 285-290.
313. Zhu, X., Li, X., Wang, Q., 2011b. Total-idle-time increment based hybrid GA for no-wait flowshops with makespan
AC

minimization. Computer Research and Development 48 (3), 455-463.

314. Zhu, X., Li, X., Wang, Q., 2008a. Objective increment based hybrid GA for no-wait flowshops. Proceedings of the 7th
International Conference on Machine Learning and Cybernetics, ICMLC 2, 4620545, 969-975.
315. Zhu, X., Li, X., Wang, Q., 2008b. Hybrid heuristic for m-machine no-wait flowshops to minimize total completion time.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in
Bioinformatics) 5236 LNCS, 192-203.
316. Zhuang, W.J., Xu, T., Sun, M.Y., 2014. A hybrid iterated greedy algorithm for no-wait flowshop with sequence
dependent setup times to minimize makespan. Advanced Materials Research 933, 459-466.

41