Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production
نویسندگان
چکیده
منابع مشابه
Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production
The problem of efficiently scheduling production jobs on several machines is an important consideration when attempting to make effective use of a multimachines system such as a flexible job shop scheduling production system (FJSP). In most of its practical formulations, the FJSP is known to be NP-hard [8][9], so exact solution methods are unfeasible for most problem instances and heuristic app...
متن کاملReactive Search for Flexible Job Shop Scheduling
In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...
متن کاملJob Shop Scheduling by Local Search
We survey solution methods for the job shop scheduling problem with an emphasis on local search. Both deterministic and randomized local search methods as well as the proposed neighborhoods are discussed. We compare the computational performance of the various methods in terms of their eeectiveness and eeciency on a standard set of problem instances. In the job shop scheduling problem we are gi...
متن کاملAnt Colony Optimization for Job Shop Scheduling Problem
This paper presents an application of the Ant colony optimization metaheuristic to the job shop scheduling problem. A pheromone alteration strategy which improves the basic ant system by utilizing the behaviour of artificial ants to perform local search is introduced. Experiments using well-known benchmark JSSP problems show that this approach improves on the performance obtained by the basic a...
متن کاملAn ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2007
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2007.2.2350