haku: @author Chang, Y. L. / yhteensä: 2
viite: 2 / 2
« edellinen | seuraava »
| Tekijä: | Bagchi, U. Sullivan, R. S. Chang, Y. L. |
| Otsikko: | Minimizing mean squared deviation of competition times about a common due date. |
| Lehti: | Management Science
1987 : JUL, VOL. 33:7, p. 894-906 |
| Asiasana: | PRODUCTION SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | A nonpreemptive single machine scheduling problem is addressed where all jobs have a common due date and have zero ready time. The scheduling objective is to minimize mean squared deviation /MSD/ of job completion times about due date. A special case of MSD problem referred to as unconstrained MSD problem, is shown to be equivalent to the completion time variance problem. Strong results for the latter problem are combined with several new propositions to develop a reasonable efficient procedure for solving the unconstrained MSD problem. |
« edellinen | seuraava »
SCIMA