کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1143343 957193 2006 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
چکیده انگلیسی
A large dynasearch neighborhood is introduced for the one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties. Finding the best schedule in this neighborhood is NP-complete in the ordinary sense but can be done in pseudo-polynomial time. We also present experimental results.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 34, Issue 5, September 2006, Pages 591-598
نویسندگان
,