کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1134109 | 956055 | 2013 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A minimum-cost network flow approach to preemptive parallel-machine scheduling
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A minimum-cost network flow approach to preemptive parallel-machine scheduling A minimum-cost network flow approach to preemptive parallel-machine scheduling](/preview/png/1134109.png)
چکیده انگلیسی
We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines.
► A minimum-cost network flow approach to preemptive parallel-machines scheduling problem is proposed.
► The job release dates, machine availability and eligibility constraints are considered.
► The approach can be applied to tackle a variety of preemptive scheduling problems with special structure.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 64, Issue 1, January 2013, Pages 453–458
Journal: Computers & Industrial Engineering - Volume 64, Issue 1, January 2013, Pages 453–458
نویسندگان
Ling-Huey Su, T.C.E. Cheng, Fuh-Der Chou,