Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A note on the paper ‘Demonstrating Johnson’s algorithm via resource constrained scheduling’

Autor
Companys , R.; Ribas, I.
Tipus d'activitat
Article en revista
Revista
International journal of production research
Data de publicació
2017-11-13
Pàgina inicial
1
Pàgina final
2
DOI
https://doi.org/10.1080/00207543.2017.1401242 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/111059 Obrir en finestra nova
Resum
In this paper we demonstrate that the relation between two jobs defined by min{ai, bj}=min{bi, aj}, used in Johnson’s theorem, is not transitive. However, both the theorem and Johnson’s algorithm are correct.
Citació
Companys , R., Ribas, I. A note on the paper ‘Demonstrating Johnson’s algorithm via resource constrained scheduling’. "International journal of production research", 13 Novembre 2017, p. 1-2.
Paraules clau
Flow shop, Johnson’s theorem, makespan, scheduling, transitivity
Grup de recerca
SCOM - Supply Chain and Operations Management

Participants