Abstract
Abstract Suppose the number of jobs which can be stored in front of the machines in a job shop is limited. As a result, arriving jobs for which there is no space in the shop will form a shop queue. The production capacity or maximum departure rate of jobs from the shop will depend on the way in which jobs are selected from the shop queue for release to the machine queues. For a job shop with two identical machines and random routing of jobs a number of release rules are compared. It is shown that the production capacity is increased when the number of jobs in the shop is kept less than the available storage space. Among release rules independent'of job processing times and number of operations the optimum release rule is shown, using dynamic programming, to be the idle machine rule, i.e. only release a job to the shop when a machine would otherwise be idle.
Published Version
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