کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10328297 | 683931 | 2005 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal parallel machines scheduling with availability constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal parallel machines scheduling with availability constraints Optimal parallel machines scheduling with availability constraints](/preview/png/10328297.png)
چکیده انگلیسی
We address a generalization of the classical multiprocessor scheduling problem with non simultaneous machine availability times, release dates, and delivery times. We develop new lower and upper bounds as well as a branching strategy which is based on a representation of a schedule as a permutation of jobs. We show that embedding a semi-preemptive lower bound based on max-flow computations in a branch-and-bound algorithm yields very promising performance. Computational experiments demonstrate that randomly generated instances with up to 700 jobs and 20 machines are solved within moderate CPU time. Moreover, the versatility of the proposed approach is assessed through its ability to solve large instances of two important particular cases P,NCinc||Cmax and P|rj,qj|Cmax.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 148, Issue 1, 30 April 2005, Pages 63-87
Journal: Discrete Applied Mathematics - Volume 148, Issue 1, 30 April 2005, Pages 63-87
نویسندگان
Anis Gharbi, Mohamed Haouari,