کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7541920 | 1489067 | 2016 | 34 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An automated negotiation approach to solve single machine scheduling problems with interfering job sets
ترجمه فارسی عنوان
یک رویکرد مذاکره خودکار برای حل مسائل مربوط به برنامه ریزی تک ماشین ها با مجموعه های کاری دخالت
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
مذاکره اتوماتیک، برنامه زمانبندی واحد مجموعه کارهای تعارض کننده، معیارهای چندگانه، متغیر جستجوی محله،
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
چکیده انگلیسی
In this paper, we propose a decentralized approach to solve multiple-criteria single machine scheduling problems. We consider a single machine that is utilized by two agents where each of them has its own jobs and a private objective. The objective function of the first agent is the total completion time or the total weighted completion time of its jobs, respectively, whereas the objective function of the second agent is the maximum lateness or the total weighted completion time of its jobs. The problem is motivated by scheduling problems found in semiconductor manufacturing. An automated negotiation mechanism is presented to solve the scheduling problems. The basic ingredient of the mechanism is a mediator that proposes contracts using a variable neighborhood search (VNS) technique. We study the behavior of both greedy and cooperative agents. In addition, a hybrid strategy is developed where the mediator accepts deteriorations of the objective values with a certain probability. The performance of the negotiation schemes is assessed using randomly generated problem instances. It turns out that the solutions determined by the negotiation mechanism are close to the Pareto frontier from a centralized approach with full information. We use a problem-specific Non-Dominated Sorting Genetic Algorithm (NSGA)-II scheme to determine the solutions on the Pareto frontier. It is shown that the degree of cooperation of the two agents depends on the objective function used.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 99, September 2016, Pages 318-329
Journal: Computers & Industrial Engineering - Volume 99, September 2016, Pages 318-329
نویسندگان
Rene Ramacher, Lars Mönch,