Johnson's approximate method for the 3 × n job shop problem
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 qu...
Gespeichert in:
| Veröffentlicht in: | Naval research logistics quarterly 1977-03, Vol.24 (1), p.153-157 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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). |
|---|---|
| ISSN: | 0028-1441 1931-9193 |
| DOI: | 10.1002/nav.3800240112 |