Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Priority-dispatching rules have been studied for many decades, and they form the backbone of much industrial scheduling practice. Developing new dispatching rules for a given environment, however, is usually a tedious process involving implementing different rules in a simulation model of the facility under study and evaluating the rule through extensive simulation experiments. In this research, an innovative approach is presented, which is capable of automatically discovering effective dispatching rules. This is a significant step beyond current applications of artificial intelligence to production scheduling, which are mainly based on learning to select a given rule from among a number of candidates rather than identifying new and potentially more effective rules. The proposed approach is evaluated in a variety of single machine environments, and discovers rules that are competitive with those in the literature, which are the results of decades of research.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Aho, A. V., R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques and Tools, Addison-Wesley Publishing Company, Reading, MA (1986).

    Google Scholar 

  • AutoSimulations, Inc., AutoSched AP User's Manual (1998).

  • Avramidis, A. N., K. J. Healy, and R. Uzsoy, “Control of a Batch-Processing Machine: A Computational Approach,” International Journal of Production Research, 36, 3167–3181 (1998).

    Google Scholar 

  • Bäck, T. and H.-P. Schwefel, “An Overview of Evolutionary Algorithms for Parameter Optimization,” Evolutionary Computation, 1, 1–23 (1993).

    Google Scholar 

  • Bäck, T. and H.-P. Schwefel, “Evolutionary computation: An Overview,” Proceedings of the IEEE Conference on Evolutionary Computation, 20–29 (1996).

  • Bäck, T., F. Hoffmeister, and H.-P. Schwefel, “A Survey of Evolution Strategies,” in Belew, R. K. (ed.), Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufman, San Mateo, CA, 1991.

    Google Scholar 

  • Bagchi, T. P., Multiobjective Scheduling by Genetic Algorithms, Kluwer Academic Publishers, Boston, MA (1991).

    Google Scholar 

  • Baker, K. R. and J. W. M. Bertrand, “A Dynamic Priority Rule for Scheduling against Due Dates,” Journal of Operations Management, 3, 37–42 (1982).

    Article  Google Scholar 

  • Banzhaf, W., P. Nordin, R. E. Keller, and F. D. Francone, Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and Its Applications, Morgan Kaufman, San Francisco, CA, 1998.

    Google Scholar 

  • Bhaskaran, K. and M. Pinedo, Dispatching, in Salvendy, G. (ed.), Handbook of Industrial Engineering, John Wiley and Sons, New York, NY, 1992 pp. 2184–2198.

    Google Scholar 

  • Blackstone, J. H., 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, 27–45 (1982).

    Google Scholar 

  • Blazewicz, J., K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer-Verlag, Heidelberg, Germany, 1996.

    Google Scholar 

  • Carlier, J. and E. Pinson, “An Algorithm for Solving the Job-Shop Problem,” Management Science, 35, 164–176 (1988).

    Google Scholar 

  • Chang, Y.-L., T. Sueyoshi, and R. S. Sullivan, “Ranking Dispatching Rules by Data Envelopment Analysis in a Job Shop Environment,” IIE Transactions, 28, 631–642 (1996).

    Google Scholar 

  • Cheng, R., M. Gen, and Y. Tsujimura, “A Tutorial Survey of Job-Shop Scheduling Problems Using Genetic Algorithms: Part II. Hybrid Genetic Search Strategies,” Computers and Industrial Engineering, 39, 51–55 (1999).

    Google Scholar 

  • Chiu, C. and Y. Yih, “A Learning-Based Methodology for Dynamic Scheduling in Distributed Manufacturing Systems,” International Journal of Production Research, 33, 3217–3232 (1995).

    Google Scholar 

  • Cramer, N. L., “A Representation for the Adaptive Generation of Simple Sequential Programs,” in Grefenstette, J.J., ed., Proceedings of the First International Conference on Genetic Algorithms and Their Applications, 183–187, Lawrence Erlbaum Associates, Hillsdale, NJ (1985).

    Google Scholar 

  • Davis, L., (ed.), Handbook on Genetic Algorithms, Van Nostrand Reinhold, New York, NY, 1991.

    Google Scholar 

  • De Jong, K. A., “On Using Genetic Algorithms to Search Program Spaces,” in J. J. Grefenstette (ed.), Proceedings of the Second International Conference on Genetic Algorithms and Their Applications, Lawrence Erlbaum Associates, Hillsdale, NJ, pp. 1987).

    Google Scholar 

  • De Jong, K. A., “Learning with Genetic Algorithms: An Overview,” Machine Learning, 3, 121–138 (1988).

    Article  Google Scholar 

  • Della Croce, F., R. Tadei, and G. Volta, “A Genetic Algorithm for the Job Shop Scheduling Problem,” Computers and Operations Research, 22, 15–24 (1995).

    Article  Google Scholar 

  • Dimopoulos, C. and A. M. S. Zalzala, “Genetic Programming Heuristic for the One-Machine Total Tardiness Problem,” in Proceedings of the 1999 Congress on Evolutionary Computation (CEC ′99), 1999 pp. 2207–2214.

  • Dorndorf, U. and E. Pesch, “Evolution Based Learning in a Job Shop Scheduling Environment,” Computers and Operations Research, 22, 25–40 (1995).

    Article  Google Scholar 

  • ElMaraghy, H., V. Patel, and I. Ben Abdallah, “Scheduling of Manufacturing Systems under Dual-Resource Constraints Using Genetic Algorithms,” Journal of Manufacturing Systems, 19, 186–201 (2000).

    Google Scholar 

  • Fowler, J. W., D. T. Phillips, and G. L. Hogg, “Real-Time Control of Multiproduct Bulk–Service Semiconductor Manufacturing Processes,” IEEE Transactions on Semiconductor Manufacturing, 5, 158–163 (1992).

    Article  Google Scholar 

  • Gere, Jr., W. S., “Heuristics in job shop scheduling,” Management Science, 13, 167–190 (1966).

    Google Scholar 

  • Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

  • Grefenstette, J. J., “Optimization of Control Parameters for Genetic Algorithms,” IEEE Transactions on Systems, Man and Cybernetics, 16, 122–128 (1986).

    Google Scholar 

  • Haupt, R., “A Survey of Priority Rule-Based Scheduling,” OR Spektrum, 11, 3–16 (1989).

    Article  Google Scholar 

  • Holland, J. H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.

    Google Scholar 

  • Holland, J. H., “Escaping brittleness: The Possibilities of General-Purpose Learning Algorithms Applied to Parallel Rule–Based Systems,” Machine Learning: An Artificial Intelligence Approach, 2, 48–78 (1986).

    Google Scholar 

  • Holland, J. H. and J. S. Reitman, “Cognitive Systems Based on Adaptive Algorithms,” in Waterman, D.A. and Hayes-Roth, F. (eds.), Pattern-Directed Inference Systems, Academic Press, New York, NY, 1978, 313–329.

    Google Scholar 

  • Hopp, W. J. and M. L. Spearman, Factory Physics, 2nd Ed., McGraw-Hill, New York, NY (2000).

    Google Scholar 

  • Ikura, Y. and M. Gimple, “Scheduling Algorithms for a Single Batch Processing Machine,” Operations Research Letters, 5, 61–65 (1986).

    Article  Google Scholar 

  • Jackson, J. R., Scheduling a Production Line to Minimize Maximum Tardiness, Research Report 43, Management Science Research Project, University of California at Los Angeles, Los Angeles, CA (1955).

  • Johnson, S. M., “Optimal Two- and Three-Stage Production Schedules with Setup Times Included,” Naval Research Logistics Quarterly, 1, 61–68, (1954).

    Google Scholar 

  • Kelton, W. D., R. P. Sadowski, and D. A. Sadowski, Simulation with Arena, 2nd Ed., McGraw Hill, New York, NY, 2001.

    Google Scholar 

  • Khuri, S., T. Bäck, and J Heitkötter, “An Evolutionary Approach to Combinatorial Optimization Problems,” in Proceedings of the 22nd Annual ACM Computer Science Conference, (1994).

  • Koza, J. R., “Hierarchical Genetic Algorithms Operating on Populations of Computer Programs,” in Proceedings of the 11th International Joint Conference on Artificial Intelligence, 1, Morgan Kaufman, San Mateo, CA, 1989, pp. 768–774.

    Google Scholar 

  • Koza, J. R., Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  • Lee, C.-Y., S. Piramuthu, and Y.-K. Tsai, “Job Shop Scheduling with a Genetic Algorithm and Machine Learning,” International Journal of Production Research, 35, 1171–1191 (1997).

    Google Scholar 

  • Mattfeld, D. C., Evolutionary Search and the Job Shop: Investigations on Genetic Algorithms for Production Scheduling, Physica-Verlag, Heidelberg, Germany, 1996.

    Google Scholar 

  • Mehta, S. V. and R. Uzsoy, “Minimizing Total Tardiness on a Batch Processing Machine with Incompatible Job Families,” IIE Transactions, 30, 165–178 (1998).

    Article  Google Scholar 

  • Michalewicz, Z. and D. Fogel, How to Solve It: Modern Heuristics, Springer-Verlag, Germany, 2000.

    Google Scholar 

  • Morton, T. E. and D. W. Pentico, Heuristic Scheduling Systems, John Wiley and Sons, New York, NY, 1993.

    Google Scholar 

  • Norman, B. and J. Bean, “A Genetic Algorithm Methodology for Complex Scheduling Problems,” Naval Research Logistics, 46, 199–211, (1999).

    Article  Google Scholar 

  • Norman, B. and J. Bean, “Random Keys Genetic Algorithm for Job Shop Scheduling,” Engineering Design and Automation, 3,145–156, (1997).

    Google Scholar 

  • Olafsson, S., “Data Mining for Production Scheduling,” in Proceedings of the Industrial Engineering Research Conference (IERC'03), CD-ROM, (2003).

  • Ovacik, I. M. and R. M. Uzsoy, “Exploiting Shop Floor Status Information to Schedule Complex Job Shops,” Journal of Manufacturing Systems, 13, 73–84 (1994).

    Article  Google Scholar 

  • Ovacik, I. M. and R. Uzsoy, Decomposition Methods for Complex Factory Scheduling Problems, Kluwer Academic Publishers, Boston, MA (1997).

    Google Scholar 

  • Panwalkar, S. S. and W. Iskander, “A Survey of Scheduling Rules,” Operations Research, 25, 45–61, 1977.

    Google Scholar 

  • Pierreval, H. and N. Mebarki, “Dynamic Selection of Dispatching Rules for Manufacturing System Scheduling,” International Journal of Production Research, 35, 1575–1591, 1997.

    Google Scholar 

  • Pinedo, M., Scheduling: Theory, Algorithms and Systems, Prentice Hall, Englewood Cliffs, NJ (2002).

    Google Scholar 

  • Piramuthu, S., N. Raman, and M. J. Shaw, “Learning-Based Scheduling in a Flexible Manufacturing Flow Line,” IEEE Transactions on Engineering Management, 41, 172–182, 1994.

    Article  Google Scholar 

  • Pritsker, A. A. B., J. J. O'Reilly, and D. K LaVal, Simulation with Visual SLAM and Awesim, John Wiley and Sons, New York, NY, 1997.

    Google Scholar 

  • Reeves, C. R. (ed.), Modern Heuristic Techniques for Combinatorial Problems, John Wiley and Sons, New York, NY, 1993.

    Google Scholar 

  • Russell, R. S., E. M. Dar-El, and B. W. Taylor, III, “A Comparative Analysis of the COVERT Job Sequencing Rule Using Various Shop Performance Measures,” International Journal of Production Research, 25, 1523–1540 (1987)

    Google Scholar 

  • Russell, S. J. and P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, Upper Saddle River, NJ(1995).

    Google Scholar 

  • Schragenheim, E. and B. Ronen, “Drum-Buffer-Rope Shop Floor Control,” Production and Inventory Management, 31, 18–23 (1990).

    Google Scholar 

  • Shaw, M. J., S. Park, and N. Raman, “Intelligent Scheduling with Machine Learning Capabilities: The Induction of Scheduling Knowledge,” IIE Transactions, 24, 156–168 (1992).

    Google Scholar 

  • Smith, W. E., “Various Optimizers for Single-Stage Production,” Naval Research Logistics Quarterly, 3, 59–66 (1956).

    Google Scholar 

  • Storer, R. H., S. D. Wu, and I. Park, “Genetic Algorithms in Problem Space for Sequencing Problems,” in Proceedings of a Joint US-German Conference on Operations Research in Production Planning and Control, 584–597, (1992).

  • Storer, R. H., S. D. Wu, and R. Vaccari, “New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling,” Management Science, 38, 1495–1509, (1992).

    Google Scholar 

  • Uzsoy, R. “Scheduling Batch Processing Machines with Incompatible Job Families,” International Journal of Production Research, 33, 2685–2708 (1995).

    Google Scholar 

  • Vepsalainen, A. P. J. and T. E. Morton, “Priority Rules for Job Shops with Weighted Tardiness Costs,” Management Science, 33, 1035–1047 (1987).

    Google Scholar 

  • Webster, S. and K. R. Baker, “Scheduling Groups of Jobs on a Single Machine,” Operations Research, 43, 692–703 (1995).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management Systems, University of Central Florida, 4000 Central Florida Blvd, Orlando, FL, 32816, USA

    Christopher D. Geiger

  2. Laboratory for Extended Enterprises at Purdue, School of Industrial Engineering, 1287 Grissom Hall, Purdue University, West Lafayette, IN, 47907, USA

    Reha Uzsoy

  3. Department of Decision and Information Sciences, Warrington College of Business, University of Florida, P.O. Box 117169, Gainesville, FL, 32611, USA

    Haldun Aytuğ

Authors
  1. Christopher D. Geiger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reha Uzsoy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haldun Aytuğ
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christopher D. Geiger.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Geiger, C.D., Uzsoy, R. & Aytuğ, H. Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach. J Sched 9, 7–34 (2006). https://doi.org/10.1007/s10951-006-5591-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-006-5591-8

Keywords

Search

Navigation