Skip to main content
SpringerLink
Log in

A Survey of Intelligent Scheduling Systems

  • Chapter
Intelligent Scheduling Systems

Part of the book series: Operations Research / Computer Science Interfaces Series ((ORCS,volume 3))

Abstract

Scheduling involves the effective allocation of resources over time. In this paper, we examine the impact of intelligent systems on production, transportation, and project scheduling. We provide a survey of intelligent scheduling systems based on artificial and computational intelligence techniques. These methods include knowledge-based systems, expert systems, genetic algorithms, simulated annealing, neural networks, and hybrid systems. We also review the basic components of the scheduling problem and describe some potentially promising areas for future research.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Simon, Herbert, A., “Two Heads Are better than One: The Collaboration between AI and OR”, Interfaces,Vol. 17, No. 4, 1987, pp. 8–15.

    Google Scholar 

  2. Spitzer, Murry, “The Computer Art of Schedule-Making”, Datamation, Apr. 1969, pp. 84–86.

    Google Scholar 

  3. McKay, Kenneth N., Frank R. Safayeni, and John A. Buzacott, “Job-Shop Scheduling Theory: What is Relevant?” Interfaces, Vol. 18, No. 4, 1988, pp. 83–90.

    Google Scholar 

  4. Sussams, J., “The Future for Computerized Vehicle-Load Planning Systems”, J. of Opl. Res. Soc., Vol. 35, 1982, pp. 963–966.

    Google Scholar 

  5. Garey, Michael R., and David S. Johnson. Computers and Intractability. W.H. Freeman, 1979.

    Google Scholar 

  6. Lenstra, J.K., and A.H. G. Rinnooy Kan, “Complexity of Vehicle Routing and Scheduling Problems”, Networks, Vol. 11, 1981, pp. 221–227.

    Google Scholar 

  7. Newell, A., and H.A. Simon, “Computer Science as Empirical Inquiry: Symbols and Search”, Comm. of the ACM, Vol. 19, No. 3, 1976, pp. 113–126.

    Google Scholar 

  8. Waterman, Donald A. A Guide to Expert Systems. Addison-Wesley, 1986.

    Google Scholar 

  9. Holland, John H. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975.

    Google Scholar 

  10. Fogel, L.J., A.J. Owens, and M.J. Walsh, Artificial Intelligence Through Simulated Evolution. Wiley, 1966.

    Google Scholar 

  11. Kirkpatrick, S., C. D. Gelatt, Jr., and M. P. Vecchi, “Optimization by Simulated Annealing.”, IBM Computer Science/Engineering Technology Report, IBM Thomas J. Watson Research Center, 1982.

    Google Scholar 

  12. Kirkpatrick, S., C. D. Gelatt, Jr., and M. P. Vecchi, “Optimization by Simulated Annealing”, Science, Vol. 220, 1983, pp. 671–680.

    Google Scholar 

  13. Farlow, S.J. (ed.) Self Organizing Methods in Modeling: GMDH Type Algorithms. Marcel Dekker Inc., 1984.

    Google Scholar 

  14. Nilsson, N.J. Principles of Artificial Intelligence, Morgan Kaufmann, 1980.

    Google Scholar 

  15. Graves, Stephen C., “A Review of Production Scheduling”, Ops. Res., Vol. 29, No. 4, 1981, pp. 646–675.

    Google Scholar 

  16. Hadavi, Khosrow, Wan-Ling Hsu, Tony Chen, and Cheoung-Nam Lee, “An Architecture for Real-Time Distributed Scheduling”, AI Mag., Vol. 13, Fall 1992, pp. 46–56.

    Google Scholar 

  17. Baker, Kenneth R., Introduction to Sequencing and Scheduling. Wiley, 1974.

    Google Scholar 

  18. French, Simon, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop Ellis Horwood Limited, 1982.

    Google Scholar 

  19. Rodammer, F.A., and K.P. White, Jr., “A Recent Survey of Production Scheduling”, IEEE Trans. on Sys., Man, and Cybernetics, Vol. 18, No. 6, 1988, pp. 841–852.

    Google Scholar 

  20. White, K.P., Jr., “Advances in the Theory and Practice of Production Scheduling”, in C.T. Leondes (ed.), Advances in Control and Dynamic Systems,Academic Press, 1990.

    Google Scholar 

  21. Ow, Peng Si, Stephen F. Smith, and Randy Howie, “A Cooperative Scheduling System” in Michael D. Oliff, (ed.) Expert Systems and Intelligent Manufacturing, North-Holland, 1988, pp. 43–56.

    Google Scholar 

  22. Glover, Fred, “TABU Search Part P”, ORSA J. on Comput., Vol. 1, No. 3, 1989, pp. 190–206.

    Google Scholar 

  23. Glover, Fred, “TABU Search Part II”, ORSA J. on Comput., Vol. 2, No. 1, 1990, pp. 4–32.

    Google Scholar 

  24. Glover, Fred, “Heuristics for Integer Programming using Surrogate Constraints”, Dec. Sci., Vol. 18, No. 1, 1977, pp. 156–166.

    Google Scholar 

  25. Widmer, M., “Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach”, J. of Opl. Res. Soc., Vol. 42, No. 1, 1991, pp. 75–82.

    Google Scholar 

  26. Glover, Fred., “Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms)”, Discrete Applied Math. Vol. 49, 1994, pp. 231–255.

    Google Scholar 

  27. Ignizio, J.P., Introduction to Expert Systems. Mcgraw-Hill, 1991.

    Google Scholar 

  28. Blackstone, John H., Don T. Phillips, and Gary L. Hogg, “A State-of-theArt Survey of Dispatching Rules for Manufacturing Job Shop Operations”, Int. J. Prod. Res., Vol. 20, No. 1, 1982, pp. 27–45.

    Google Scholar 

  29. Conway, R. W., and W. L. Maxwell, “Network Dispatching by Shortest Operation Discipline”, Ops. Res., Vol. 10, 1962, p. 51.

    Google Scholar 

  30. Elvers, D. A., “Job Shop Dispatching Rules Using Various Delivery Date Setting Criteria”, Prod. Inventory Mgmt., Vol. 14, 1973, p. 61.

    Google Scholar 

  31. Conway, R. W., “Priority Dispatching and Job Lateness in a Job Shop”, J. Ind. Eng., Vol. 16, 1965, p. 123.

    Google Scholar 

  32. Rochette, R., and R.P. Sadowski, “A Statistical Comparison of the Performance of Simple Dispatching Rules for a Particular Set of Job Shops”, Int. J. of Prod. Res., Vol. 14, 1976, p. 63.

    Google Scholar 

  33. Grant, T.J., “Lessons for O.R. from A.I.: A Scheduling Case Study”, Ops. Res., Vol. 37, No. 1, 1986, pp. 41–57

    Google Scholar 

  34. Pierreval, Henri, and Henri Ralambondrainy, “A Simulation and Learning Technique for Generating Knowledge about Manufacturing Systems Behavior”, J. of Opl. Res. Soc., Vol. 41, No. 6, 1990, pp. 461–474.

    Google Scholar 

  35. Iron Age, “Gulf States Steel Stays on Schedule”, Iron Age, Vol. 8, Aug. 1992, pp. 25–26.

    Google Scholar 

  36. Fox, Mark S., and Stephen F. Smith, “ISIS—A Knowledge-based System for Factory Scheduling,”, Expert Systems, Vol. 1, No. 1, 1984, pp. 25–49.

    Google Scholar 

  37. Ow, Peng SI, and Stephen F. Smith, “Two Design Principles for Knowledge-Based Systems”, Dec. Sci., Vol. 18, Summer 1987, pp. 430–447.

    Google Scholar 

  38. Elleby P., H. E. Fargher, and T. R. Addis, “Reactive Constraint-Based Job-Scheduling” in Michael D. Oliff, (ed.) Expert Systems and Intelligent Manufacturing, North-Holland, 1988, pp. 1–10.

    Google Scholar 

  39. Bensana, E., G. Bel, and D. Dubois, “OPAL: A Multi-Knowledge-Based System for Industrial Job-Shop Scheduling”, Int. J. Prod. Res., Vol. 26, No. 5, 1988, pp. 795–819.

    Google Scholar 

  40. Kusiak, Andrew, “A Knowledge and Optimization-Based Approach to Scheduling in Automated Manufacturing Systems”, in Donald E Brown, and Chelsea C. White, III, (eds) Operations Research and Artificial Intelligence. Kluwer Academic Publishers, 1990, pp. 453–479.

    Google Scholar 

  41. Binbasioglu, M. and M. Jarke, “Knowledge-Based Formulation of Linear Planning Models”, in H.G. Sol, C.A.T. Takkenberg and P.F. DeVries Robbe (eds.) Expert Systems and Artificial Intelligence in Decision Support Systems,1987.

    Google Scholar 

  42. Davis, Lawrence, “A Genetic Algorithm Tutorial”, in Lawrence Davis, (ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.

    Google Scholar 

  43. Goldberg, David E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.

    Google Scholar 

  44. Biegel, John E., and James J. Davern, “Genetic Algorithms and Job Shop Scheduling”, Computers & Ind. Eng., Vol. 19, No. 1–4, 1990, pp. 81–91.

    Google Scholar 

  45. Gupta, Mahesh, Yash Gupta, and Anup Kumar, “Minimizing Flow time Variance in a Single Machine System using Genetic Algorithms”, European J. Ops. Res., Vol. 70, No. 3, 1993, pp. 289–303.

    Google Scholar 

  46. Whitley, Darrell, Timothy Starkweather, and Daniel Shaner, “The Traveling Salesman and Sequence Scheduling: Quality Solutions using Genetic Edge Recombination”, in Lawrence Davis, (ed), Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991, pp. 350–371.

    Google Scholar 

  47. Syswerda, Gilbert, “Schedule Optimization Using Genetic Algorithms”, in Lawrence Davis, (ed), Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991, pp. 332–349.

    Google Scholar 

  48. Uckun, Serdar, Sugato Bagchi, Kazuhiko Kawamura, and Yutaka Miyabe, “Managing Genetic Search in Job Shop Scheduling”, IEEE Expert, Oct. 1993, pp. 15–24.

    Google Scholar 

  49. Cartwright, Hugh M., and Robert A, Long, “Simultaneous Optimization of Chemical Flowshop Sequencing and Topology Using Genetic Algorithms”, Ind. Eng. Chem. Res., Vol. 32, 1993, pp. 2706–2713.

    Google Scholar 

  50. Aarts, E. and J. Korst, Simulated Annealing and Boltzmann Machines, Wiley, 1989.

    Google Scholar 

  51. Aarts, E. and P.J.M. Var Larhoven, Simulated Annealing: Theory and Applications. Kluwer Academic, 1988.

    Google Scholar 

  52. Musser, K.L., J.S. Dhingra, and G.L. Blakenship, “Optimization Based Job Scheduling”, IEEE Trans. on Automatic Control, Vol. 38, No. 5, May 1993, 808–813.

    Google Scholar 

  53. Van Laarhoven, Peter J., Emile H. Aarts, and Jan Karel Lenstra, “Job Shop Scheduling by Simulated Annealing”, Ops. Res., Vol. 40, No. 1, 1992, pp. 113–125.

    Google Scholar 

  54. Ogbu, F.A., and D.K. Smith, “The Application of the Simulated Annealing Algorithm to the Solution of the n/m/C Max Flowhop Problem”, Computers & Ops. Res., Vol. 17, No. 3, 1990, pp. 243–253.

    Google Scholar 

  55. Abramson, David, “A Very High Speed Architecture for Simulated Annealing”, Computer, May 1992, pp. 27–36

    Google Scholar 

  56. Abramson, D, “Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms”, Mgmt. Sci., Vol. 37, No. 1, 1991, pp. 98–113.

    Google Scholar 

  57. Mittenthal, John, Madabhushi Raghavachari, and Arif Rana, “A Hybrid Simulated Annealing Approach for Single Machine Scheduling Problems with Non-Regular Penalty Functions”, Computers Ops. Res., Vol. 20, No. 2, 1993, pp. 103–111.

    Google Scholar 

  58. Vakharia, Asoo J., and Yih-Long Chang, “A Simulated Annealing Approach to Scheduling a Manufacturing Cell”, Naval Res. Logistics, Vol. 37, 1990, pp. 559–577.

    Google Scholar 

  59. Burbidge, J.L., The Introduction of Group Technology, Wiley, 1975.

    Google Scholar 

  60. Campbell, H.G., R.A. Dudek, and M.L. Smith, “A Heuristic Algorithm for the n Job, m Shop Sequencing Problem”, Mgmt. Sci.,Vol. 16, No. 10, 1970, pp. 630–637.

    Google Scholar 

  61. Nawaz, M, E. Enscore, and I. Ham, “A Heuristic Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem”, OMEGA, Vol. 11, No. 1, 1983, pp. 91–95.

    Google Scholar 

  62. Brusco, Michael J., and Larry W. Jacobs, “A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems”, J. of Opl. Res. Soc., Vol. 44, No. 12, 1993, 1191–1199.

    Google Scholar 

  63. Bechtold, S., M. Brusco, and M. Showater, “A Comparative Evaluation of Labor Tour Scheduling” Dec. Sci., Vol. 23, pp. 683–699.

    Google Scholar 

  64. Wasserman, Philip D., Neural Computing: Theory and Practice. Van Nostrand Reinhold, 1989.

    Google Scholar 

  65. Hecht-Nielsen, Robert, Neurocomputing. Addison-Wesley, 1991.

    Google Scholar 

  66. Zhou, D.N., V. Cherkassky, T.R. Baldwin, and D.E. Olson, “A Neural Network Approach to Job-Shop Scheduling”, IEEE Trans. on Neural Networks, Vol. 2, No. 1, Jan. 1991, pp. 175–179.

    Google Scholar 

  67. Vaithyanthan, Shivakumar, and James P. Ignizio, “A Stochastic Network for Resource Constrained Scheduling”, Computers Ops. Res., Vol. 19, No. 3/4, 1992, pp. 241–254.

    Google Scholar 

  68. Satake, T., K. Morikawa, and N. Nakamura, “Neural-Network Approach for Minimizing the Makespan of the General Job-Shop”, I. J. Prod. Econ., Vol. 33, 1994, pp. 67–74.

    Google Scholar 

  69. Liao, T., “Design of Line-Type Cellular Manufacturing Systems for Minimum Operating and Material-Handling Costs”, Int. J. Prod. Res., Vol. 32, No. 2, 1994, pp. 387–397.

    Google Scholar 

  70. Aoki, Kenichi, Masakazu Kanezashi, Masaru Itoh, and Haruki Matsuura, “Power Generation Scheduling by Neural Networks”, Int. J. Systems Sci., Vol. 23, No. 11, 1992, pp. 1977–1989.

    Google Scholar 

  71. Willems, T., and J. Rooda, “Neural Networks for Job-Shop Scheduling”, Control Eng. Practice, Vol. 2, No. 1, 1994, pp. 31–39.

    Google Scholar 

  72. Chryssolouris, G., M. Lee, J. Pierce, and M. Domroese, “Use of Neural Networks for the Design of Manufacturing Systems”, Manufacturing Res., Vol. 3, No. 3, Sept. 1990, pp. 87–194.

    Google Scholar 

  73. Liang, Ting-Peng, Herbert Moskowitz, and Yuehwern Yih, “Integrating Neural Networks and Semi-Markov Processes for Automated Knowledge Acquisition: An Application to Real-time Scheduling”, Dec. Sci., Vol. 23, No. 6, 1992, pp. 1297–1314.

    Google Scholar 

  74. Dagli, Cihan and Sinchai Sittisathanchai, “Genetic Neuro-Scheduler for Job Shop Scheduling”, Computers and Ind. Eng., Vol. 25, No. 1–4, 1993, pp. 267–270.

    Google Scholar 

  75. Toure, Serge, Luis Rabelo, and Tomas Velasco, “Artificial Neural Networks for Flexible Manufacturing Systems Scheduling”, Computers and Ind. Eng., Vol. 25, No. 1–4, 1993, pp. 385–388.

    Google Scholar 

  76. Lawler, Eugene L. (ed.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, 1990.

    Google Scholar 

  77. Bodin, L., B. Golden, A. Assad, and M. Ball, “Routing and Scheduling of Vehicles and Crews — The State of the Art”, Computers and Ops. Res., Vol. 10, No. 2, 1983, pp. 62–211.

    Google Scholar 

  78. Bodin, L., and B. Golden, “Classification in Vehicle Routing and Scheduling”, Networks, Vol. 11, 1981, pp. 97–108.

    Google Scholar 

  79. Baker, Edward K., “An Exact Algorithm of the Time Constrained Traveling Salesman Problem”, Ops. Res., Vol. 31, 1993, pp. 938–945.

    Google Scholar 

  80. Dell’Amico, M., M. Fischetti, and P. Toth, “Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem”, Mgmt. Sci.,,Vol. 39, No. 1, 1993, pp. 115–125.

    Google Scholar 

  81. Stewart, W., and B. Golden, “A Vehicle Routing Algorithm Based on Generalized Lagrange Multipliers”, Procc. of the AIDS 1979 Annual Cony, IL. More. E. Moore, B. Taylor (eds.), New Orleans, LA., 1979, pp. 108–110.

    Google Scholar 

  82. Bertossi, A., P. Carraresi, and G. Gallo, “On Some Matching Problems Arising in Vehicle Scheduling Models”, Networks, Vol. 17, 1987, pp. 271–281.

    Google Scholar 

  83. Christofides, N. and S. Eilon, “An Algorithm for the Vehicle-dispatching Problem”, Ops. Res. Qtrly., Vol. 2. No. 3, 1969, pp. 3309–318.

    Google Scholar 

  84. Waters, C.D.J., “A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement”, J. of Opl. Res. Soc., Vol. 38, No. 8, 1987, pp. 833–839.

    Google Scholar 

  85. Fahrion, R., and M. Wrede, “On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)”, J. of Opl. Res. Soc., Vol. 41, No. 9, 1990, pp. 821–827.

    Google Scholar 

  86. Clarke, G., and J. M. Wright, “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points”, Ops. Res., Vol. 12, No. 4, 1964, pp. 568–580.

    Google Scholar 

  87. Ahn, B., and J. Shin, “Vehicle-routeing with Time Windows and Time-varying Congestion”, J. of Opl. Res. Soc., Vol. 42, No. 5, 1991, pp. 393–400.

    Google Scholar 

  88. Wren, A, and A. Holliday, “Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points”, Ops. Res. Qtrly., Vol. 23. No. 3, 1969, pp. 333–344.

    Google Scholar 

  89. Gillet, B., and L. Miller, “A Heuristic Algorithm for the Vehicle Dispatch Problem”, Ops. Res., Vol. 22, 1974, 340–349.

    Google Scholar 

  90. Newton, R., and W. Thomas, “Bus Routing in a Multi-School System”, Computers Ops. Res., Vol. 1, 1974, pp. 213–222.

    Google Scholar 

  91. Beasley, J.E., “Route First-Cluster Second Methods for Vehicle Routing”, OMEGA, Vol. 11, No. 4, 1983, pp. 403–408.

    Google Scholar 

  92. Krolak, P., W. Felts, and G. Marble, “A Man-Machine Approach toward Solving the Traveling Salesman Problem”, Comm. ACM, Vol. 14, 1971, pp. 327–334.

    Google Scholar 

  93. Cullen, F.H., J.J. Jarvis, and H.D. Ratliff, “Set Partitioning Based Heuristic for Interactive Routing”, Networks, Vol. 11, 1981, pp. 125–144.

    Google Scholar 

  94. Waters, C. D. J, “Interactive Vehicle Routing”, J. of Opl. Res. Soc., Vol. 35, No. 9, 1984, pp. 821–826.

    Google Scholar 

  95. Brown, G.G., and G. W. Graves, “Real-Time Dispatch of Petroleum Tank Trucks”, Mgmt Sci, Vol. 27, 1981, pp. 19–32.

    Google Scholar 

  96. Heller, Martin, “AI in Practice”, Byte, Vol. 16, Jan.. 1991, pp. 267–269.

    Google Scholar 

  97. Shifrin, Carole A., “Gate Assignment Expert System Reduces Delays at United’s Hubs”, Aviation Week & Space Tech., Vol. 128, Jan. 25, 1988, pp. 149–159.

    Google Scholar 

  98. Pang, Grantham K.H., “Elevator Scheduling System using Blackboard Architecture”, IEEE Proc.-D,Vol. 138, No. 4, July 1991, pp. 337–352.

    Google Scholar 

  99. Potvin, G. Lapalme, and J. Rousseau, “Integration of AI and OR Techniques for Computer-aided Algorithmic Design in the Vehicle Routing Domain”, J. of Opl. Res. Soc., Vol. 41, 1990, pp. 517–522.

    Google Scholar 

  100. Michalewicz, Zbigniew. Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, 1992.

    Google Scholar 

  101. Michalewicz, Zbigniew, and C. Jainkow, “GENOCOP: A Genetic Algorithm for Numerical Optimization Problems with Linear Constraints”, Comm. of the ACM, 1992.

    Google Scholar 

  102. Brooke, A., D. Kendrick, and A. Meeraus. GAMS: A User’s Guide, The Scientific Press, 1988.

    Google Scholar 

  103. Michalewicz, Zbigniew, George A. Vignaux, and Matthew Hobbs, “A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem”, ORSA J. on Computing, Vol. 3, No. 4, 1991, pp. 307–316.

    Google Scholar 

  104. Michalewicz, Zbigniew, “A Genetic Approach for the Linear Transportation Problem”, IEEE Trans. on Sys., Man, Cyber., Vol. 21, No. 2, 1991, pp. 445–452.

    Google Scholar 

  105. Brown, Donald E. and Christopher Huntley, “Freight Routing and Scheduling at CSX Transportation”, Interfaces, forthcoming.

    Google Scholar 

  106. Wright, M. B., “Applying Stochastic Algorithms to a Locomotive Scheduling Problem”, J. of Opl. Res. Soc., Vol. 40, No. 2, 1989, pp. 187–192.

    Google Scholar 

  107. Alfa, Attahiru, Sundresh Heragu, and Mingyuan Chen, “A 3-Opt Based Simulated Annealing Algorithm for the Vehicle Routing Problem”, Computers & Ind. Eng., Vol. 21, No. 1–4, 1991, pp. 635–639.

    Google Scholar 

  108. Potvin, Jean-Yves, Yu Shen, and Jean-Marc Rousseau, “Neural Networks for Automated Vehicle Dispatching”, Computers Ops. Res., Vol. 19, No. 3/4, 1992, pp. 267–276.

    Google Scholar 

  109. Nygard, K. E., P. Juell, and N. Kadaba, “Neural Networks for Selecting Vehicle Routing Heuristics”, ORSA J. on Computing, Vol. 2, No. 4 (Fall), 1990, pp. 353–364.

    Google Scholar 

  110. Lin, Feng-Tse, Cheng-Yan Kao, and Ching-Chi Hsu, “Applying the Genetic Approach to Simulated Annealing in Solving Some NP-Hard Problems”, IEEE Trans. on Sys., Man, and Cybernetics Vol. 23, No. 6, 1993, 1752–1766.

    Google Scholar 

  111. Asad, A. and E. Wasil, “Project Management using a Microcomputer”, Computers Ops. Res., Vol. 13, pp. 231–260, 1986.

    Google Scholar 

  112. Elmaghraby, S.E., Activity Networks: Project Planning and Control by Network Models, Wiley, 1977.

    Google Scholar 

  113. Moder, J.J., C.R. Phillips, and E.W. Davis, Project Managment with CPM, PERT, and Precedence Diagramming, 3rd ed., Van Nostrand Reinhold, 1983.

    Google Scholar 

  114. Wiest, J.D. and F. K. Levy, A Management Guide to PERT/CPM with GERT/PDM/DCPM and Other Networks, 2nd ed., Prentice-Hall, 1977.

    Google Scholar 

  115. Gupta, S.K. and L.R. Taube, “A State of the Art Survey of Research on Project Management”, in Project Managment: Methods and Studies,Elsevier Science Publishers, 1985.

    Google Scholar 

  116. Hendrickson, C. and B.N. Janson, “A Common Network Flow Formulation for Several Civil Engineering Problems”, Civil Eng. Sys. Vol. 1, June 1984, pp. 195–203.

    Google Scholar 

  117. Falk, J.E., and J.L. Horowicz, “Critical Path Problems with Concave Cost-Time Curves”, Mgmt. Sci.,Vol. 19, 1972, pp. 446–455.

    Google Scholar 

  118. Patterson, J.H., “A Comparison of Exact Approaches for Solving Multiple Constrained Resource Project Scheduling Problems”, Mgmt. Sci.,Vol. 30, July 1984, pp. 854–867.

    Google Scholar 

  119. Stinson, J.P., E.W. Davis, and M. Khumawala, “Multiple-Resource Constrained-Scheduling using Branch and Bound”, AIIE Trans., Vol. 10, 1978, pp. 252–259.

    Google Scholar 

  120. Willis, R.J., and N.A. Hastings, “Project Scheduling with Resource Constraints using Branch and Bound”, J. of Opl. Res. Soc., Vol. 27, 1976, pp. 341–349.

    Google Scholar 

  121. Petrovic, R., “Optimization of Resource Allocation in Project Planning”, Ops. Res., Vol. 16, 1968, pp. 559–567.

    Google Scholar 

  122. Crowston, W., and G.L. Thompson, “Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects”, Ops. Res., Vol. 15, 1970, pp. 435–452..

    Google Scholar 

  123. Hindelang, T.J., and J.F. Muth, “A Dynamic Programming algorithm for Decision CPM Networks”, Ops. Res., Vol. 27, 1979, pp. 225–241.

    Google Scholar 

  124. Davis, E., and J.H. Patterson, “A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling”, Mgmt. Sci.,Vol. 21, 1975, pp. 944–955.

    Google Scholar 

  125. Kurtulus, I., and Davis, E., “Multi-Project Scheduling: Categorization of Heuristic Rules Performance”, Mgmt. Sci.,Vol. 28, 1982, pp. 161–172.

    Google Scholar 

  126. Zong, Y., T. Yang, and Ignizio, J.P., “An Expert System using an Exchange Heuristic for the Resource Constrained Scheduling Problem”, Expert Sys.. with Applications, Vol. 8, No. 3, Jul.-Sep. 1993, pp. 327–340.

    Google Scholar 

  127. Zozaya-Gorostiza, Carlos, Chris Hendrickson, and Daniel R. Rehak, Knowledge-based Process Planning for Construction and Manufacturing, Academic Press, 1989.

    Google Scholar 

  128. Barber, T.J., and J.T. Boardman, “Knowledge-Based Project Control Employing Heuristic Optimization”, IEE Proc. Part A, Vol. 135, No. 8, 1988, pp. 529–538.

    Google Scholar 

  129. Barber, T.J., J.T. Boardman, and N. Brown, “Practical Evaluation of an Intelligent Knowledge-Based Project Control System”, IEE Proc. Part A, Vol. 137, No. 1, 1990, pp. 35–51.

    Google Scholar 

  130. Lawton, George, “Genetic Algorithms for Schedule Optimization”, AI Expert, May 1992, pp. 27.

    Google Scholar 

  131. Hou, Edwin, S., Nirwan Ansari, and Hong Ren, “A Genetic Algorithm for Multiprocessor Scheduling”, IEEE Trans. on Parallel and Dist. Sys., Vol. 5, No. 2, 1994, pp. 113–120.

    Google Scholar 

  132. McKim, Robert A., “Neural Network Applications for Project Management: Three Case Studies”, Proj. Mgmt J.,Vol. 24, No. 4, 1993, pp. 28–33.

    Google Scholar 

  133. Adorf, H.M., and M.D. Johnston, “Scheduling with Neural Networks — The Case of the Hubble Telescope”, Computers Ops. Res., Vol. 19, No. 3/4, 1992, pp. 209–240.

    Google Scholar 

  134. Adorf, H.M., and M.D. Johnston, “A Discrete Stochastic Neural Network Algorithm for Constraint Satisfaction Problems”, Proc. Int. Joint. Conf. Neural Networks Vol. III, San Diego, CA, 1990, pp. 917–924.

    Google Scholar 

  135. Kumar, S., B. Krishna, and P. Satsnagi, “Fuzzy-Systems and Neural Networks in Software Engineering Project-Management”, Applied Intel., Vol. 4, No. 1, 1994, pp. 31–52

    Google Scholar 

  136. Simon, Herbert A., and Allen Newell, “Heuristic Problem Solving: The Next Advance in Operations Research,” Ops. Res., January-February 1958, pp. 1–10.

    Google Scholar 

  137. Kemph, Karl, Bruce Russell, Sanjiv Sidhu and Stu Barrett, “AI-Based Schedulers in Manufacturing Practice: Report of a Panel Discussion,” AI Mag., Vol. 11, Jan. 1991, pp. 37–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Systems Engineering, University of Virginia, USA

    Donald E. Brown, John A. Marin & William T. Scherer

Authors
  1. Donald E. Brown
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John A. Marin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. William T. Scherer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Virginia, USA

    Donald E. Brown  & William T. Scherer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media New York

About this chapter

Cite this chapter

Brown, D.E., Marin, J.A., Scherer, W.T. (1995). A Survey of Intelligent Scheduling Systems. In: Brown, D.E., Scherer, W.T. (eds) Intelligent Scheduling Systems. Operations Research / Computer Science Interfaces Series, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2263-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2263-8_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5954-8

  • Online ISBN: 978-1-4615-2263-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation