Busque entre los 155287 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-09-27T15:24:50Z | |
dc.date.available | 2012-09-27T15:24:50Z | |
dc.date.issued | 2001 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/21674 | |
dc.description.abstract | Nearly all practical scheduling problems can be described in terms of the job-shop scheduling problem, in which L jobs are to be processed by M machines. Each job will have a set of constraints on the order in which machines can be used; moreover the processing time on each machine is specified for each job. The job-shop scheduling problem consists in finding a sequence of jobs on each machine in order to minimise a given objective function. In the case here considered, it is the minimization of the makespan. | en |
dc.language | en | es |
dc.subject | ARTIFICIAL INTELLIGENCE | es |
dc.subject | chromosome representations | en |
dc.subject | JSS problem | en |
dc.title | Using different chromosome representations for the JSS problem | en |
dc.type | Objeto de conferencia | es |
sedici.creator.person | Salto, Carolina | es |
sedici.creator.person | Hugo, Alfonso | es |
sedici.creator.person | Gallard, Raúl Hector | es |
sedici.description.note | Eje: Inteligencia Computacional - Metaheurísticas | 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 | 2001-05 | es |
sedici.relation.event | III Workshop de Investigadores en Ciencias de la Computación | es |
sedici.description.peerReview | peer-review | es |