Job shop scheduling with a genetic algorithm and machine learning

International Journal of Production Research

Volumn 35, Issue 4, 1997, Pages 1171-1191

  Lee, C Y ^a   Piramuthu, S ^b   Tsai, Y K ^c  

^a Texas AandM University   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

^c University of Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION MAKING; EXPERT SYSTEMS; FACTORY AUTOMATION; GENETIC ALGORITHMS; LEARNING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

DYNAMIC JOB SHOP SCHEDULING;

PRODUCTION CONTROL;

EID: 0031121631     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075497195605     Document Type: Article

References (52)

1. Aarts, E. H. L., van Laarhoven, P. J. M., Lenstra, J. K., and Ulder, N. L. J., 1994, A computational study of local search algorithm for job shop scheduling. ORSA Journal of Computing, 6, 118- 129.
2. Adams, j., Balas, E., and Zawack, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
3. Aytug, H., Bhattacharyya, S., Koehler, G. J., and Snowdon, J. L., 1994, A review of machine learning in scheduling. IEEE Transactions on Engineering Management, 41(2), 165-171.
4. Azrak, M., and Lee, C.-Y., 1993, Analysis of dispatching policies in semiconductor post-test operations. Journal of Electronic Manufacturing, 3, 145- 157.
5. Baker, K. R., 1984, The effects of input control on the performance of a simple scheduling model. Journal of Operations Management, 4(2), 99-112.
6. Barnes, J. W., and Chambers, J. B., 1991, Solving the job shop scheduling problem using tabu search. Technical Report OPR91-06, Graduate Program in Operations Research, University of Texas at Austin.
7. Bean, J. C., 1994, Genetics and random keys for sequencing and optimization. ORSA Journal of Computing, 6, 154-160.
8. Bensana, E., Bel, G., and Dubois, D., 1988, OPAL: a multi-knowledge-based system for industrial job-shop scheduling. International Journal of Production Research, 26(5), 795- 819.
9. Cerny, V., 1985, Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41.
10. Davis, L., 1985, Job shop scheduling with genetic algorithms. In Proceedings of the International Conference on Genetic Algorithms and their Applications, J. Grefenstette (ed.).
11. Davis, L., ed., 1991, Handbook of Genetic Algorithms (New York: Van Nostrand Reinhold).
12. Della Croce, F., Tadei, R., and Volta, G., 1992, A genetic algorithm for the job shop problem. DAI, Politecnico di Torino, Italy.
13. Fischler, M. A., and Firschein, O., 1987, Intelligence: The Eye, the Brain and the Computer, (Reading, MA: Addison-Wesley).
14. Fox, B. R., and McMahon, M. B., 1990, Genetic operators for sequencing problems. Planning and Scheduling Group, McDonnell Douglas Space Systems, Houston, Texas.
15. Fox, M. S., and Smith, S. F., 1984, ISIS-a knowledge-based system for factory scheduling. Expert Systems, 1(1), 25-49.
16. Glassey, C. R., and Resende, M. G. C., 1988, Closed-loop job release control for vlsi circuit manufacturing. IEEE Transactions on Semiconductor Manufacturing, 1, 36-46.
17. Glover, F., 1977, Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156-166.
18. Goldberg, D. E., 1989, Genetic Algorithms in Search, Optimization, and Machine Learning (Reading, MA: Addison-Wesley).
19. Gupta, M. C., Gupta, Y. P., and Kumar, a., 1993, Minimizing flow time variance in a single machine system using genetic algorithm, 70, 289-303.
20. Herrmann, J. W., and Lee, C.-Y., 1995, Solving a class scheduling problem with a genetic algorithm. ORSA Journal of Computing, 7, 443-452.
21. Herrmann, J. W., Lee, C.-Y., and Hinchman, J., 1995, Global job shop scheduling with a genetic algorithm. Production and Operations Management, 4, 30-44.
22. H olland, J. H., 1975, Adaptation in Natural and Artificial Systems (Detroit, MI: University of M ichigan Press).
23. Irastorza, J. C., and Deane, R. H., 1974, A loading and balancing methodology for job shop control. AIIE Transactions, 6(4), 302-307.
24. Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P., 1983, Optimization by simulated annealing. Science, 220, 671.
25. Lawton, G., 1992, Genetic algorithm for schedule optimization. AI Expert, May, 23-27.
26. Mahmoodi, F., Dooley, K. J., and Starr, P. J., 1990, An evaluation of order releasing and due date assignment heuristics in a cellular manufacturing system. Journal of Operations Management, 9, 548-573.
27. Matsuo, H., Suh, C. J., and Sullivan, R. S., 1988, Controlled search simulated annealing for general job shop scheduling problem. Working paper 03-44-88, Graduate School of Business, University of Texas at Austin.
28. Melnyk, S. A., and Ragatz, G. L., 1989, Order review/release: research issues and perspectives. International Journal of Production Research, 27(7), 1081 - 1096.
29. Melnyk, S. A., Ragatz, G. L., and Fredendall, L., 1991, Load smoothing by the planning and order review/release systems: a simulation experiment. Journal of Operations Management, 10(4), 512-523.
30. Michalewicz, G., 1992, Genetic Algorithm + Data Structures = Evolution Programs (New York: Springer).
31. Morton, T. E., and Pentico, D. W., 1993, Heuristic Scheduling Systems (New York: Wiley).
32. Nakano, R., and Yamada, T., 1993, Conventional genetic algorithms for job shop problems. In Proceedings of the Fourth International Conference on Genetic Algorithms (New York: Morgan Kaufmann), pp. 477-579.
33. Nakasuka, S., and Yoshida, T., 1992, Dynamic scheduling system utilizing machine learning as a knowledge acquisition tool. International Journal of Production Research, 30(2), 411 - 431.
34. Ovacik, I. M., and Uzsoy, R., 1992, A shifting bottleneck algorithm for scheduling semiconductor testing operations. Journal of Electronics Manufacturing, 199-134.
35. Ow, P. S., and Smith, S. F., 1988, Viewing scheduling as an opportunistic problem-solving process. Annals of Operations Research, 12, 85-108.
36. Panwalker, S. S., and Iskander, W., 1977, A survey of scheduling rules. Operations Research, 25, 45-61.
37. Pinedo, M., 1995, Scheduling: Theory, Algorithms, and Systems (Englewood Cliff's, NJ: Prentice-Hall).
38. Piramuthu, S., Raman, N., and Shaw, M. J., 1994, Learning-based scheduling in a flexible manufacturing flow line. IEEE Transactions on Engineering M anagement, 41(2), 172-182.
39. Quinlan, J. R., 1990, Decision trees and decision making. IEEE Transactions on Systems, Man and Cybernetics, 20, 339-346.
40. Ragatz, G. L., and Mabert, V. A., 1988, An evaluation of order release mechanism in a job-shop environment. Decision Sciences, 19, 167-189.
41. Rich, E., and Knight, K., 1991, Artificial Intelligence (New York: McGraw-Hill).
42. Sadeh, N., 1991, MICRO-BOSS: a micro-opportunistic factory scheduler. Center for Integrated Manufacturing Decision Systems, The Robotics Institute, Carnegie Mellon university, Pittsburgh, Pennsylvania.
43. Shannon, C. E., 1948, A mathematical theory of communication. Bell Systems Technological Journal, 27, 379-423.
44. Shaw, M. J., Park, S. C., and Raman, N., 1992, Intelligent scheduling with machine learning capabilities: the induction of scheduling knowledge. IIE Transactions, 24(2), 156-168.
45. Shimoyashiro, S., Isoda, K., and Awane, H., 1984, Input scheduling and load balance control for a job shop. International Journal of Production Research, 22(4), 597-605.
46. Smith, S. F., Fox, M. S., and Ow, P. S., 1986, Constructing and maintaining detailed production plans: investigations into the development of knowledge-based factory scheduling systems. AI Magazine, 7(4), 45-61.
47. Spearman, M. L., Woodruff, D. L., and Hopp, W. J., 1990, CONWIP: A pull alternative to kanban. International Journal of Production Research, 28, 879.
48. Storer, R. H., Wu, S. D., and Vaccari, R., 1992, New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38(10), 1495-1509.
49. Taillard, E., 1994, Parallel taboo search techniques for the job shop scheduling problems. ORSA Journal of Computing, 6, 108-117.
50. van Laarhoven, P. J. M., Aarts, E. H. L., and Lenstra, J. K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40, 113-126.
51. Wein, L. M., 1988, Scheduling semiconductor wafer fabrication. IEEE Transactions on Semiconductor Manufacturing, 1, 115-130.
52. Whitley, D., Starkweather, T., and Fuquay, D., 1989, Scheduling problems and the traveling salesman: the genetic edge recombination operators. Proceedings of the Third International Conference on Genetic Algorithms, 133-140.