Local Search Genetic Algorithms for the Job Shop Scheduling Problem

@article{OmbukiBerman2004LocalSG,
  title={Local Search Genetic Algorithms for the Job Shop Scheduling Problem},
  author={Beatrice M. Ombuki-Berman and Mario Ventresca},
  journal={Applied Intelligence},
  year={2004},
  volume={21},
  pages={99-109}
}
In previous work, we developed three deadlock removal strategies for the job shop scheduling problem (JSSP) and proposed a hybridized genetic algorithm for it. While the genetic algorithm (GA) gave promising results, its performance depended greatly on the choice of deadlock removal strategies employed. This paper introduces a genetic algorithm based scheduling scheme that is deadlock free. This is achieved through the choice of chromosome representation and genetic operators. We propose an… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 78 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
47 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 47 extracted citations

78 Citations

01020'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 78 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

An evolutionary scheduling scheme based on gkGA approach for the job shop scheduling problem,

  • B. Ombuki, M. Nakamura, K. Onaga
  • IEICE Transactions on Fundamentals of Elecronics…
  • 1998
Highly Influential
9 Excerpts

The ant system: Optimization by a colony of cooperating agents,

  • M. Dorigo, V. Maniezzso, A. Corni
  • IEEE Transactions on Systems, Man and Cybernatics…
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…