Minimizing the Sum of Maximum Earliness and Tardiness on a Single Machine with multiple Unavailability Period
Publish Year: 1392
نوع سند: مقاله کنفرانسی
زبان: English
View: 810
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICMM01_0857
تاریخ نمایه سازی: 9 تیر 1393
Abstract:
This paper considers a single machine scheduling problem with multiple Unavailability Period that minimizes the sum of maximum earliness and tardiness. We prove problem is NP-hard in the strong sense. To solve this strongly NP-hard problem we use cuckoo optimization algorithm which rarely applied in scheduling problem. For the evaluation of the proposed COA, problem data was generated to compare it against a PSO. The results of computational experiments show the good performance of the proposed algorithm.
Keywords:
Scheduling , single machine , availability constraint , cuckoo optimization algorithm (COA) , sum of maximum earliness and tardiness
Authors
Maziyar Yazdani
University of TehranTehran, Iran
Fariborz Jolai
University of TehranTehran, Iran