An agent-based intelligent algorithm for uniform machine scheduling to minimize total completion time

K. Li, J. Y.T. Leung, B. Y. Cheng

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

This paper considers the uniform machine scheduling problem with release dates so as to minimize the total completion time. The problem is known to be NP-hard in the strong sense, even when there is only a single machine. An intelligent scheduling algorithm, called ABISA, is proposed, in which agent technology is introduced to realize the robotization process of manufacturing scheduling by means of the intelligence of the machines. Semantic description of two kinds of agent is given, and token-ring mechanism is presented for agent coordination. A lower bound is derived which is used to evaluate the performance of the algorithms. By examining 1800 random problem instances, the algorithm shows an excellent performance in the solution quality. The results obtained by ABISA are better than the algorithms based on traditional heuristic rules, and are closer to the lower bound of the problem.

Original languageEnglish (US)
Pages (from-to)277-284
Number of pages8
JournalApplied Soft Computing Journal
Volume25
DOIs
StatePublished - Dec 2014

All Science Journal Classification (ASJC) codes

  • Software

Keywords

  • Heuristics
  • Intelligent scheduling
  • NP-hard
  • Release dates
  • Total completion time
  • Uniform machines

Fingerprint

Dive into the research topics of 'An agent-based intelligent algorithm for uniform machine scheduling to minimize total completion time'. Together they form a unique fingerprint.

Cite this