Revistas de investigación UNMSM

Problem of determining the order of execution of n jobs on m machines where each job has a different sequence of process

Authors

  • Roberto Eyzaguirre Tejada Universidad Nacional Mayor de San Marcos, Facultad de Ingeniería Industrial. Lima, Peru

DOI:

https://doi.org/10.15381/idata.v2i2.6526

Keywords:

problem, sequence, process

Abstract

In this article is on H. Greenberg algorithm that is used to facilitate b'squeda a graphical solution for determining the order of execution of n jobs

Downloads

Download data is not yet available.

Author Biography

  • Roberto Eyzaguirre Tejada, Universidad Nacional Mayor de San Marcos, Facultad de Ingeniería Industrial. Lima, Peru

    Docente

Downloads

Published

1999-12-31

Issue

Vol. 2 No. 2 (1999)

Section

Contenido

License

Copyright (c) 1999 Roberto Eyzaguirre Tejada

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 INDUSTRIAL DATA.

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 the source of publication (the originator of the work, journal, volume, number and date).

How to Cite

Problem of determining the order of execution of n jobs on m machines where each job has a different sequence of process. (1999). Industrial Data, 2(2), 44-47. https://doi.org/10.15381/idata.v2i2.6526