|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 4 van 6 gevonden artikelen
| Titel: |
ESTUDIO DE ALGORITMOS DINÁMICOS PARA EL PROBLEMA DE SECUENCIACIÓN DE TRABAJOS EN UNA MÁQUINA SIMPLE |
| Auteur: |
Jairo Rafael Montoya Torres Gloria Rodríguez Verján Liliana Merchán Alba |
| Verschenen in: |
Ingeniería y Universidad |
| Paginering: | Jaargang 10 (2006) nr. 2 pagina's 155-178 |
| Jaar: |
2006 |
| Inhoud: |
Classical scheduling theory has traditionally considered the study and evaluation of scheduling algorithms based on the hypothesis of perfect advanced knowledge of the information needed to make the sequencing decisions. These algorithms are called to be used in an off-line context. Recently, a great interest has been dedicated to the study of on-line scheduling algorithms, which make sequencing decision on real-time, knowing only the information about jobs already arrived at the decision time. This paper considers the problem of scheduling on-line jobs on a single machine environment, and studies the well-known SPT (Shortest Processing Time) and FIFO (First In, First Out) scheduling rules in an on-line context. The study of these two rules is first presented from the theoretic stand point by analyzing their worst-case competitiveness. Afterwards, the algorithms are compared from the practical point of view by a complete set of simulation experiments. |
| Uitgever: |
Pontificia Universidad Javeriana (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 4 van 6 gevonden artikelen
| << vorige | volgende >> |