Abstract
SUMMARY In this paper we consider a single server queueing model for a single machine dynamic job shop in which shop level scheduling is not permitted. External arrivals of jobs are received in a dispatch area from which their release to the job shop is controlled. To overcome the limitation of operational control, we propose three different dispatch policies and compare their performances to that of a first come first served dispatch policy. The four dispatch policies considered are (1) first come first served, (2) scheduling within generations, (3) scheduling within periodic review, and (4) scheduling within fixed batch sizes.
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 callDisclaimer: 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.
