GENERALIZED CYCLIC OPEN SHOP SCHEDULING AND A HYBRID ALGORITHM

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.

GHANDEHARI MAHSA

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

Journal Paper

Paper Information

Journal: Journal of Industrial and Systems Engineering Year:2008 | Volume:1 | Issue:4 Page(s): 345-359

Download Full-Text

View:

251

Download:

Cites:

Information Journal Paper

Title

GENERALIZED CYCLIC OPEN SHOP SCHEDULING AND A HYBRID ALGORITHM

Author(s)

GHANDEHARI MAHSA | Issue Writer Certificate

Keywords

OPEN SHOP SCHEDULING

CYCLIC OPEN SHOP SCHEDULING

META HEURISTIC

ACO; BEAM SEARCH

Abstract

In this paper, we first introduce a generalized version of OPEN SHOP SCHEDULING (OSS), called generalized cyclic OPEN SHOP SCHEDULING (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. OPEN SHOP SCHEDULING is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However, in our proposed model of GCOSS, processing each operation needs more than one machine (or other resources) simultaneously. Furthermore, the schedule is repeated more than once. It is known that OSS is NP-hard. Therefore, for obtaining a good solution for GCOSS, which is obviously NP-hard, a hybrid algorithm is also developed. This method is constructed by hybridizing ant colony optimization (ACO), beam search and linear programming (LP). To verify the accuracy of the method, we also compare the results of this algorithm with the optimal solution for some special problems.

Cites

No record.

References

No record.

Cite

APA: Copy

GHANDEHARI, MAHSA. (2008). GENERALIZED CYCLIC OPEN SHOP SCHEDULING AND A HYBRID ALGORITHM. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), 1(4), 345-359. SID. https://sid.ir/paper/307060/en

Vancouver: Copy

GHANDEHARI MAHSA. GENERALIZED CYCLIC OPEN SHOP SCHEDULING AND A HYBRID ALGORITHM. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE)[Internet]. 2008;1(4):345-359. Available from: https://sid.ir/paper/307060/en

IEEE: Copy

MAHSA GHANDEHARI, “GENERALIZED CYCLIC OPEN SHOP SCHEDULING AND A HYBRID ALGORITHM,” JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), vol. 1, no. 4, pp. 345–359, 2008, [Online]. Available: https://sid.ir/paper/307060/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops