Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2012-10-17T14:15:05Z
dc.date.available 2012-10-17T14:15:05Z
dc.date.issued 2004
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/22559
dc.description.abstract This article introduces a new version of the Multiple Machine Scheduling Problem: the Scheduling Problem with Time Windows and Minimal Overlap (SPTWMO). Given a set of nonpreemptive jobs with time windows and a number of identical machines, the problem consists on finding a starting time for each job which satisfies time window constraints while minimizing a measure of resource infeasibility (the Total Overlap). The problem is NP-Complete even in the case when only one machine is considered. We present a simple genetic algorithm applied to the SPTWMO, reporting efficient numerical results according to lower bounds obtained solving the preemptive version of the problem. en
dc.language en es
dc.subject ARTIFICIAL INTELLIGENCE es
dc.subject Genetic Algorithms en
dc.subject Intelligent agents es
dc.subject Optimization es
dc.subject Scheduling es
dc.title A simple genetic algorithm for a minimal overlapping scheduling problem en
dc.type Objeto de conferencia es
sedici.creator.person Olivera, Alfredo es
sedici.creator.person Nesmachnow, Sergio es
sedici.description.note Eje: V - Workshop de agentes y 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 2004-10
sedici.relation.event X Congreso Argentino de Ciencias de la Computación es
sedici.description.peerReview peer-review es


Descargar archivos

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)