Johnson's approximate method for the 3 × n job shop problem

Wlodzimierz Szwarc and George K. Hutchinson

Naval Research Logistics Quarterly, 1977, vol. 24, issue 1, 153-157

Abstract: The effectiveness of Johnson's Approximate Method (JAM) for the 3 × n job shop scheduling problems was examined on 1,500 test cases with n ranging from 6 to 50 and with the processing times Ai, Bi, Ci (for item i on machines A, B, C) being uniformly and normally distributed. JAM proved to be quite effective for the case Bi ⩽ max (Ai, Ci) and optimal for Bi, ⩽ min (Ai, Ci).

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800240112

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:wly:navlog:v:24:y:1977:i:1:p:153-157

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().