A rule-based estimation of distribution algorithm for solving job shop scheduling problems

Journal of Convergence Information Technology

Volumn 6, Issue 8, 2011, Pages 220-227

  Zhang, Rui ^a  

^a NANCHANG UNIVERSITY   (China)

Author keywords

Dispatching rules; Estimation of distribution algorithm; Job shop scheduling

Indexed keywords

COMPUTATIONAL EXPERIMENT; COMPUTATIONAL TIME; DISPATCHING RULES; ESTIMATION OF DISTRIBUTION ALGORITHM; ESTIMATION OF DISTRIBUTION ALGORITHMS; FEASIBLE SCHEDULE; JOB SHOP SCHEDULING; JOB SHOP SCHEDULING PROBLEMS; MUTUALLY INDEPENDENTS; RULE BASED; RULE SELECTION; TOTAL-WEIGHTED TARDINESS;

ALGORITHMS;

ESTIMATION;

EID: 80052407119     PISSN: 19759320     EISSN: None     Source Type: Journal    
DOI: 10.4156/jcit.vol6.issue8.25     Document Type: Article

References (23)

1. L. Sun, X. Cheng, and Y. Liang, "Solving job shop scheduling problem using genetic algorithm with penalty function," International Journal of Intelligent Information Processing, vol. 1, no. 2, pp. 65-77, 2010.
2. C. Song, X. Liu, W. Wang and X. Bai, "A hybrid particle swarm optimization algorithm for jobshop scheduling problem," International Journal of Advancements in Computing Technology, vol. 3, no. 4, pp. 79-88, 2011.
3. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Optimisation and approximation in deterministic sequencing and scheduling: a survey," Annals of Discrete Mathematics, vol. 5, pp. 287-326, 1979.
4. M. Singer and M. Pinedo, "A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops," IIE Transactions, vol. 30, no. 2, pp. 109-118, 1998.
5. A. P. Vepsalainen and T. E. Morton, "Priority rules for job shops with weighted tardy costs," Management Science, vol. 33, no. 8, pp. 1035-1047, 1987.
6. E. Kutanoglu and I. Sabuncuoglu, "An analysis of heuristics in a dynamic job shop with weighted tardiness objectives," International Journal of Production Research, vol. 37, no. 1, pp. 165-187, 1999.
7. M. Pinedo and M. Singer, "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics, vol. 46, no. 1, pp. 1-17, 1999.
8. S. J. Mason, J. W. Fowler, and W. M. Carlyle, "A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops," Journal of Scheduling, vol. 5, no. 3, pp. 247-262, 2002.
9. L. Monch and R. Drießel, "A distributed shifting bottleneck heuristic for complex job shops," Computers & Industrial Engineering, vol. 49, no. 3, pp. 363-380, 2005.
10. S. Kreipl, "A large step random walk for minimizing total weighted tardiness in a job shop," Journal of Scheduling, vol. 3, no. 3, pp. 125-138, 2000.
11. D. C. Mattfeld and C. Bierwirth, "An efficient genetic algorithm for job shop scheduling with tardiness objectives," European Journal of Operational Research, vol. 155, no. 3, pp. 616-630, 2004.
12. H. Zhou, W. Cheung, and L. C. Leung, "Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm," European Journal of Operational Research, vol. 194, no. 3, pp. 637-649, 2009.
13. I. Essafi, Y. Mati, and S. Dauzere-Peres, "A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem," Computers & Operations Research, vol. 35, no. 8, pp. 2599-2616, 2008.
14. M. Singer, "Decomposition methods for large job shops," Computers & Operations Research, vol. 28, no. 3, pp. 193-207, 2001.
15. M. Asano and H. Ohta, "A heuristic for job shop scheduling to minimize total weighted tardiness," Computers & Industrial Engineering, vol. 42, no. 2-4, pp. 137-147, 2002.
16. V. Amaral Armentano and C. Rigao Scrich, "Tabu search for minimizing total tardiness in a job shop," International Journal of Production Economics, vol. 63, no. 2, pp. 131-140, 2000.
17. D. Heckerman, D. Geiger, and D. M. Chickering, "Learning Bayesian networks: the combination of knowledge and statistical data," Machine Learning, vol. 20, no. 3, pp. 197-243, 1995.
18. M. Pelikan, D. E. Goldberg, and F. G. Lobo, "A survey of optimization by building and using probabilistic models," Computational Optimization and Applications, vol. 21, no. 1, pp. 5-20, 2002.
19. P. Larranaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Optimization. Boston: Kluwer Academic Publishers, 2002.
20. J. A. Lozano, P. Larranaga, I. Inza, and Bengoetxea, Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms. Berlin: Springer, 2006.
21. S. Tsutsui and M. Miki, "Solving flow shop scheduling problems with probabilistic modelbuilding genetic algorithms using edge histograms," in Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, 2002, pp. 465-471.
22. B. Jarboui, M. Eddaly, and P. Siarry, "An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems," Computers & Operations Research, vol. 36, no. 9, pp. 2638-2646, 2009.
23. R. Zhang, "A particle swarm optimization algorithm based on local perturbations for the job shop scheduling problem," International Journal of Advancements in Computing Technology, vol. 3, no. 4, pp. 256-264, 2011.