اخبار و اعلانات

 آمار

تعداد نشریات418
تعداد شماره‌ها9,997
تعداد مقالات83,560
تعداد مشاهده مقاله77,801,302
تعداد دریافت فایل اصل مقاله54,843,926
. (1388). A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem. نشریه علمی پژوهشی دانشگاه آزاد اسلامی, Volume 2(Issue 4), 71-78.
. "A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem". نشریه علمی پژوهشی دانشگاه آزاد اسلامی, Volume 2, Issue 4, 1388, 71-78.
. (1388). 'A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem', نشریه علمی پژوهشی دانشگاه آزاد اسلامی, Volume 2(Issue 4), pp. 71-78.
. A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem. نشریه علمی پژوهشی دانشگاه آزاد اسلامی, 1388; Volume 2(Issue 4): 71-78.

A Cellular Learning Automata (CLA) Approach to Job Shop Scheduling Problem

Journal of Optimization in Industrial Engineering
مقاله 8، Volume 2، Issue 4، آذر 2009، صفحه 71-78    اصل مقاله (296.65 K)
چکیده
Job shop scheduling problem (JSSP), as one of the NP-Hard combinatorial optimization problems, has attracted the attention of many researchers during the last four decades. The overall purpose regarding this problem is to minimize maximum completion time of jobs, known as makespan. This paper addresses an approach to evolving Cellular Learning Automata (CLA) in order to enable it to solve the JSSP by minimizing the makespan. This approach is applied to several instances of a variety of benchmarks and the experimental results show that it produces nearly optimal solutions, compared with other approaches.
کلیدواژه‌ها
Job Shop؛ Scheduling؛ Makespan؛ Cellular Learning Automata
آمار
تعداد مشاهده مقاله: 3,626
تعداد دریافت فایل اصل مقاله: 3,625


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب