haku: @indexterm Scheduling / yhteensä: 635
viite: 130 / 635
Tekijä: | Hall, N. Posner, M. Potts, C. |
Otsikko: | Scheduling with finite capacity output buffers |
Lehti: | Operations Research
1998 : MAY-JUN, VOL. 46:3, p. S84-S97 |
Asiasana: | OPERATIONAL RESEARCH SCHEDULING MANAGEMENT |
Kieli: | eng |
Tiivistelmä: | In many scheduling problems, a job that completes processing may need to be held in an output buffer until the customer is ready to accept delivery. Buffer capacity is usually assumed to be infinite. The authors study a number of the best known single machine scheduling problems, under several alternative assumptions about the capacity of the output buffer. Specially, the authors allow the buffer capacity to be either zero, fixed, or specified as part of problem input. |
SCIMA