haku: @author Uzsoy, R. / yhteensä: 5
viite: 3 / 5
| Tekijä: | Uzsoy, R. |
| Otsikko: | Scheduling batch processing machines with incompatible job families (mathematisches Modell) |
| Lehti: | International Journal of Production Research
1995 : OCT, VOL. 33:10, p. 2685-2708 |
| Asiasana: | |
| Vapaa asiasana: | FERTIGUNGSSTEUERUNG, FERTIGUNGSPROGRAMMPLANUNG |
| Kieli: | eng |
| Tiivistelmä: | The problem of scheduling a single batch processing machine with incompatible job families was studied, where jobs of different families cannot be processed together in the same batch. First static problems where all jobs are available simultaneously were considered and showed that for a regular performance measure there will be no unnecessary partial batches. Then problems with dynamic job arrivals were considered. Computational experiments showed that the heuristics developed for the later problem consistently improve on dispatching solution in very reasonable CPU times. |
SCIMA