《1997 Efficient dispatching rules for scheduling in a job shop》.pdf

production economics ELSEVIER Int. J. Production Economics 48 (1997) 87-105 Efficient dispatching rules for scheduling in a job shop Oliver Holthaus”, *, Chandrasekharan Rajendranb “Faculty of Business Administration and Economics, Department of Production Management, University of Passau, Dr.-Hans-Kapjinger-Str. 30, 94032 Passau, Germany bIndustrial Engineering and Management Division, Department of Humanities and Social Sciences, Indian Institute of Technology, Madras 600 036, India Accepted 27 June 1996 Abstract We consider in this article the development of new and efficient dispatching rules with respect to the objectives of minimizing mean flowtime, maximum flowtime, variance of flowtime, proportion of tardy jobs, mean tardiness, maximum tardiness and variance of tardiness. We present five new dispatching rules for scheduling in a job shop. Some of these rules make use of the process time and work-content in the queue of the next operation on a job, by following a simple additive approach, in addition to the arrival time and dynamic slack of a job. An extensive and rigorous simulation study has been carried out to evaluate the performance