A mathematical model for unrelated parallel-machine scheduling with two competing agents and a fixed non-availability interval
محل انتشار: سیزدهمین کنفرانس بین المللی مهندسی صنایع
سال انتشار: 1395
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 477
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC13_058
تاریخ نمایه سازی: 14 شهریور 1396
چکیده مقاله:
Competitive multi-agent scheduling has attracted growing attention recently. In this paper, two-agent scheduling problem on unrelated parallel-machine involving setup and release date considerations is studied. We also consider a fixed non-availability interval for this scheduling problem so that no machine can process jobs in a specified non-availability interval. Each agent has its own set of jobs and objective function, but both share the same processor. A mixed integer programming model is proposed and its goal is to minimize the maximum completion time of jobs from the first agent subject to a constraint that the other agent’s maximum completion time cannot exceed a prescribed upper bound. Finally, numerical studies are performed using GAMS to examine the effectiveness and the efficiency of the proposed model. Also, an upper bound is developed to increase the efficiency of the model.
کلیدواژه ها:
نویسندگان
Fardin Ahmadizar
Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
Nima Shafiei
Department of Industrial Engineering, University of Kurdistan, Sanandaj, Iran
Shakoor Barzanjeh
Department of Industrial Engineering,University of Kurdistan, Sanandaj, Iran