کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
483018 | 1446194 | 2007 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags](/preview/png/483018.png)
چکیده انگلیسی
We consider the one-machine scheduling problem with minimum and maximum time lags while minimizing the makespan. This problem typically arises in a manufacturing environment where the next job has to be carried out within a specific time range after the completion of the immediately preceding job. We describe a branch and bound algorithm, based on the input and output of a clique and the relevant propositions, for finding the optimal waiting times. The computational experiments give promising results, showing whether a given instance is feasible or infeasible. With the proposed branch and bound algorithm we can either find an optimal schedule or establish the infeasibility within an acceptable run time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 181, Issue 1, 16 August 2007, Pages 102–116
Journal: European Journal of Operational Research - Volume 181, Issue 1, 16 August 2007, Pages 102–116
نویسندگان
Gwo-Ji Sheen, Lu-Wen Liao,