کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475280 | 699275 | 2010 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs](/preview/png/475280.png)
چکیده انگلیسی
In this paper we consider a two-machine flow shop scheduling problem with deteriorating jobs. By a deteriorating job we mean that the job's processing time is an increasing function of its starting time. We model job deterioration as a function that is proportional to a linear function of time. The objective is to find a sequence that minimizes the total completion time of the jobs. For the general case, we derive several dominance properties, some lower bounds, and an initial upper bound by using a heuristic algorithm, and apply them to speed up the elimination process of a branch-and-bound algorithm developed to solve the problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 37, Issue 1, January 2010, Pages 83–90
Journal: Computers & Operations Research - Volume 37, Issue 1, January 2010, Pages 83–90
نویسندگان
C.T. Ng, J.-B. Wang, T.C.E. Cheng, L.L. Liu,