Next Article in Journal
Anchor Design of a Ring Joint Based on Reliability in a Precast Shear Wall Structure
Previous Article in Journal
Detection and Tracking of Moving Pedestrians with a Small Unmanned Aerial Vehicle
Open AccessArticle

Cooperative Threads with Effective-Address in Simulated Annealing Algorithm to Job Shop Scheduling Problems

1
Research Center in Engineering and Applied Sciences, Autonomous University of Morelos State (UAEM), Avenida Universidad 1001 Colonia Chamilpa, C.P. Cuernavaca 62209, Morelos, Mexico
2
Faculty of Chemical Sciences and Engineering, UAEM, Avenida Universidad 1001 Colonia Chamilpa, C.P. Cuernavaca 62209, Morelos, Mexico
3
Faculty of Accounting, Administration & Informatics, UAEM, Avenida Universidad 1001 Colonia Chamilpa, C.P. Cuernavaca 62209, Morelos, Mexico
*
Author to whom correspondence should be addressed.
Appl. Sci. 2019, 9(16), 3360; https://doi.org/10.3390/app9163360
Received: 14 July 2019 / Revised: 5 August 2019 / Accepted: 9 August 2019 / Published: 15 August 2019
  |  
PDF [6826 KB, uploaded 15 August 2019]
  |  

Abstract

This paper presents a parallel algorithm applied to the job shop scheduling problem (JSSP). The algorithm generates a set of threads, which work in parallel. Each generated thread, executes a procedure of simulated annealing which obtains one solution for the problem. Each solution is directed towards the best solution found by the system at the present, through a procedure called effective-address. The cooperative algorithm evaluates the makespan for various benchmarks of different sizes, small, medium, and large. A statistical analysis of the results of the algorithm is presented and a comparison of performance with other (sequential, parallel, and distributed processing) algorithms that are found in the literature is presented. The obtained results show that the cooperation of threads carried out by means of effective-address procedure permits to simulated annealing to work with increased efficacy and efficiency for problems of JSSP. View Full-Text
Keywords: effective-address; hamming distance; thread; critical section effective-address; hamming distance; thread; critical section
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Cruz-Chávez, M.A.; Peralta-Abarca, J.C.; Cruz-Rosales, M.H. Cooperative Threads with Effective-Address in Simulated Annealing Algorithm to Job Shop Scheduling Problems. Appl. Sci. 2019, 9, 3360.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Appl. Sci. EISSN 2076-3417 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top