A HYBRID GENETIC ALGORITHM FOR THE OPEN SHOP SCHEDULING WITH MAKESPAN AND TOTAL COMPLETION TIME

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.

BARZEGAR BEHNAM; MOTAMENI HOMAYUN; KHOSROZADEH GHOMI ALI; DIVSALAR AZADEH

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

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2012 | Volume:3 | Issue:4 Page(s): 17-24

Download Full-Text

View:

393

Download:

111

Cites:

Information Journal Paper

Title

A HYBRID GENETIC ALGORITHM FOR THE OPEN SHOP SCHEDULING WITH MAKESPAN AND TOTAL COMPLETION TIME

Author(s)

BARZEGAR BEHNAM | MOTAMENI HOMAYUN | KHOSROZADEH GHOMI ALI | DIVSALAR AZADEH | Issue Writer Certificate

Keywords

OPEN SHOP

GENETICS ALGORITHM

SCHEDULING

Abstract

Proper SCHEDULING of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated SCHEDULING problems is OPEN SHOP SCHEDULING problem. There are jobs in OPEN SHOP SCHEDULING problem which should be processed by m machines. Purpose of SCHEDULING OPEN SHOP problem is attaining to a suitable order of processing jobs by specified machines so that make span can be minimized. OPEN SHOP SCHEDULING problem has very large and complex solution space and so is one of NP-Problems. Till now, different algorithms have been presented for OPEN SHOP SCHEDULING problem. In this paper, we have used combined GENETICS ALGORITHM as a strategy for solving SCHEDULING OPEN SHOP problem and compared proposed algorithm with DGA algorithm. Results show that the proposed algorithm has better effectiveness than DGA algorithm.

Cites

No record.

References

COMPETITIVE GENETIC ALGORITHMS FOR THE OPEN SHOP SCHEDULING PROBLEM

Cite

APA: Copy

BARZEGAR, BEHNAM, MOTAMENI, HOMAYUN, KHOSROZADEH GHOMI, ALI, & DIVSALAR, AZADEH. (2012). A HYBRID GENETIC ALGORITHM FOR THE OPEN SHOP SCHEDULING WITH MAKESPAN AND TOTAL COMPLETION TIME. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 3(4), 17-24. SID. https://sid.ir/paper/328712/en

Vancouver: Copy

BARZEGAR BEHNAM, MOTAMENI HOMAYUN, KHOSROZADEH GHOMI ALI, DIVSALAR AZADEH. A HYBRID GENETIC ALGORITHM FOR THE OPEN SHOP SCHEDULING WITH MAKESPAN AND TOTAL COMPLETION TIME. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2012;3(4):17-24. Available from: https://sid.ir/paper/328712/en

IEEE: Copy

BEHNAM BARZEGAR, HOMAYUN MOTAMENI, ALI KHOSROZADEH GHOMI, and AZADEH DIVSALAR, “A HYBRID GENETIC ALGORITHM FOR THE OPEN SHOP SCHEDULING WITH MAKESPAN AND TOTAL COMPLETION TIME,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 3, no. 4, pp. 17–24, 2012, [Online]. Available: https://sid.ir/paper/328712/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops