FLOWSHOP SCHEDULING WITH DOMINANT MACHINES

Authors
HO JC GUPTA JND
Citation
Jc. Ho et Jnd. Gupta, FLOWSHOP SCHEDULING WITH DOMINANT MACHINES, Computers & operations research, 22(2), 1995, pp. 237-246
Citations number
19
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
22
Issue
2
Year of publication
1995
Pages
237 - 246
Database
ISI
SICI code
0305-0548(1995)22:2<237:FSWDM>2.0.ZU;2-7
Abstract
This paper examines two special cases of the n-job, m-machine permutat ion scheduling flowshop problem. The first case assumes an increasing series of dominating machines; while the second case assumes a decreas ing series of dominating machines. Efficient solution procedures for f inding the optimal permutation schedules for various performance measu res, including maximum flowtime, mean flowtime, mean completion time o f machines, the number of tardy jobs, maximum lateness, and maximum ta rdiness, are developed.