A GREEDY ALGORITHM FOR TASK SCHEDULING PROBLEM

Authors

  • Manuel Tupia Anticona
  • David Santos Mauricio Sánchez

Keywords:

greedy myopic algorithms, task scheduling, combinatorial optimization, heuristics, Artificial Intelligence.

Abstract

The industrial planning has experimented great advances since its beginning for a middle of 20th century. It has been demonstrated its applications importance into the several industrial where its involved even though the difficult of design exact algorithms that resolved the variants. It has been applied heuristics methods for the planning problems due their high complexity; especially Artificial Intelligence when develop new strategies for resolving one of the most important variant, called task scheduling. It is able to define the task scheduling problem like: a set of N production line ‘s tasks and M machines, which ones can execute those tasks. The goal is to find an order that minimize the accumulated execution time, known as makespan. This paper presents a meta heuristic strategy GRASP for the problem of programming of dependent tasks in different single machines.

Downloads

Download data is not yet available.

Downloads

Published

2004-12-30

Issue

Vol. 1 No. 1 (2004)

Section

Artículos

License

Copyright (c) 2004 Manuel Tupia Anticona, David Santos Mauricio Sánchez

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

AUTHORS RETAIN THEIR RIGHTS:

a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.

b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the Revista de investigación de Sistemas e Informática. 

c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating its initial publication in the Revista de investigación de Sistemas e Informática (the originator of the work, journal, volume, number and date).

How to Cite

[1]
“A GREEDY ALGORITHM FOR TASK SCHEDULING PROBLEM”, Rev.Investig.sist.inform., vol. 1, no. 1, pp. 9–18, Dec. 2004, Accessed: Jul. 17, 2024. [Online]. Available: https://revistasinvestigacion.unmsm.edu.pe/index.php/sistem/article/view/3163