Schedule a job shop by Hybrid Genetic Algorithm

Authors(2) :-Basavaraj Shrikanth Vijapure, Ajay Nadargi

This paper displays a hybrid genetic algorithm for the Job Shop Scheduling issue.The chromosome portrayal of the issue depends on random keys. The schedules are developed utilizing a priority run in which the priority are characterized by the genetic algorithm. schedules are developed utilizing a system that creates parameterized dynamic schedules. After a schedules is acquired a nearby inquiry heuristic is connected to enhance the arrangement. The approach is tried on an arrangement of standard occasiaons taken from the writing and contrasted and different methodologies.The calculation comes about approve the viability of the proposed algorithm. Here we mainly focus on single-criterion problems (minimization of the makespan or of a particular sum criterion such as total completion time or total tardiness) but mention briefly also some work on multi-criteria problems. We discuss some computational results and compare them with those obtained by other heuristics. In addition, we also summarize the generation of benchmark instances for makespan problems and give a brief introduction into the use of the program package íLiSA - A Library of Scheduling Algorithmsí developed at the Otto-von-Guericke-University Magdeburg for solving shop scheduling problems, which also includes a genetic algorithm.

Authors and Affiliations

Basavaraj Shrikanth Vijapure
Department Computer Engineering, Sinhgad Institute of Technology, Savitribhai Phule University, Pune, Maharashtra, India
Ajay Nadargi
Department Computer Engineering, Sinhgad Institute of Technology, Savitribhai Phule University, Pune, Maharashtra, India

Job Shop, Scheduling, Genetic Algorithm, Hybird scheduler.

  1. Adams, J.; Balas, E.; and Zawack, D. 1988. The shifting bottleneck procedure for job shop scheduling. Managament Science 34:391-401.
  2. Applegate, D., and Cook, W. 1991. A computational study of the job-shop scheduling problem. ORSA Journal of Computing 3:149-156.
  3. Artigues, C., and Lopez, P. 2000. Extending GifflerThompson algorithm to generate active schedules for jobshops with sequence-dependent setup times. LIA report 129, University of Avignon.
  4. Artigues, C.; Lopez, P.; and Ayache, P. 2005. Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operations Research 138:21-52
  5. Artigues, C., and Feillet, D. 2008. A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research 159(1):135- 159.
  6. Balas, E., and Vazacopoulos, A. 1998. Guided local search with shifting bottleneck fo job shop scheduling. Management Science 44 (2):262-275.

Publication Details

Published in : Volume 3 | Issue 5 | May-June 2018
Date of Publication : 2018-06-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 972-976
Manuscript Number : CSEIT1835248
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Basavaraj Shrikanth Vijapure, Ajay Nadargi, "Schedule a job shop by Hybrid Genetic Algorithm", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 5, pp.972-976, May-June-2018.
Journal URL :

Article Preview