Professional Documents
Culture Documents
Abstract
In this paper we study the permutation #owshop scheduling problem with an increasing and decreasing series of
dominating machines. The objective is to minimize one of the "ve regular performance criteria, namely, total weighted
completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these
"ve cases are solvable by presenting a polymonial-time solution algorithm for each case. 2000 Elsevier Science B.V.
All rights reserved.
Keywords: Scheduling; Permutation #owshop; Dominating machines
1. Introduction
It is common to observe that in many manufacturing plants, the production facilities are arranged
in series through which the jobs are processed.
Often, the jobs have to be processed by each of the
serial facilities in the same order. Such a production
plant con"guration is referred to as a #owshop. If
there are technological or other constraints that
demand the jobs to go through the facilities in the
same order, the environment is called a permutation #owshop.
A permutation #owshop scheduling problem can
be stated as follows. There are n jobs J , J ,2, J
L
to be processed successively on m machines
* Corresponding author. Tel.: 852-2766-5215; fax: 852-23562682.
E-mail address: mscheng@polyu.edu.hk (T.C.E. Cheng)
0925-5273/00/$ - see front matter 2000 Elsevier Science B.V. All rights reserved.
PII: S 0 9 2 5 - 5 2 7 3 ( 9 9 ) 0 0 1 0 6 - 1
54
(1)
where
C " F\p
, the sum of processing times of
QH
G GQ
job J
on the "rst (h!1) machines,
Q
C " H p
, the sum of processing times of
QH
I FQI
the "rst j jobs on machine M ,
F
and
C " K
p , the sum of processing times of
QH
GF> GQH
job J on the last (m!h) machines.
QH
2. Problem F"idm}ddm" wj Cj
From (1), we have
L
c(s)" w C
QH QH
H
L
F\
L
H
" w p
# w p
#l ,
QH
GQ
QH
FQI
H
G
H
I
where the "rst item is only dependent on job J ,
Q
the second term is the weighted completion time of
all the jobs on machine M and is minimized by the
F
weighted shortest processing time (WSPT) ordering, and the last term l " L w K
p
H QH GF> GQH
" L w K
p is independent of permutaH H GF> GH
tion. Therefore, an optimal permutation can be
constructed as follows.
Algorithm 1.
Step 1: Construct a WSPT ordering s"(s(1),
s(2),2, s(n)) of processing times p , j"1,2, n, of
FH
all the jobs on machine M . That is,
F
p
/w )p
/w )2)p
/w .
FQ Q
FQ Q
FQL QL
Step 2: Let s be the s(j) forward-shift permutation
H
of s, i.e.
s "(s(j), s(1),2, s(j!1), s(j#1),2, s(n)).
H
Calculate its objective function value c(s ).
H
Step 3: Let c(s H )"min+c(s )" j"1,2, n,. An optiH
H
mal solution is
s H "(s(jH), s(1),2, s(jH!1), s(jH#1),2, s(n)),
H
i.e. the s H forward-shift permutation of s.
H
Theorem 1. For the problem F"idm}ddm" w C ,
H H
Algorithm 1 generates an optimal solution.
Proof. For any feasible solution s"(s(1),
s(2),2, s(n)), let s(1)"s(k), where s(k) is the kth
element of s"(s(1), s(2),2, s(n)) obtained in Step
1 of Algorithm 1. From the Observation and using
the method of adjacent pairwise interchange [8],
we know c(s)*c(s )*c(s H ).
I
H
Algorithm 1 requires O(n) time to obtain an
optimal solution since the computational complexity of WSPT is O(n log n) and the computation of
c(s H ) needs O(n) time.
H
3. Problems F"idm}ddm"Lmax and F"idm}ddm"Tmax
Note that c(s)" or
in this case. For the
problem F"idm}ddm" , Ho and Gupta [4] pre
sented an optimal solution algorithm. Algorithm
2 below solves the problem more simply.
Algorithm 2.
Step 1: Construct an earliest due date (EDD) ordering s"(s(1), s(2),2, s(n)) of due dates d , j"
H
1,2, n, of all the jobs. That is, d )d
Q
Q
)2)d .
QL
55
56
4. Problem F"idm}ddm" Uj
Note that c(s)" L ; in this case. Using
H H
Moore's algorithm [9] n times in Algorithm 3 to
calculate objective function values, Algorithm 4 below generates an optimal solution for the problem
F"idm}ddm" ; .
H
Algorithm 4.
Step 1: Let d "d ! K
p for j"1,2, n.
H
H
IF> IH
Construct an EDD ordering s"(s(1), s(2),2, s(n))
of due dates d , j"1,2, n, of all the jobs. That is,
H
d )d )2)d .
Q
Q
QL
Step 2: Let s be the s(j) forward-shift permutation
H
of s, i.e.
s "(s(j), s(1),2, s(j!1), s(j#1),2, s(n)).
H
Calculate its objective function value c(s ) resulting
H
from "xing job J in the "rst position and using
QH
Moore's algorithm to calculate the minimum number of tardy jobs for the remaining (n!1) jobs,
together with job J if it is tardy.
QH
Step 3: Let c(s H )"min+c(s )" j"1,2, n,. An optiH
H
mal solution is
s H "(s(jH), s(1),2, s(jH!1), s(jH#1),2, s(n)),
H
i.e. the s(jH) forward-shift permutation of s.
Theorem 4. For the problem F"idm}ddm" ; ,
H
Algorithm 4 generates an optimal solution.
5. Problem F"idm}ddm"Cmax
By (1), we know that
c(s)"C "C
QL
F\
L
K
" p
# p
# p
.
(2)
GQ
FQI
GQL
G
I
GF>
Since the second term is independent of permutation, C
is minimized by placing in the "rst posi
tion the job which minimizes the "rst term and
placing in the last position the job which minimizes
the third term. Algorithm 5 below generates an
optimal solution for the problem F"idm}ddm"C .
Algorithm 5.
Step 1: Let job J and job J satisfy the following
T
R
Eqs. (3) and (4), respectively:
F\
F\
p "min p " j"1,2, n ,
(3)
GT
GH
G
G
K
K
p "min p " j"1,2, n ,
(4)
GR
GH
GF>
GF>
Step 2: If job J and job J are di!erent, go to Step 3;
T
R
otherwise, job J and job J are the same job, i.e.
T
R
v"t, which is unique in satisfying Eqs. (3) and (4).
Let job J and job J satisfy the following equaTY
RY
tions, respectively:
F\
F\
p "min p " jOv and1)j)n ,
GTY
GH
G
G
K
K
p "min p " jOt and 1)j)n .
GRY
GH
GF>
GF>
If F\p # K
p ) F\p # K
p ,
G GTY
GF> GR
G GT
GF> GRY
set v"v and go to Step 3; otherwise, set t"t and
go to Step 3.
Step 3: An optimal solution is one in which jobs
J and J are placed in the "rst and last
T
R
57
References