کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
382732 660788 2013 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Scheduling flow lines with buffers by ant colony digraph
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Scheduling flow lines with buffers by ant colony digraph
چکیده انگلیسی

This work starts from modeling the scheduling of n jobs on m machines/stages as flowshop with buffers in manufacturing. A mixed-integer linear programing model is presented, showing that buffers of size n − 2 allow permuting sequences of jobs between stages. This model is addressed in the literature as non-permutation flowshop scheduling (NPFS) and is described in this article by a disjunctive graph (digraph) with the purpose of designing specialized heuristic and metaheuristics algorithms for the NPFS problem. Ant colony optimization (ACO) with the biologically inspired mechanisms of learned desirability and pheromone rule is shown to produce natively eligible schedules, as opposed to most metaheuristics approaches, which improve permutation solutions found by other heuristics. The proposed ACO has been critically compared and assessed by computation experiments over existing native approaches. Most makespan upper bounds of the established benchmark problems from Taillard (1993) and Demirkol, Mehta, and Uzsoy (1998) with up to 500 jobs on 20 machines have been improved by the proposed ACO.


► Non-permutation/permutation flow line/flowshop scheduling models in manufacturing.
► Mixed integer model, digraph representation and pseudo code for NPFS–ACO.
► Native ACO approaches compared on Taillard and Demirkol benchmarks.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 40, Issue 9, July 2013, Pages 3328–3340
نویسندگان
, ,