Solutions to the dynamic average tardiness problem in single machine environments

In dynamic scheduling arrival times as well, as some or all job attributes are unknown in advance. Dynamism can be classified as partial or total. In simplest partially dynamic problems the only unknown attribute of a job is its arrival time rj. A job arrival can be given at any instant in the time...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: San Pedro, María Eugenia de, Lasso, Marta Graciela, Villagra, Andrea, Pandolfi, Daniel, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Español
Publicado: 2003
Materias:
Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Evolutionary Scheduling
Average Tardiness
Intelligent agents
Scheduling
Dynamic scheduling
conventional heuristics
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22728
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22728
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Español
topic Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Evolutionary Scheduling
Average Tardiness
Intelligent agents
Scheduling
Dynamic scheduling
conventional heuristics
spellingShingle Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Evolutionary Scheduling
Average Tardiness
Intelligent agents
Scheduling
Dynamic scheduling
conventional heuristics
San Pedro, María Eugenia de
Lasso, Marta Graciela
Villagra, Andrea
Pandolfi, Daniel
Gallard, Raúl Hector
Solutions to the dynamic average tardiness problem in single machine environments
topic_facet Ciencias Informáticas
ARTIFICIAL INTELLIGENCE
Evolutionary Scheduling
Average Tardiness
Intelligent agents
Scheduling
Dynamic scheduling
conventional heuristics
description In dynamic scheduling arrival times as well, as some or all job attributes are unknown in advance. Dynamism can be classified as partial or total. In simplest partially dynamic problems the only unknown attribute of a job is its arrival time rj. A job arrival can be given at any instant in the time interval between zero and a limit established by its processing time, in order to ensure finishing it before the due date deadline. In the cases where the arrivals are near to zero the problem becomes closer to the static problem, otherwise the problem becomes more restrictive. In totally dynamics problems, other job attributes such as processing time pj, due date dj, and tardiness penalty wj, are also unknown. This paper proposes different approaches for resolution of (partial and total) Dynamic Average Tardiness problems in a single machine environment. The first approach uses, as a list of dispatching priorities a final (total) schedule, found as the best by another method for a similar static problem: same job features, processing time, and due dates. The second approach uses as a dispatching priority the order imposed by a partial schedule created by another heuristic, at each decision point. The details of implementation of the proposed algorithms and results for a group of selected instances are discussed in this work.
format Objeto de conferencia
Objeto de conferencia
author San Pedro, María Eugenia de
Lasso, Marta Graciela
Villagra, Andrea
Pandolfi, Daniel
Gallard, Raúl Hector
author_facet San Pedro, María Eugenia de
Lasso, Marta Graciela
Villagra, Andrea
Pandolfi, Daniel
Gallard, Raúl Hector
author_sort San Pedro, María Eugenia de
title Solutions to the dynamic average tardiness problem in single machine environments
title_short Solutions to the dynamic average tardiness problem in single machine environments
title_full Solutions to the dynamic average tardiness problem in single machine environments
title_fullStr Solutions to the dynamic average tardiness problem in single machine environments
title_full_unstemmed Solutions to the dynamic average tardiness problem in single machine environments
title_sort solutions to the dynamic average tardiness problem in single machine environments
publishDate 2003
url http://sedici.unlp.edu.ar/handle/10915/22728
work_keys_str_mv AT sanpedromariaeugeniade solutionstothedynamicaveragetardinessprobleminsinglemachineenvironments
AT lassomartagraciela solutionstothedynamicaveragetardinessprobleminsinglemachineenvironments
AT villagraandrea solutionstothedynamicaveragetardinessprobleminsinglemachineenvironments
AT pandolfidaniel solutionstothedynamicaveragetardinessprobleminsinglemachineenvironments
AT gallardraulhector solutionstothedynamicaveragetardinessprobleminsinglemachineenvironments
bdutipo_str Repositorios
_version_ 1764820467588268032

Ejemplares similares