A simple genetic algorithm for a minimal overlapping scheduling problem
- Autores
- Olivera, Alfredo; Nesmachnow, Sergio
- Año de publicación
- 2004
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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.
Eje: V - Workshop de agentes y sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
Optimization
Scheduling
Genetic Algorithms - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/22559
Ver los metadatos del registro completo
| id |
SEDICI_42047bf8a004fcd5324b4caaecf3fc4d |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/22559 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
A simple genetic algorithm for a minimal overlapping scheduling problemOlivera, AlfredoNesmachnow, SergioCiencias InformáticasARTIFICIAL INTELLIGENCEIntelligent agentsOptimizationSchedulingGenetic AlgorithmsThis 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.Eje: V - Workshop de agentes y sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI)2004-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/22559enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-17T09:38:31Zoai:sedici.unlp.edu.ar:10915/22559Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-17 09:38:31.921SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
A simple genetic algorithm for a minimal overlapping scheduling problem |
| title |
A simple genetic algorithm for a minimal overlapping scheduling problem |
| spellingShingle |
A simple genetic algorithm for a minimal overlapping scheduling problem Olivera, Alfredo Ciencias Informáticas ARTIFICIAL INTELLIGENCE Intelligent agents Optimization Scheduling Genetic Algorithms |
| title_short |
A simple genetic algorithm for a minimal overlapping scheduling problem |
| title_full |
A simple genetic algorithm for a minimal overlapping scheduling problem |
| title_fullStr |
A simple genetic algorithm for a minimal overlapping scheduling problem |
| title_full_unstemmed |
A simple genetic algorithm for a minimal overlapping scheduling problem |
| title_sort |
A simple genetic algorithm for a minimal overlapping scheduling problem |
| dc.creator.none.fl_str_mv |
Olivera, Alfredo Nesmachnow, Sergio |
| author |
Olivera, Alfredo |
| author_facet |
Olivera, Alfredo Nesmachnow, Sergio |
| author_role |
author |
| author2 |
Nesmachnow, Sergio |
| author2_role |
author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas ARTIFICIAL INTELLIGENCE Intelligent agents Optimization Scheduling Genetic Algorithms |
| topic |
Ciencias Informáticas ARTIFICIAL INTELLIGENCE Intelligent agents Optimization Scheduling Genetic Algorithms |
| dc.description.none.fl_txt_mv |
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. Eje: V - Workshop de agentes y sistemas inteligentes Red de Universidades con Carreras en Informática (RedUNCI) |
| description |
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. |
| publishDate |
2004 |
| dc.date.none.fl_str_mv |
2004-10 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/22559 |
| url |
http://sedici.unlp.edu.ar/handle/10915/22559 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
| dc.format.none.fl_str_mv |
application/pdf |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1843532049981374464 |
| score |
13.001348 |