CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 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 Featured Tuning of the Simulated Annealing Applied to the Open Shop Scheduling

by Chaouqi Mohsine, Benhra Jamal, My Ali El Oualidi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 146 - Number 2
Year of Publication: 2016
Authors: Chaouqi Mohsine, Benhra Jamal, My Ali El Oualidi
10.5120/ijca2016910642

Chaouqi Mohsine, Benhra Jamal, My Ali El Oualidi . A Featured Tuning of the Simulated Annealing Applied to the Open Shop Scheduling. International Journal of Computer Applications. 146, 2 ( Jul 2016), 5-10. DOI=10.5120/ijca2016910642

@article{ 10.5120/ijca2016910642,
author = { Chaouqi Mohsine, Benhra Jamal, My Ali El Oualidi },
title = { A Featured Tuning of the Simulated Annealing Applied to the Open Shop Scheduling },
journal = { International Journal of Computer Applications },
issue_date = { Jul 2016 },
volume = { 146 },
number = { 2 },
month = { Jul },
year = { 2016 },
issn = { 0975-8887 },
pages = { 5-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume146/number2/25368-2016910642/ },
doi = { 10.5120/ijca2016910642 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:49:11.389006+05:30
%A Chaouqi Mohsine
%A Benhra Jamal
%A My Ali El Oualidi
%T A Featured Tuning of the Simulated Annealing Applied to the Open Shop Scheduling
%J International Journal of Computer Applications
%@ 0975-8887
%V 146
%N 2
%P 5-10
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The present paper discusses the open shop scheduling problem using a manual tuning of a simulated annealing algorithm’s parameters. A comparison has been done between Taillard’s Benchmarks for 60 instances, 2 dispatching rules and 1296 variants of the SA algorithm obtained by changing the initial solution, the epoch length, and the steps’ number, the initial temperature, the neighborhood and the cooling scheme. The gotten results lead to some interesting conclusions for the best choice of the parameters.

References
  1. M. L. Pinedo, Scheduling, vol. 1. Boston, MA: Springer US, 2012.
  2. F. Werner, “Genetic algorithms for shop scheduling problems: A survey,” Preprint, 2011.
  3. O. Magdeburg, F. Mathematik, M. Andresen, H. Bräsel, M. Plauschin, and F. Werner, “Using Simulated Annealing for Open Shop Scheduling with Sum Criteria,” pp. 1–26, 2008.
  4. C. Prins, “An Overview of Scheduling Problems Arising in Satellite Communications,” J. Oper. Res. Soc., vol. 45, no. 6, p. 611, Jun. 1994.
  5. C. Y. Liu and R. L. Bulfin, “Scheduling ordered open shops,” Comput. Oper. Res., vol. 14, no. 3, pp. 257–264, Jan. 1987.
  6. C. F. Liaw, “Applying simulated annealing to the open shop scheduling problem,” IIE Trans. (Institute Ind. Eng., vol. 31, no. 5, pp. 457–465, 1999.
  7. C.-F. Liaw, “A hybrid genetic algorithm for the open shop scheduling problem,” Eur. J. Oper. Res., vol. 124, no. 1, pp. 28–42, Jul. 2000.
  8. Taillard E., “Benchmarks for basic scheduling problems,” Eur. J. Oper. Res., vol. 64, pp. 1–17, 1993.
  9. P. Brucker, J. Hurink, B. Jurisch, and B. Wöstmann, “A branch & bound algorithm for the open-shop problem,” Discret. Appl. Math., vol. 76, no. 1–3, pp. 43–59, Jun. 1997.
  10. H. Fang and P. Ross, “A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems In Proceedings of the 11th European Conference on Arti cial Intelligence, John Wiley and Sons, 1994, pages 590{594.,” no. 699, 1994.
  11. R. Zhang and C. Wu, “An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling,” no. 1, pp. 147–157, 2008.
  12. D. Bai, Z.-H. Zhang, and Q. Zhang, “Flexible open shop scheduling problem to minimize makespan,” Comput. Oper. Res., vol. 67, pp. 207–215, Mar. 2016.
  13. B. Naderi and M. Zandieh, “Modeling and scheduling no-wait open shop problems,” Int. J. Prod. Econ., vol. 158, pp. 256–266, Dec. 2014.
  14. M. Chaouqi and J. Benhra, “Recuit simulé hybride pour un ordonnancement conjoint de la production et de la maintenance dans un atelier job-shop,” Int. Work. Theory Appl. Logist. Transp. TALT15, 2015.
  15. M. Chaouqi, J. Benhra, and A. Zakari, “Agile Approach for Joint Scheduling of Production and Maintenance in Flow Shop,” Int. J. Comput. Appl., vol. 59, no. 11, pp. 29–36, Dec. 2012.
  16. M. P. V. S. Kirkpatrick C. D. Gelatt, “Optimization by Simulated Annealing,” Science (80-. )., vol. 220, no. 4598, pp. 671–680, 1983.
  17. “Annealing - Wikipedia, the free encyclopedia.” [Online]. Available: https://en.wikipedia.org/wiki/Annealing. [Accessed: 19-Mar-2016].
  18. K. Hasani, S. A. Kravchenko, and F. Werner, “Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances,” Eng. Optim., vol. 48, no. 1, pp. 173–183, 2016.
  19. M. Andresen, F. Engelhardt, and F. Werner, “LiSA - A Library of Scheduling Algorithms Handbook for Version 3.0,” 2010.
Index Terms

Computer Science
Information Sciences

Keywords

Scheduling Simulated annealing epoch length neighborhood cooling scheme tuning and open shop.

Powered by PhDFocusTM