doi: 10.4304/jsw.6.6.1146-1153
A heuristic serial schedule algorithm for unrelated parallel machine scheduling with precedence constraints
2Tourism College of Zhejiang, Hangzhou, China
Abstract—The paper presents a priority rule-based heuristic serial schedule (SS) algorithm for a deterministic scheduling problem where multiple jobs with arbitrary precedence constraints are processed on multiple unrelated parallel machines. The objective is to minimise makespan. The priority rule employs the arithmetic mean and deviation of the processing times to determine the prior job-machine pair. Moreover, at each iteration, the algorithm can schedule the prior job on the prior machine as early as possible to prevent certain machines from standing idle by the greatest extent. The proposed algorithm is demonstrated in detail through a test instance. Computational experiments are conducted to show that the new polynomial-time algorithm is effective in reducing makespan and efficient in shortening runtime.
Index Terms—unrelated machines, scheduling, precedence constraints, makespan, priority rule, heuristics
Cite: Chunfeng Liu, Shanlin Yang, "A heuristic serial schedule algorithm for unrelated parallel machine scheduling with precedence constraints," Journal of Software vol. 6, no. 6, pp. 1146-1153, 2011.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Mar 01, 2024 News!
Vol 19, No 1 has been published with online version [Click]