Abstract
Abstract 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.