Solvable cases of permutation flowshop scheduling with dominating machines

Authors
Xiang, S Tang, G Cheng, TCE
Citation
S. Xiang et al., Solvable cases of permutation flowshop scheduling with dominating machines, INT J PRO E, 66(1), 2000, pp. 53-57
Citations number
9
Categorie Soggetti
Engineering Management /General
Journal title
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
ISSN journal
09255273 → ACNP
Volume
66
Issue
1
Year of publication
2000
Pages
53 - 57
Database
ISI
SICI code
0925-5273(20000605)66:1<53:SCOPFS>2.0.ZU;2-P
Abstract
In this paper we study the permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is t o minimize one of the five regular performance criteria, namely, total weig hted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by prese nting a polymonial-time solution algorithm for each case. (C) 2000 Elsevier Science B.V. All rights reserved.