Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2012-10-26T12:37:08Z
dc.date.available 2012-10-26T12:37:08Z
dc.date.issued 2002-10
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/23004
dc.description.abstract Instances of static scheduling problems can be easily represented as graphs where each node represents a particular operation. This property makes the Ant Colony Algorithms well suited for different kinds of scheduling problems. In this paper we present an improved Ant System for solving the Job Shop Scheduling (JSS) Problem. After each cycle the Ant System applies a scheduler builder to each solution. The schedule builder is able to generate under a controlled manner different types of schedules (from non-delay to active). Any improvement achieved for a solution will affect the performance of the algorithm in the next cycles by changing accordingly the amount of pheromone on certain paths. Since the pheromone is the building block of an ant algorithm, it is expected that these changes guide the search towards more promising areas of the search space. The computational study involves a set of instances of different size and difficulty. The results are compared against the best solutions known so far and results reported from earlier studies of ant algorithms applied to the JSSP. en
dc.format.extent 617-627 es
dc.language en es
dc.subject ant colony optimization en
dc.subject Optimization es
dc.subject job shop scheduling problem en
dc.subject Scheduling es
dc.subject ARTIFICIAL INTELLIGENCE es
dc.subject active and non-delay schedules en
dc.title An improved ant colony algorithm for the job shop scheduling problem en
dc.type Objeto de conferencia es
sedici.creator.person Leguizamón, Guillermo es
sedici.creator.person Schutz, Martín es
sedici.description.note Eje: Sistemas inteligentes es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Red de Universidades con Carreras en Informática (RedUNCI) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
sedici.date.exposure 2002-10
sedici.relation.event VIII Congreso Argentino de Ciencias de la Computación es
sedici.description.peerReview peer-review es


Download Files

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)