کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5082768 | 1477647 | 2007 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scheduling on a single machine with family setups to minimize total tardiness
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper considers the problem of scheduling on a single machine to minimize total tardiness when family setup times exist. The paper proposes optimal branch-and-bound procedures for the case where the group technology assumption is used and for the case when the group technology assumption is removed. A heuristic procedure is also proposed to solve larger problems with the group technology assumption removed. The procedures were tested on problems of various sizes and parameters. An important finding of the tests is total tardiness can be significantly reduced by removing the group technology assumption when scheduling.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 105, Issue 2, February 2007, Pages 329-344
Journal: International Journal of Production Economics - Volume 105, Issue 2, February 2007, Pages 329-344
نویسندگان
Jeffrey Schaller,