کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
477294 | 1446149 | 2009 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows](/preview/png/477294.png)
چکیده انگلیسی
This paper deals with several bicriteria open-shop scheduling problems where jobs are pre-emptable and their corresponding time-windows must be strictly respected. The criteria are a performance cost and the makespan. Network flow approaches are used in a lexmin procedure with a bounded makespan and the considered bicriteria problems are solved. Finally, the computational complexity of the algorithm and a numerical example are reported.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 196, Issue 1, 1 July 2009, Pages 140–154
Journal: European Journal of Operational Research - Volume 196, Issue 1, 1 July 2009, Pages 140–154
نویسندگان
A. Sedeño-Noda, D. Alcaide López de Pablo, C. González-Martín,