• an imperialist competetive algorithm for multi agent scheduling problem under periodic maintenance

    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 844
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     scheduling with availability constraint and maintenance activity has been widely studied. however, multi-agent scheduling with simultaneous considerations of availability constraint and maintenance activity has hardly been considered until now. in view of this, this research focuses on the problem of scheduling 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 dominance properties 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.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم