《1993 An efficient dynamic dispatching rule for scheduling in a job shop》.pdf

Internationul Journal of Production Economics, 32 (1993) 301- 313 301 Elsevier An efficient dynamic dispatching rule for scheduling in a job shop T.S. Raghu and Chandrasekharan Rajendran Diaision qfIndustrial Engineering and Management, Department qj’ Humanities and Sociul Sciences, Indian Institute of Technology, Mudras 600 036. lndiu (Received 4 January 1993; Accepted in revised form 28 May 1993) Abstract In this paper we present a new dispatchmg rule which is dynamic and global in its structure. The rule adapts itself to the varration in the shop floor utilization level and assigns appropriate weights to the process time and due date information accordingly. Another important feature of the proposed rule is that the weights to the two components, viz. the process time and the due date components, differ from machine to machine. The results of a simulation study are presented to demonstrate the effectiveness of the rule with respect to the rules most commonly used in industry and the proven rules reported in the literature. The proposed rule is found to perform quite well with respect to mean flow time, mean tardiness and variation in tardiness. 1. Introduction load levels [l, 21. Another complication in the use of the dispatching rules is that some of Scheduling in a job shop is an important them are sensitive to the shop floor configur