Abstract
In this chapter we applied discrete and continuous Estimation of Distribution Algorithms to the job shop scheduling problem. We borrow from Genetic Algorithms literature the most successful codifications and hybridizations. Estimation of Distribution Algorithms are plainly applied with these elements in the Fisher and Thompson (1963) datasets. The results are comparable with those obtained with Genetic Algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderson, E., Glass, C., and Potts, C. (1997). Machine scheduling. In Aarts, E. and Lenstra, J., editors, Local Search in Combinatorial Optimization, pages 361–414. John Wiley & Sons.
Balas, E. and Vazacopoulos, A. (1998). Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44:262–275.
Baluja, S. (1994). Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94–163, Carnegie Mellon University.
Baluja, S. and Davies, S. (1998). Fast probabilistic modeling for combinatorial optimization. In AAAI-98.
Bean, J. and Norman, B. (1993). Random keys for job shop scheduling. Technical Report TR 93–7, Department of Industrial and Operations Ingeneering, The University of Michigan.
Bierwirth, C. and Mattfeld, D. (1999). Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation, 7(1):1–17.
Blazewicz, J., Domschke, W., and Pesch, E. (1996). The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93:1–33.
Blazewicz, J., Ecker, K., Schmidt, G., and Weglarz, J. (1985). Scheduling in Computer and Manufacturing Systems. Springer-Verlag.
Davidor, Y., Yamada, T., and Nakano, R. (1993). The ecological framework II: Improving GA performance at virtually zero cost. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms,ICGA-5, pages 171–176. Morgan Kaufmann.
Davis, L. (1985). Job shop scheduling with genetic algorithms. In Grefenstette, J., editor, Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pages 136–140. Lawrence Erlbaum Associates.
Fang, H., Ross, P., and Corne, D. (1993). A promising genetic algorithm approach to job shop scheduling, rescheduling and open-shop scheduling problems. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms,ICGA-5, pages 375–382. Morgan Kaufmann.
Fisher, H. and Thompson, G. (1963). Probabilistic learning of local job-shop scheduling rules. In Muth, J. and Thompson, G., editors, Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ.
Giffier, B. and Thompson, G. (1960). Algorithms for solving production scheduling problems. Operations Research, 8:487–503.
Henrion, M. (1988). Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In Lemmer, J. and Kanal, L., editors, Uncertainty in Artificial Intelligence, volume 2, pages 149–163. North-Holland, Amsterdam.
Husband, P., Mill, F., and Warrington, S. (1991). Genetic algorithms, production plan optimisation and scheduling. In Schwefel, H.-P. and Manner, R., editors, Parallel Problem Solving from Nature, PPSN I. Lectures Notes in Computer Science, volume 496, pages 80–84. Springer Verlag.
Kobayashi, S., Ono, I., and Yamamura, M. (1995). An efficient genetic algorithm for job shop scheduling problems. In Proceedings of the Sixth International Conference on Genetic Algorithms, ICGA-6, pages 506–511.
Larrañaga, P. (2001). A review on Estimation of Distribution Algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers.
Larrañaga, P., Etxeberria, R., Lozano, J. A., and Peña, J. M. (2000a). Combinatorial optimization by learning and simulation of Bayesian networks. In Boutilier, C. and Goldszmidt, M., editors, Uncertainty in Artificial Intelligence,UAI-2000, pages 343–352. Morgan Kaufmann Publishers, San Francisco, CA.
Larrañaga, P., Etxeberria, R., Lozano, J. A., and Peña, J. M. (2000b). Optimization in continuous domains by learning and simulation of Gaussian networks. In Wu, A. S., editor, Proc. of the Genetic and Evolutionary Computation Conference,GECCO-2000, Workshop Program, pages 201–204.
Lenstra, J. and Kan, A. R. (1979). Computational complexity of discrete optimization problems. Annals of Discrete Mathematics, 4:121–140.
Mattfeld, D., Kopfer, H., and Bierwirth, C. (1994). Control of parallel population dynamics by social-like behavior of GA-individuals. In Parallel Problem from Nature III, pages 16–25.
Mühlenbein, H. and Paa G. (1996). From recombination of genes to the estimation of distributions I. Binary parameters. In Voigt, H., Ebeling, W., Rechenberg, I., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature, PPSN IV. Lectures Notes in Computer Science, volume 1141, pages 178–187.
Nowicki, E. and Smutnicki, C. (1996). A fast taboo seach algorithm for the job shop problem. Management Science, 42:797–813.
Ono, I., Yamamura, M., and Kobayashi, S. (1996). A genetic algorithm for job-shop scheduling problems using job-based order crossover. In Fogel, D., editor, Proceedings of The Second IEEE Conference on Evolutionary Computation, pages 547–552. IEEE Computer Society Press.
Rudolph, G. (1991). Global optimization by means of distributed evolution strategies. In Schwefel, H.-P. and Manner, R., editors, Parallel Problem Solving from Nature, PPSN I. Lectures Notes in Computer Science, volume 496, pages 209–213. Springer-Verlag.
Starkweather, T., Whitley, D., Mathias, K., and McDaniel, S. (1992). Sequence scheduling with genetic algorithms. In Fandel, G., Gulledge, T., and Jones, J., editors, New Directions for Operations Research in Manufacturing, pages 129–148. Springer.
Yamada, T. and Nakano, R. (1995). A genetic algorithm with multi-step crossover for job-shop scheduling problems. In Proceedings of the First IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pages 146–151. IEE Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lozano, J.A., Mendiburu, A. (2002). Estimation of Distribution Algorithms Applied to the Job Shop Scheduling Problem: Some Preliminary Research. In: Larrañaga, P., Lozano, J.A. (eds) Estimation of Distribution Algorithms. Genetic Algorithms and Evolutionary Computation, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1539-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1539-5_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5604-2
Online ISBN: 978-1-4615-1539-5
eBook Packages: Springer Book Archive