CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A novel Improved Bat Algorithm for Job Shop Scheduling Problem

by Hegazy Zaher, Naglaa Ragaa, Heba Sayed
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 164 - Number 5
Year of Publication: 2017
Authors: Hegazy Zaher, Naglaa Ragaa, Heba Sayed
10.5120/ijca2017913627

Hegazy Zaher, Naglaa Ragaa, Heba Sayed . A novel Improved Bat Algorithm for Job Shop Scheduling Problem. International Journal of Computer Applications. 164, 5 ( Apr 2017), 24-30. DOI=10.5120/ijca2017913627

@article{ 10.5120/ijca2017913627,
author = { Hegazy Zaher, Naglaa Ragaa, Heba Sayed },
title = { A novel Improved Bat Algorithm for Job Shop Scheduling Problem },
journal = { International Journal of Computer Applications },
issue_date = { Apr 2017 },
volume = { 164 },
number = { 5 },
month = { Apr },
year = { 2017 },
issn = { 0975-8887 },
pages = { 24-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume164/number5/27479-2017913627/ },
doi = { 10.5120/ijca2017913627 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:10:27.465682+05:30
%A Hegazy Zaher
%A Naglaa Ragaa
%A Heba Sayed
%T A novel Improved Bat Algorithm for Job Shop Scheduling Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 164
%N 5
%P 24-30
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper introduces a novel improved bat algorithm for solving job shop scheduling problem reaching to the optimal. A proposed novel improved Bat Algorithm plays an important role in effective and efficient computations of function optimization for job shop scheduling problem. In this paper, an optimization algorithm based on improving Giffler and Thompson algorithm through recognizing a non-delay schedule for starting time instead of finishing time to solve the NP-hard job shop scheduling problem. For improving the diversity of population, enhance the quality of the solution, swap operator is used to-enhance the solution. This paper is based on ten benchmarking problems. The results demonstrate that the proposed novel improved algorithm gives better results than the particle swarm algorithm and our previous modified algorithm in both convergence speed and accuracy.

References
  1. Wu1 C., Zhang N., Jiang J., Jinhui Yang J. and Liang Y. 2007 Improved Bacterial Foraging Algorithms and Their Applications to Job Shop Scheduling Problems, Springer-Verlag Berlin Heidelberg.
  2. Peter B. 2006 Scheduling Algorithms, Springer-Verlag Berlin Heidelberg.
  3. Frits C. R. S. 2007 Interval Scheduling, 3rd Multidisciplinary International Conference on Scheduling: Theory and Application, Paris, France.
  4. Shiva-Kumar B. L. and Amudha T. 2013 Enhanced Bacterial Foraging Algorithm For Permutation Flow Shop Scheduling Problems, Asian Research Publishing Network (ARPN).
  5. Jen S. C. and Jin S.Y. 2006 Model formulation for the machine scheduling problem with limited waiting time constraint, Journal of Information & Optimization Sciences.
  6. Tomas K., Frantisek K. 2011 Solving job shop scheduling with the computer simulation, the International Journal of transport & logistic, ISSN 1451-107X.
  7. Hegazy Z., Mahmoud El-S., Naglaa R. S., Heba S. 2017 Bat Algorithm for Job Shop Scheduling Problem, Journal of Multidisciplinary Engineering Science and Technology (JMEST) ISSN: 2458-9403, Vol. 4 Issue 2, pp: 6758-6763.
  8. Qifang L., Yongquan Z., Jian X.,Mingzhi M., and Liangliang L. 2014 Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling, Scientific World Journal , 15 pages.
  9. Gonçalves J. F., Mendes J. J. d. M. and Resende M. G. C. 2005 A hybrid genetic algorithm for the job shop scheduling problem, European Journal of Operational Research, pp: 77–95.
  10. Kanate P. and Anan M. 2010 Algorithm for Solving Job Shop Scheduling Problem Based on machine availability constraint, International Journal on Computer Science and Engineering(IJCSE), Vol. 02, No. 05, 1919-1925.
  11. Yang X. S. 2010 A New Meta heuristic Bat-Inspired Algorithm, in: Nature Inspired Cooperative Strategies for Optimization, Studies in Computational Intelligence, Springer Berlin, 284, Springer, 65-74.
  12. Wang G. and Guo L. 2013 A Novel Hybrid Bat Algorithm with Harmony Search for Global Numerical Optimization, Journal of Applied Mathematics, vol. 2013, pp. 21.
  13. Selim Y. and Ecris U. K. 2013 Improved Bat Algorithm (IBA) on Continuous Optimization Problems, Lecture Notes on Software Engineering, Vol. 1, No. 3.
  14. Nickabadi A., Ebadzadeh M. and Safabakhsh R. 2011 A novel particle swarm optimization algorithm with adaptive inertia weight, Applied Soft Computing, vol. 11, pp. 3658-3670.
  15. Giffler J. and Thompson G. L. 1960 Algorithms for solving production scheduling problems, Operations Research, pp: 487–503.
  16. Fisher H. and Thompson G. L. 1963 Industrial scheduling, Englewood Cliffs, NJ: Prentice-Hall.
  17. Lawrence S. 1984 Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques, Graduate School of Industrial Administration (GSIA), Carnegie Mellon University, Pittsburgh, PA.
  18. Beasley, J. E. (1990). OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, pp.1069–1072.
  19. Sha D.Y. and Cheng-Yu. 2006 A hybrid particle swarm optimization for job shop scheduling problem, Computers & Industrial Engineering, pp: 791–808.
Index Terms

Computer Science
Information Sciences

Keywords

Job Shop Scheduling Makespan Bat Algorithm Priority based representation Giffler and Thompson Algorithm and Swap operator.

Powered by PhDFocusTM