Loading...
Loading...

Go to the content (press return)

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

Author
Companys, R.; Ribas, I.
Type of activity
Journal article
Journal
International journal of production research
Date of publication
2017-11-13
First page
1
Last page
2
DOI
https://doi.org/10.1080/00207543.2017.1401242 Open in new window
Repository
http://hdl.handle.net/2117/111059 Open in new window
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.
Citation
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.
Keywords
Flow shop, Johnson’s theorem, makespan, scheduling, transitivity
Group of research
SCOM - Supply Chain and Operations Management

Participants

Attachments