haku: @indexterm Scheduling / yhteensä: 635
viite: 279 / 635
| Tekijä: | Brucker, P. Jurisch, B. |
| Otsikko: | A new lower bound for the job-shop scheduling problem |
| Lehti: | European Journal of Operational Research
1993 : JAN 22, VOL. 64:2, p. 156-167 |
| Asiasana: | SCHEDULING JOB-SHOP SCHEDULING RESEARCH |
| Kieli: | eng |
| Tiivistelmä: | A new lower bound for the job-shop scheduling problem is developed. This lower bound is based on a two-job relaxation which can be solved efficiently by using geometric methods. Computational experiments show that the new lower bound improves the classical lower bound if the ratio between the number of machines and the number of the jobs is large. It is possible to generalize the job-shop problem by introducing multi-purpose machines. In such a situation each operation can be processed at one machine taken from a set of machines associated with the operation. |
SCIMA