Heuristics for partial and total dynamic W-T problems 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: Lasso, Marta Graciela, Pandolfi, Daniel, San Pedro, María Eugenia de, Villagra, Andrea, Vilanova, Gabriela, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2003
Materias:
Ciencias Informáticas
Environments
gestión
informática
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21433
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-21433
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
Environments
gestión
informática
spellingShingle Ciencias Informáticas
Environments
gestión
informática
Lasso, Marta Graciela
Pandolfi, Daniel
San Pedro, María Eugenia de
Villagra, Andrea
Vilanova, Gabriela
Gallard, Raúl Hector
Heuristics for partial and total dynamic W-T problems in single machine environments
topic_facet Ciencias Informáticas
Environments
gestión
informática
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, ensuring to accomplish it before the due date deadline. In totally dynamics problems, other job attributes such as processing time pj, due date dj, and tardiness penalty wj, are also unknown. Our research proposes different approaches for resolution of Weighted Tardiness dynamic problems (partial and total) in a single machine environment. A first approach uses, as a list of dispatching priorities a final schedule, found as the best by another heuristic for a similar static problem: same job features, processing time, due dates and weights. A second approach uses as a dispatching priority the order imposed by a partial schedule created, at each decision point, by another heuristic. 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 Lasso, Marta Graciela
Pandolfi, Daniel
San Pedro, María Eugenia de
Villagra, Andrea
Vilanova, Gabriela
Gallard, Raúl Hector
author_facet Lasso, Marta Graciela
Pandolfi, Daniel
San Pedro, María Eugenia de
Villagra, Andrea
Vilanova, Gabriela
Gallard, Raúl Hector
author_sort Lasso, Marta Graciela
title Heuristics for partial and total dynamic W-T problems in single machine environments
title_short Heuristics for partial and total dynamic W-T problems in single machine environments
title_full Heuristics for partial and total dynamic W-T problems in single machine environments
title_fullStr Heuristics for partial and total dynamic W-T problems in single machine environments
title_full_unstemmed Heuristics for partial and total dynamic W-T problems in single machine environments
title_sort heuristics for partial and total dynamic w-t problems in single machine environments
publishDate 2003
url http://sedici.unlp.edu.ar/handle/10915/21433
work_keys_str_mv AT lassomartagraciela heuristicsforpartialandtotaldynamicwtproblemsinsinglemachineenvironments
AT pandolfidaniel heuristicsforpartialandtotaldynamicwtproblemsinsinglemachineenvironments
AT sanpedromariaeugeniade heuristicsforpartialandtotaldynamicwtproblemsinsinglemachineenvironments
AT villagraandrea heuristicsforpartialandtotaldynamicwtproblemsinsinglemachineenvironments
AT vilanovagabriela heuristicsforpartialandtotaldynamicwtproblemsinsinglemachineenvironments
AT gallardraulhector heuristicsforpartialandtotaldynamicwtproblemsinsinglemachineenvironments
bdutipo_str Repositorios
_version_ 1764820464530620416

Ejemplares similares