کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9664038 | 1446254 | 2005 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints](/preview/png/9664038.png)
چکیده انگلیسی
This study concerns the domain of cyclic scheduling. More precisely we consider the cyclic job shop scheduling problem with linear constraints. The main characteristic of this problem is that the tasks of each job are cyclic and are subjected to linear precedence constraints. First we review some approaches in the field of cyclic scheduling and present the cyclic job shop scheduling problem definition, which has an open complexity. Then we present a general approach for solving it, based on the coupling of a genetic algorithm and a scheduler. This scheduler utilises a Petri-net modelling the linear precedence constraints between cyclic tasks. The goal of this genetic algorithm is to propose an order of priority for jobs on the machines, to be used by the scheduler for solving resource conflicts. Finally a benchmark and some preliminary results of this approach are presented.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 161, Issue 1, 16 February 2005, Pages 73-85
Journal: European Journal of Operational Research - Volume 161, Issue 1, 16 February 2005, Pages 73-85
نویسندگان
G. Cavory, R. Dupas, G. Goncalves,