haku: @author Hall, N. G. / yhteensä: 6
viite: 3 / 6
| Tekijä: | Hall, N. G. Sethi, S. P. Sriskandarajah, C. |
| Otsikko: | On the complexity of generalized due date scheduling problems. |
| Lehti: | European Journal of Operational Research
1991 : MAR 6, VOL. 51:1, p. 100-109 |
| Asiasana: | SCHEDULING FLEXIBLE MANUFACTURING SYSTEMS |
| Kieli: | eng |
| Tiivistelmä: | The recently identified class of generalized due date scheduling problems is studied. These problems are machine scheduling problems for which due dates are specified according to the position in which a job is completed, rather than the identity of that job. Flexible manufacturing environments and public sector planning problems provide applications. A wide variety of these problems is studied, with a view to determining their computational complexity. Several problems are also described, the complexity of which is still unresolved. |
SCIMA