Single process plan scheduling with genetic algorithms

Production Planning and Control

Volumn 8, Issue 4, 1997, Pages 363-376

  Jain, Ajay K ^a   Elmaraghy, Hoda A ^b  

^a Celestica Inc   (Canada)

^b UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Genetic algorithms; Genetic algorithms parameters; Scheduling

Indexed keywords

GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROCESS CONTROL; PRODUCTION CONTROL; RESOURCE ALLOCATION;

MEAN FLOW TIME; SINGLE PROCESS PLAN SCHEDULING (SPPS);

SCHEDULING;

EID: 0031168629     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/095372897235172     Document Type: Article

References (30)

1. ADAMS, J., BALAS, E. and ZAWACK, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
2. BARKER, J. R., and MCMAHON, G. B., 1985, Scheduling the general job-shop. Management Science, 31, 594-598.
3. CARLIER, J., and PINSON, E., 1989, An algorithm for solving the job-shop problem. Management Science, 35, 164-176
4. CHAN, D. Y., 1989, Design of a Scheduling System for a Flexible Manufacturing Cell. PhD dissertation, Arizona State University, Tucson, AZ.
5. DAVIS, L., 1985, Job shop schedulingwith genetic algorithms. Proceedings of an International Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon University, Pittsburg, PA, pp. 135-140.
6. FALKENAUER, E., and BOUFFOUIX, S., 1991, A genetic algorithm for job shop. Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, pp. 824-829
7. FRENCH, S., 1982, Sequencing and Scheduling:An Introduction to the Mathematics of the Job-Shop (John Wiley & Sons, New York).
8. GOLDBERG, D. E., and LINGLE, R., 1985, Alleles, loci and the traveling salesman problem. Proceedings of the First International Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon University, Pittsburgh, PA, pp. 154-159.
9. GREENBERG, H. H., 1966, A branch-bound solution to the general scheduling problem. Management Science, 1, 353-361.
10. GREFENSTETTE, J. J., 1986, Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, SMC-16, 122-128.
11. GREFENSTETTE, J., GOPAL, R., RASMAITA, B., and VAN GUCHT, D., 1985, Genetic algorithms for the traveling salesman problem. Proceedings of the First International Conference on Genetic Algorithms and Their Applications. Carnegie-Mellon University, Pittsburgh, PA, pp. 160-168.
12. GUPTA, J. N., 1972, Heuristic algorithms for the multistage flowshop scheduling problem. AIIE Transactions, 4, 11-23.
13. GUPTA, M. C., GUPTA, Y. P., and KUMAR, A., 1993, Minimizing flow time variance in a single machine systemusing genetic algorithms. European Journal of Operational Research, 70, 289-303.
14. HATZINKONSTANTIS, L., and BESANT, C. B., 1992, Job-shop scheduling using certain heuristic search algorithms. International Journal of Advanced Manufacturing Technology, 7, 251-261.
15. JAIN, A. K., 1995, An Integrated Scheduling Approach for Discrete Manufacturing Systems. PhD dissertation, McMaster University, Hamilton, Ontario.
16. KUSIAK, A., 1986, Efficient implementation of Johnson's scheduling algorithm. IIE Transactions, 18, 215-216.
17. LAARHOVEN, P. J.M.V., ARTS, E.H. L., and LENSTRA, J.K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40, 113-125.
18. LEE, T., 1987, An Integrated Knowledge Based Scheduler for Batch Manufacturing Systems (IKBAS). PhD dissertation, Cleveland State University, Cleveland, OH.
19. LEE, I., SIKORA, R., and SHAW, M. J., 1993, Joint lot sizing and sequencing with genetic algorithms for scheduling evolving the chromosome structure. Proceedings of the Fifth International Conference on Genetic Algorithms, University of Illinois at Urbana-Champaign (Morgan Kaufman Publishers, San Mateo, CA), pp. 383-389.
20. LIEPINS, G. E., HILLIARD, M. R., PALMER, M., and MORROW, M., 1987, Greedy genetics. Proceedings of the Second International Conference on Genetic Algorithms, Cambridge, MA, pp. 90-99.
21. LOGENDRAN, R., and NUDTASOMBOOM, N., 1991, Minimizing the makespan of a group scheduling problem: a new heuristic. International Journal of Production Economics, 22, 217-230.
22. MUTH, J. F., and THOMPSON, G. L., 1963, Industrial Scheduling (Prentice Hall, Englewood Cli. s, NJ).
23. NAKANO, R., and YAMADA, T., 1991, Conventional genetic algorithm for job shop. Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, CA, pp. 4774-4779.
24. RAJENDRAN, C., and CHAUDHURI, D., 1991, A P owshop scheduling algorithm to minimize total P owtime. Journal of Operations Research Society of Japan, 34, 28-46.
25. SCHAFFER, J. D., CARUANA, R. A., ESHELMAN, L. J., and DAS, R., 1989, A study of control parameters affecting online performance of genetic algorithms for function optimization. Proceedings of the Third International Conference on Genetic Algorithms, J. D. Schaffer, ed. (Morgan-Kaufmann, Palo Alto, CA), pp. 51-60.
26. SRIDHAR, J., and RAJENDRAN, C., 1993, Scheduling in a cellular manufacturing system: a simulated annealing approach. International Journal of Productions Research, 31, 2927-2945.
27. STARKWEATHER, T., MCDANIEL, S., MATHIAS, K., WHITLEY, D., and WHITLEY, C., 1991. A comparison of genetic sequencing operators. Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, pp. 69-75.
28. VANCHEESWARAN, R., and TOWNSEND, M. A., 1993, Two-stage heuristic procedure for scheduling job shops. Journal of Manaufacturing Systems, 12, 315-325.
29. WHITLEY, D., 1989, The GENITOR algorithm and selective pressure: why rank-based allocation of reproductive trials is best. Proceedings of the Third International Conference on Genetic Algorithms (Morgan Kaufman, Palo Alto, CA), pp. 116-121.
30. YANG, T., IGNIZIO, J. P., and DEAL, D. E., 1989, An exchange heuristic for generalized job shop scheduling. Engineering Optimization, 15, pp. 83-96.