Approximations for the time spent in a dynamic job shop with applications to due-date assignment
作者:
J.GEORGE SHANTHIKUMAR,
USHIO SUMITA,
期刊:
International Journal of Production Research
(Taylor Available online 1988)
卷期:
Volume 26,
issue 8
页码: 1329-1352
ISSN:0020-7543
年代: 1988
DOI:10.1080/00207548808947949
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
In this paper we develop approximations for the distribution of the total time spent in a dynamic job shop. In particular, using an exponential limit theorem and an heuristic decomposition of open queueing networks, we show that for a large class of dynamic job shops, the total time spent in a dynamic job shop can be approximated by an exponential random variable with an appropriate mean. Approximations for job shops that do not belong to this class are also developed. Numerical results show that the proposed approximations are in general very good. Application of these approximations in the assignment of due-dates is also illustrated.
点击下载:
PDF (648KB)
返 回