| Article ID: | iaor1989920 |
| Country: | United Kingdom |
| Volume: | 18 |
| Start Page Number: | 106 |
| End Page Number: | 107 |
| Publication Date: | Feb 1990 |
| Journal: | OMEGA |
| Authors: | Fry T.D. |
This paper presents the results of a study of problem characteristics on the efficiency of a branch and bound strategy for single machine scheduling. These are the due date tightness and its coefficient of variation. It is shown that both characteristics have significant impact on the computational requirement of the algorithm.