OPTIMALITY OF THE FLEXIBLE JOB SHOP SCHEDULING SYSTEM BASED ON GRAVITATIONAL SEARCH 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.

BARZEGAR BEHNAM; MOTAMENI HOMAYUN

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

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2011 | Volume:2 | Issue:4 (6) Page(s): 1-12

Download Full-Text

View:

345

Download:

168

Cites:

Information Journal Paper

Title

OPTIMALITY OF THE FLEXIBLE JOB SHOP SCHEDULING SYSTEM BASED ON GRAVITATIONAL SEARCH ALGORITHM

Author(s)

BARZEGAR BEHNAM | MOTAMENI HOMAYUN | Issue Writer Certificate

Keywords

GRAVITATIONAL SEARCH ALGORITHM

FLEXIBLE JOB SHOP SCHEDULING PROBLEM

MAKESPAN

MASS

GRAVITATIONAL FORCE

Abstract

The FLEXIBLE JOB SHOP SCHEDULING PROBLEM (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machines, such that the maximal completion time (makespan) of all operations is minimized. The scheduling objective minimizes the maximal completion time of all the operations, which is denoted by MAKESPAN. The goal of this research is to develop an efficient scheduling method based on Gravitational local search algorithm to address FJSP. we could reduce scheduling time and costs by transferring and delivering operations on existing machines, that is among NP-hard problems. Different methods and algorithms have been presented for solving this problem. Having a reasonable scheduled production system has significant influence on improving effectiveness and attaining to organization goals. In this paper, we design algorithm were proposed for FLEXIBLE JOB SHOP SCHEDULING PROBLEM (FJSP-GSA), that is based on GRAVITATIONAL SEARCH ALGORITHM (GSA). The experimental results showed that the proposed method has reasonable performance in comparison with other algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

BARZEGAR, BEHNAM, & MOTAMENI, HOMAYUN. (2011). OPTIMALITY OF THE FLEXIBLE JOB SHOP SCHEDULING SYSTEM BASED ON GRAVITATIONAL SEARCH ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 2(4 (6)), 1-12. SID. https://sid.ir/paper/328683/en

Vancouver: Copy

BARZEGAR BEHNAM, MOTAMENI HOMAYUN. OPTIMALITY OF THE FLEXIBLE JOB SHOP SCHEDULING SYSTEM BASED ON GRAVITATIONAL SEARCH ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2011;2(4 (6)):1-12. Available from: https://sid.ir/paper/328683/en

IEEE: Copy

BEHNAM BARZEGAR, and HOMAYUN MOTAMENI, “OPTIMALITY OF THE FLEXIBLE JOB SHOP SCHEDULING SYSTEM BASED ON GRAVITATIONAL SEARCH ALGORITHM,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 2, no. 4 (6), pp. 1–12, 2011, [Online]. Available: https://sid.ir/paper/328683/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops