haku: @author Borah, B. N. / yhteensä: 1
viite: 1 / 1
« edellinen | seuraava »
| Tekijä: | Sen, T. Borah, B. N. |
| Otsikko: | On the single-machine scheduling problem with tardiness penalties |
| Lehti: | Journal of the Operational Research Society
1991 : AUG, VOL. 42:8, p. 695-702 |
| Asiasana: | BRANCH AND BOUND METHODS PRODUCTION SCHEDULING ALGORITHMS SEQUENTIAL ANALYSIS NUMERICAL COMPUTATION PROBLEM FORMULATION |
| Kieli: | eng |
| Tiivistelmä: | The proposed branching algorithm for solving the one-machine, n-job total tardiness problem is based on three theorems concerning the relationships between pairs of jobs in sequence. An example is provided to demonstrate how the algorithm works and to show how it may provide a smaller set of candidate sequences than other procedures. The results of computational testing show that the proposed procedure is superior to the DP algorithm in reducing the problem size. The intent of the paper is not to compare the computational efficiency of the two methods in terms of CPU time, but to show that the proposed method is superior in regard to reducing the problem size. |
« edellinen | seuraava »
SCIMA