Abstract
In this paper, a most efficient implementation of Johnson’s two-stage algorithm is presented. An illustration with numerical example and computational results is also included.
| Original language | English |
|---|---|
| Pages (from-to) | 1049-1052 |
| Number of pages | 4 |
| Journal | Journal of the Operational Research Society |
| Volume | 40 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - Nov 1989 |
User-Defined Keywords
- Production
- Scheduling
- Sequencing