کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347164 | 699096 | 2012 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An investigation on a two-agent single-machine scheduling problem with unequal release dates
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper addresses a two-agent scheduling problem on a single machine with arbitrary release dates, where the objective is to minimize the tardiness of one agent, while keeping the lateness of the other agent below or at a fixed level Q. A mixed integer programming model is first presented for its optimal solution, admittedly not to be practical or useful in the most cases, but theoretically interesting since it models the problem. Thus, as an alternative, a branch-and-bound algorithm incorporating with several dominance properties and a lower bound is provided to derive the optimal solution and a marriage in honey-bees optimization algorithm (MBO) is developed to derive the near-optimal solutions for the problem. Computational results are also presented to evaluate the performance of the proposed algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 12, December 2012, Pages 3062-3073
Journal: Computers & Operations Research - Volume 39, Issue 12, December 2012, Pages 3062-3073
نویسندگان
Yunqiang Yin, Wen-Hsiang Wu, Shuenn-Ren Cheng, Chin-Chia Wu,