CIVILICA We Respect the Science
Publisher of Iranian Journals and Conference Proceedings
Paper
title

An imperialist competetive algorithm for multi agent scheduling problem under periodic maintenance

Credit to Download: 1 | Page Numbers 8 | Abstract Views: 799
Year: 2013
Present: شفاهي
COI code: NIESC02_130
Paper Language: English

How to Download This Paper

For Downloading the Fulltext of CIVILICA papers please visit the orginal Persian Section of website.

Authors An imperialist competetive algorithm for multi agent scheduling problem under periodic maintenance

  Maziyar Yazdani - Department of Industrial Engineering, College of Engineering, University of Tehran, Iran
  Fariborz Jolai - Department of Industrial Engineering, College of Engineering, University of Tehran, Iran
  Seyed Mohammad Khalili - Department of Industrial Engineering, College of Engineering, University of Tehran, Iran
  Morteza Shiripour - Department of Industrial Engineering, College of Engineering, University of Tehran, Iran

Abstract:

Scheduling with availability constraint and maintenance activity has been widely studied. However,multi-agent scheduling with simultaneous considerations of availability constraint and maintenanceactivity has hardly been considered until now. In view of this, this research focuses on the problem ofscheduling jobs that come from two agent on a single machine that requires periodic maintenance with the objective of minimizing the total completion time of the jobs of the first agent while keeping the maximum tardiness of other agent below or at a fixed level UB. We present some new dominanceproperties for this strongly NP-hard problem. Next, using these properties, we develop a novel imperialist competitive algorithm for the problem. For the evaluation of the proposed ICA, problem data was generated to compare it against a genetic algorithm. The results of computational experiments show the good performance of the proposed algorithm.

Keywords:

Scheduling; Two agents; Single machine; availability constraint; imperialist competitive algorithm

Perma Link

https://www.civilica.com/Paper-NIESC02-NIESC02_130.html
COI code: NIESC02_130

how to cite to this paper:

If you want to refer to this article in your research, you can easily use the following in the resources and references section:
Yazdani, Maziyar; Fariborz Jolai; Seyed Mohammad Khalili & Morteza Shiripour, 2013, An imperialist competetive algorithm for multi agent scheduling problem under periodic maintenance, 02nd National Conference on Indurtrial Engineering & Systems, نجف آباد, دانشگاه آزاد اسلامي واحد نجف آباد, گروه مهندسي صنايع, https://www.civilica.com/Paper-NIESC02-NIESC02_130.htmlInside the text, wherever referred to or an achievement of this article is mentioned, after mentioning the article, inside the parental, the following specifications are written.
First Time: (Yazdani, Maziyar; Fariborz Jolai; Seyed Mohammad Khalili & Morteza Shiripour, 2013)
Second and more: (Yazdani; Jolai; Khalili & Shiripour, 2013)
For a complete overview of how to citation please review the following CIVILICA Guide (Citation)

Scientometrics

The University/Research Center Information:
Type: state university
Paper No.: 55403
in University Ranking and Scientometrics the Iranian universities and research centers are evaluated based on scientific papers.

Research Info Management

Export Citation info of this paper to research management softwares

New Related Papers

Iran Scientific Advertisment Netword

Share this paper

WHAT IS COI?

COI is a national code dedicated to all Iranian Conference and Journal Papers. the COI of each paper can be verified online.