The nature of simplicity of Johnson's algorithm

J. Kamburowski

Omega, 1997, vol. 25, issue 5, 581-584

Abstract: This note presents a simple proof and a graphical illustration for the optimality of the famous algorithm of Johnson which minimizes the makespan in two-machine flow shops.

Keywords: Key; words-Johnson's; algorithm; flow; shop; makespan (search for similar items in EconPapers)
Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305-0483(97)00021-2
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:25:y:1997:i:5:p:581-584

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().