کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9663770 | 1446242 | 2005 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal timing of a sequence of tasks with general completion costs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal timing of a sequence of tasks with general completion costs Optimal timing of a sequence of tasks with general completion costs](/preview/png/9663770.png)
چکیده انگلیسی
Scheduling a sequence of tasks--in the acceptation of finding the execution times--is not a trivial problem when the optimization criterion is irregular as for instance in earliness-tardiness problems. This paper presents an efficient dynamic programming algorithm to solve the problem with general cost functions depending on the end time of the tasks, idle time costs and variable durations also depending on the execution time of the tasks. The algorithm is also valid when the precedence graph is a tree and it can be adapted to determine the possible execution windows for each task not exceeding a maximum fixed cost.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 165, Issue 1, 16 August 2005, Pages 82-96
Journal: European Journal of Operational Research - Volume 165, Issue 1, 16 August 2005, Pages 82-96
نویسندگان
Francis Sourd,