Abstract

An open queueing network model of dynamic job shops with general service times and first come first served or shortest processing time service discipline is considered here. An approximate decomposition approach is proposed to analyse this queueing network model and its accuracy is compared to simulation results of some symmetric and flow shops.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.