کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
476385 699463 2006 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
چکیده انگلیسی

We study the problem of scheduling n preemptable jobs in a two-machine flow shop where the first machine is not available for processing during a given time interval. The objective is to minimize the makespan. We propose a polynomial-time approximation scheme for this problem. The approach is extended to solve the problem in which the second machine is not continuously available.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 33, Issue 8, August 2006, Pages 2143–2153
نویسندگان
,