haku: @author de, / yhteensä: 29
viite: 20 / 29
| Tekijä: | De, P. Wells, C. E. |
| Otsikko: | On the multiple-machine extension to a common due-date assignment and scheduling problem |
| Lehti: | Journal of the Operational Research Society
1991 : MAY, VOL. 42:5, p. 419-422 |
| Asiasana: | PRODUCTION SCHEDULING PROBLEM SOLVING OPTIMIZATION OPERATIONAL RESEARCH |
| Kieli: | eng |
| Tiivistelmä: | The multi-machine extension to a due-date assignment and scheduling problem has been considered by Cheng. However, he implicitly assumes zero start times for all schedules /which does not ensure optimality/, and overlooks the critical V-shape for an optimal schedule /which leads to the overestimation of the effort needed to solve the problem/. In this note some flaws of the work by Cheng are corrected. It is shown that consideration of non-zero start times is essential for generating an optimal schedule. The V-shape property which significantly reduces the search for an optimal solution is also discussed. |
SCIMA