A simple genetic algorithm for a minimal overlapping scheduling problem

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 jo...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Olivera, Alfredo, Nesmachnow, Sergio
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2004
Materias:
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
Optimization
Scheduling
Genetic Algorithms
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22559
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22559
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
Optimization
Scheduling
Genetic Algorithms
spellingShingle Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
Optimization
Scheduling
Genetic Algorithms
Olivera, Alfredo
Nesmachnow, Sergio
A simple genetic algorithm for a minimal overlapping scheduling problem
topic_facet Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Intelligent agents
Optimization
Scheduling
Genetic Algorithms
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.
format Objeto de conferencia
Objeto de conferencia
author Olivera, Alfredo
Nesmachnow, Sergio
author_facet Olivera, Alfredo
Nesmachnow, Sergio
author_sort Olivera, Alfredo
title A simple genetic algorithm for a minimal overlapping scheduling problem
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 simple genetic algorithm for a minimal overlapping scheduling problem
publishDate 2004
url http://sedici.unlp.edu.ar/handle/10915/22559
work_keys_str_mv AT oliveraalfredo asimplegeneticalgorithmforaminimaloverlappingschedulingproblem
AT nesmachnowsergio asimplegeneticalgorithmforaminimaloverlappingschedulingproblem
AT oliveraalfredo simplegeneticalgorithmforaminimaloverlappingschedulingproblem
AT nesmachnowsergio simplegeneticalgorithmforaminimaloverlappingschedulingproblem
bdutipo_str Repositorios
_version_ 1764820466010161154

Ejemplares similares