《1997 New dispatching rules for scheduling in a job shop — An experimental study》.pdf

Int J Adv Manuf Technol (1997) 13:148-153 ]~e International Journal of © 1997 Springer-Verlag London Limited Advanced manufacturing Technoloou New Dispatching Rules for Scheduling in a Job Shop - An Experimental Study Oliver Holthaus* and Chandrasekharan Rajendrant *Faculty of Business Administration and Economics, Department of Production Management, University of Passau, Passau, Germany; tIndustrial Engineering and Management Division, Department of Humanities and Social Sciences, Indian Institute of Technology, Madras, India We present two new dispatching rules for scheduling in a job A variety of analytical models and optimisation algorithms shop. These rules combine the process-time and work-content have been developed for solving static and dynamic determin- in the queue for the next operation on a job, by making use of istic problems [1-5]. In theory, it is possible to determine additive and alternative approaches. An extensive and rigorous optimal schedules for static or dynamic deterministic scheduling simulation study has been carried out to evaluate the perform- problems. In practice, the computation of optimal solutions is ance of the proposed dispat