کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347226 | 699111 | 2011 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness](/preview/png/10347226.png)
چکیده انگلیسی
In many realistic production situations, a job processed later consumes more time than the same job when it is processed earlier. Production scheduling in such an environment is known as scheduling with deteriorating jobs. However, research on scheduling problems with deteriorating jobs has rarely considered explicit (separable) setup time (cost). In this paper, we consider a single-machine scheduling problem with deteriorating jobs and setup times to minimize the maximum tardiness. We provide a branch-and-bound algorithm to solve this problem. Computational experiments show that the algorithm can solve instances up to 1000 jobs in reasonable time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 38, Issue 12, December 2011, Pages 1760-1765
Journal: Computers & Operations Research - Volume 38, Issue 12, December 2011, Pages 1760-1765
نویسندگان
T.C.E. Cheng, Chou-Jung Hsu, Yi-Chi Huang, Wen-Chiung Lee,