Abstract
We present two new dispatching rules for scheduling in a job shop. These rules combine the process-time and work-content in the queue for the next operation on a job, by making use of additive and alternative approaches. An extensive and rigorous simulation study has been carried out to evaluate the performance of the proposed dispatching rules compared with those by the SPT rule, the WINQ rule, a random rule based on the SPT and WINQ rules, and the best existing rule. The important aspects of the results of the experimental investigation are also discussed in detail.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. R. Baker,Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, “Recent developments in deterministic sequencing and scheduling: a survey”, in M. A. H. Dempster, J. K. Lenstra, A. H. G. Rinnooy Kan, (ed.),Deterministic and Stochastic Scheduling, Reidel, Dordrecht, pp. 35–73, 1982.
E. L. Lawler, “Recent results in the theory of machine scheduling”, in A. Bachem, M. Grötschel and B. Korte, (ed.),Mathematical Programming: The State of the Art, Springer, Berlin, pp. 202–234, 1983.
J. Blazewicz, K. Ecker, G. Schmidt and J. Weglarz,Scheduling in Computer and Manufacturing Systems, 2nd edn, Springer, Berlin, 1994.
P. Brucker,Scheduling Algorithms, Springer, Berlin, 1995.
A. H. G. Rinnooy Kan,Machine Scheduling Problems, Martinus Nijhoff, The Hague, 1976.
P. Brucker, B. Jurisch and B. Sievers, “A branch & bound algorithm for the job-shop problem”,Discrete Applied Mathematics,49, pp. 107–127, 1994.
J. Adams, E. Balas and D. Zawack, “The shifting bottleneck procedure for job shop scheduling”,Management Science,34, pp. 391–401, 1988.
E. Balas, J. K. Lenstra and A. Vazacopoulos, “The one-machine problem with delayed precedence constraints and its use in job shop scheduling”,Management Science,41, pp. 94–109, 1995.
P. J. M. Van Laarhoven, E. H. L. Aarts and J. K. Lenstra, “Job shop scheduling by simulated annealing”,Operations Research,40, pp. 113–125, 1992.
M. Dell'Amico and M. Trubian, “Applying tabu search to the job-shop scheduling problem”,Annals of Operations Research,41, pp 231–252, 1993.
C. Bierwirth, “A generalized permutation approach to job shop scheduling with genetic algorithms”,OR Spektrum,17, pp. 87–92, 1995.
U. Dorndorf and E. Pesch, “Evolution based learning in a job shop scheduling environment”,Computers and Operations Research,22, pp. 25–40, 1995.
E. H. L. Aarts, P. J. M. Van Laarhoven, J. K. Lenstra and N. L. J. Ulder, “A computational study of local search algorithms for job shop scheduling”,ORSA Journal on Computing,6, pp. 118–125, 1994.
J. H. Blackstone, D. T. Phillips and G. L. Hogg, “A state-of-the-art survey of dispatching rules for manufacturing job shop operations”,International Journal of Production Research,20, pp. 27–45, 1982.
R. Haupt, “A survey of priority rule-based scheduling”,OR Spektrum,11, pp. 3–16, 1989.
R. Ramasesh, “Dynamic job shop scheduling: A survey of simulation research”,OMEGA,18, pp. 43–57, 1990.
R. W. Conway, “Priority dispatching and job lateness in a job shop”,Journal of Industrial Engineering,16, pp. 228–237, 1965.
R. Rochette and R. P. Sadowski, “A statistical comparison of the performance of simple dispatching rules for a particular set of job shops”,International Journal of Production Research,14, pp. 63–75, 1976.
P. J. O'Grady and C. Harrison, “A general search sequencing rule for job shop sequencing”,International Journal of Production Research,23, pp. 961–973, 1985.
K. R. Baker and J.J. Kanet, “Job shop scheduling with modified due dates”,Journal of Operations Management,4, pp. 11–22, 1983.
A. P. J. Vepsalainen and T. E. Morton, “Priority rules for job shops with weighted tardiness costs”,Management Science,33, pp. 1035–1047, 1987.
E. J. Anderson and J. C. Nyirendra, “Two new rules to minimize tardiness in a job shop”,International Journal of Production Research,28, 2277–2292, 1990.
T. S. Raghu and C. Rajendran, “An efficient dynamic dispatching rule for scheduling in a job shop”,International Journal of Production Economics,32, pp. 301–313, 1993.
R. W. Conway, B. M. Johnson and W. L. Maxwell, “An experimental investigation of priority dispatching”,Journal of Industrial Engineering,11, 221–230, 1960.
A. M. Law and W. D. Kelton, “Confidence intervals for steady state simulation: I. A survey of fixed sample size procedures”,Operations Research,32, pp. 1221–1239, 1984.
G. S. Fishman, “Estimating sample size in computing simulation experiments”,Management Science,18, pp. 21–38, 1971.
D. C. Montgomery,Design and Analysis of Experiments, John Wiley & Sons, New York, 1991.
T. J. Lorenzen and V. L. Anderson,Design of Experiments: A No-Name Approach, Marcel Dekker, New York, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Holthaus, O., Rajendran, C. New dispatching rules for scheduling in a job shop — An experimental study. Int J Adv Manuf Technol 13, 148–153 (1997). https://doi.org/10.1007/BF01225761
Issue Date:
DOI: https://doi.org/10.1007/BF01225761