کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1141881 | 957098 | 2008 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Group sequencing around a common due date
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
کنترل و بهینه سازی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Group sequencing around a common due date Group sequencing around a common due date](/preview/png/1141881.png)
چکیده انگلیسی
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence independent setup time precedes the processing of each group. All jobs have a common fixed due date, which can be either unrestrictively large or restrictively small. The objective is to minimize the total weighted earliness–tardiness. Properties of optimal solutions are established, and dynamic programming algorithms are derived to solve several special cases of this problem. Computational experiments show that the algorithms can easily solve problems with 500 groups of jobs and each group has 10 to 50 jobs on a standard PC.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Optimization - Volume 5, Issue 3, August 2008, Pages 594–604
Journal: Discrete Optimization - Volume 5, Issue 3, August 2008, Pages 594–604
نویسندگان
T.C. Edwin Cheng, Mikhail Y. Kovalyov, C.T. Ng, S.S. Lam,