Unrelated parallel machine scheduling with setup consideration and a totalweighted completion time objective

Citation
Mx. Weng et al., Unrelated parallel machine scheduling with setup consideration and a totalweighted completion time objective, INT J PRO E, 70(3), 2001, pp. 215-226
Citations number
19
Categorie Soggetti
Engineering Management /General
Journal title
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
ISSN journal
09255273 → ACNP
Volume
70
Issue
3
Year of publication
2001
Pages
215 - 226
Database
ISI
SICI code
0925-5273(20010418)70:3<215:UPMSWS>2.0.ZU;2-L
Abstract
This paper addresses the problem of scheduling a set of independent jobs on unrelated parallel machines with job sequence dependent setup times so as to minimize a weighted mean completion time. The study of the problem stemm ed from a real service industry problem. This problem is at least NP-hard i n the ordinary sense, even when there are only two identical machines with no setups. Seven heuristic algorithms are proposed and tested by simulation . The results and analysis of quite extensive computational experiments are reported and discussed. The findings through the computational results are presented. Whether this problem is strongly NP-hard is left as an open que stion. (C) 2001 Elsevier Science B.V. All rights reserved.