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

View/Open
Cita com:
hdl:2117/111059
Document typeArticle
Defense date2017-11-13
PublisherTaylor & Francis
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
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.
CitationCompanys , 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.
ISSN0020-7543
Files | Description | Size | Format | View |
---|---|---|---|---|
manuscript_rev3.pdf | 96,68Kb | View/Open |