CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

Solving A Two-Agent Single-Machine Scheduling Problem by A Novel Metaheuristic

عنوان مقاله: Solving A Two-Agent Single-Machine Scheduling Problem by A Novel Metaheuristic
شناسه ملی مقاله: EIAICC02_019
منتشر شده در دومین کنفرانس ملی توسعه کاربردهای صنعتی اطلاعات، ارتباطات و محاسبات در سال 1392
مشخصات نویسندگان مقاله:

Maziyar Yazdani - Department of Industrial Engineering, Faculty of Engineering, University of Tehran
Fariborz Jolai - Department of Industrial Engineering, Faculty of Engineering, University of Tehran
Poria Pourzakaria - Department of Industrial Engineering, Faculty of Engineering, University of Mehrastan

خلاصه مقاله:
The multiple-agent scheduling problems have received increasing attention recently. But most papers in the multi agent environment ignore maintenance activity. For thisreason, this paper deliberates a two-agent single-machine scheduling problem with periodic maintenance activity. Inscheduling problems with two competing agents, each one ofthe agents has his own set of jobs and his own objective function, but both share the same processor. We developdiscrete version of cuckoo optimization algorithm (COA) for the problem. The results of computational experiments show the good performance of the proposed algorithm.

کلمات کلیدی:
Scheduling, Two agents, Single machine,cuckoo optimization algorithm, maintenance activity

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/241340/