haku: @freeterm NETZPLANTECHNIK / yhteensä: 6
viite: 4 / 6
| Tekijä: | Paik, C. H. Tcha, D. W. |
| Otsikko: | Throughput equivalencies in fork/join queuing networks with finite buffers and general service times |
| Lehti: | International Journal of Production Research
1995 : MAR, VOL. 33:3, p. 695-703 |
| Asiasana: | |
| Vapaa asiasana: | FERTIGUNGSSTEUERUNG, FERTIGUNGSPROGRAMMPLANUNG, NETZPLANTECHNIK |
| Kieli: | eng |
| Tiivistelmä: | In a manufacturing system, units may be built by assembling multiple subunits and a unit may be disintegrated into subunits for the required operation. Also in a parallel processing system, forking occurs when a job (program) is split into tasks (subprograms) that can be concurrently run on different processors. Joining occurs whenever a job is executed only after the completion of other tasks. This paper investigates the throughput behaviour of a fork/join queuing network with finite buffers where the service times are random variables. |
SCIMA