کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481150 | 1446129 | 2010 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines](/preview/png/481150.png)
چکیده انگلیسی
This paper deals with a scheduling problem of independent tasks with common due date where the objective is to minimize the total weighted tardiness. The problem is known to be ordinary NP-hard in the case of a single machine and a dynamic programming algorithm was presented in the seminal work of Lawler and Moore [E.L. Lawler, J.M. Moore, A functional equation and its application to resource allocation and sequencing problems, Management Science 16 (1969) 77–84]. In this paper, this algorithm is described and discussed. Then, a new dynamic programming algorithm is proposed for solving the single machine case. These methods are extended for solving the identical and uniform parallel-machine scheduling problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 202, Issue 3, 1 May 2010, Pages 646–653
Journal: European Journal of Operational Research - Volume 202, Issue 3, 1 May 2010, Pages 646–653
نویسندگان
Nguyen Huynh Tuong, Ameur Soukhal, Jean-Charles Billaut,