AN IMPROVED ADAPTIVE GENETIC ALGORITHM FOR JOB SCHEDULING PROBLEM ON PARALLEL ROBOTS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

VAHDATI G.; HABIBIPOUR M.; TOOSIZADEH S.; YAGHOOBI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Majlesi Journal of Electrical Engineering Year:2009 | Volume:3 | Issue:3 (10) Page(s): 59-65

Download Full-Text

Persian Verion

View:

1,600

Download:

Cites:

Information Journal Paper

Title

AN IMPROVED ADAPTIVE GENETIC ALGORITHM FOR JOB SCHEDULING PROBLEM ON PARALLEL ROBOTS

Author(s)

VAHDATI G. | HABIBIPOUR M. | TOOSIZADEH S. | YAGHOOBI M. | Issue Writer Certificate

Keywords

PARALLEL ROBOTS SCHEDULINGQ3

GENETIC ALGORITHMQ2

MEAN TARDINESSQ3

Abstract

Minimizing MEAN TARDINESS by Job scheduling on parallel robots is very important in the scheduling domain. In this problem, there is a series of n-number independent jobs which are ready to be scheduled at the time of zero. Corresponding to each work, the processing time and duration date are determined. The aim of this approach is to find the order of jobs on the robots for minimizing the MEAN TARDINESS. This problem is in the class of NP-Hard combinational problems. GENETIC ALGORITHM is well known an effective tool for solving combinational optimization problems. In this study, an adaptive nonlinear GENETIC ALGORITHM as well as two heuristic crossover and mutation operators are used. In the algorithm, there is a fitness function based on the MEAN TARDINESS. Therefore, the algorithm which can make the crossover and mutation probability adjusted adaptively and nonlinearly can avoid disadvantage such as premature convergence, low convergence speed and low stability. Experimental results demonstrate that the proposed GENETIC ALGORITHM does not get stuck at a local optimum easily and yet it converges fast and is simple to implement.

Cites

No record.

References

Cite

APA: Copy

VAHDATI, G., HABIBIPOUR, M., TOOSIZADEH, S., & YAGHOOBI, M.. (2009). AN IMPROVED ADAPTIVE GENETIC ALGORITHM FOR JOB SCHEDULING PROBLEM ON PARALLEL ROBOTS. MAJLESI JOURNAL OF ELECTRICAL ENGINEERING, 3(3 (10)), 59-65. SID. https://sid.ir/paper/188234/en

Vancouver: Copy

VAHDATI G., HABIBIPOUR M., TOOSIZADEH S., YAGHOOBI M.. AN IMPROVED ADAPTIVE GENETIC ALGORITHM FOR JOB SCHEDULING PROBLEM ON PARALLEL ROBOTS. MAJLESI JOURNAL OF ELECTRICAL ENGINEERING[Internet]. 2009;3(3 (10)):59-65. Available from: https://sid.ir/paper/188234/en

IEEE: Copy

G. VAHDATI, M. HABIBIPOUR, S. TOOSIZADEH, and M. YAGHOOBI, “AN IMPROVED ADAPTIVE GENETIC ALGORITHM FOR JOB SCHEDULING PROBLEM ON PARALLEL ROBOTS,” MAJLESI JOURNAL OF ELECTRICAL ENGINEERING, vol. 3, no. 3 (10), pp. 59–65, 2009, [Online]. Available: https://sid.ir/paper/188234/en

Related Journal Papers