haku: @indexterm Scheduling / yhteensä: 635
viite: 276 / 635
| Tekijä: | Taillard, E. |
| Otsikko: | Benchmarks for basic scheduling problems |
| Lehti: | European Journal of Operational Research
1993 : JAN 22, VOL. 64:2, p. 278-284 |
| Asiasana: | COMBINATIONAL OPTIMIZATION SCHEDULING MATHEMATICS |
| Kieli: | eng |
| Tiivistelmä: | In this paper, the author proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems proposed are: the permutation flow shop, the job shop and the open shop scheduling problems. The author restricts himself to basic problems: the processing times are fixed, there are neither set-up times nor due rates nor release dates, etc. Then, the objective is the minimization of the makespan. |
SCIMA