haku: @indexterm Scheduling / yhteensä: 635
viite: 265 / 635
| Tekijä: | Wagneur, E. Sriskandarajah, C. |
| Otsikko: | Openshops with jobs overlap |
| Lehti: | European Journal of Operational Research
1993 : OCT 24, VOL. 71:3, p. 366-378 |
| Asiasana: | SCHEDULING OPERATIONAL RESEARCH PERFORMANCE MEASUREMENT |
| Kieli: | eng |
| Tiivistelmä: | The authors consider the complexity status of scheduling "n" jobs in an openshop with "m" machines, when overlapping of jobs is permitted, for some classical objective functions. In particular the authors show that optimal schedules for a regular performance measure are permutations schedules. Then they prove that the maximum completion time and the maximum tardiness are polynomial, that the number of late jobs problem is binary NP-hard in the two-machine case. They also give polynomial time algorithms, or heuristic algorithms, for all the problems considered. |
SCIMA