کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482682 | 1446219 | 2006 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A recovering beam search algorithm for the single machine Just-in-Time scheduling problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
We consider the Just-in-Time scheduling problem where the Just-in-Time notion is captured by means of multiple conflicting criteria. The calculation of any non-dominated solution for these criteria is achieved by solving an extension of the single machine problem of minimising the mean weighted deviation from distinct due dates. In the extended problem each job to schedule is also constrained by a release date and a deadline. This problem is NPNP-Hard in the strong sense and we propose heuristic algorithms to solve it. Computational experiments show that, among those algorithms, the most effective heuristic, in terms of quality, is a Recovering Beam Search algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 172, Issue 3, 1 August 2006, Pages 798–813
Journal: European Journal of Operational Research - Volume 172, Issue 3, 1 August 2006, Pages 798–813
نویسندگان
B. Esteve, C. Aubijoux, A. Chartier, V. T’kindt,