MODELLING A NOVEL MULTI-OBJECTIVE OPEN-SHOP SCHEDULING PROBLEM AND SOLVING BY A SCATTER SEARCH METHOD

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.

AMIRI NAFISEH; TAVAKKOLI MOGHADDAM REZA; GHOLIPOUR KANANI YOSOUF; TORABI SEYED ALI

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2012 | Volume:23 | Issue:2 Page(s): 149-160

Download Full-Text

Persian Verion

View:

877

Download:

Cites:

Information Journal Paper

Title

MODELLING A NOVEL MULTI-OBJECTIVE OPEN-SHOP SCHEDULING PROBLEM AND SOLVING BY A SCATTER SEARCH METHOD

Author(s)

AMIRI NAFISEH | TAVAKKOLI MOGHADDAM REZA | GHOLIPOUR KANANI YOSOUF | TORABI SEYED ALI | Issue Writer Certificate

Keywords

OPEN SHOP SCHEDULING PROBLEMSQ2

TARDINESS AND EARLINESS TIMEQ2

MAKESPANQ1

SETUP COSTQ2

NSGA-IIQ2

MULTI-OBJECTIVE SCATTER SEARCHQ2

Abstract

This paper proposes a novel, multi-objective integer programming model for an open-shop scheduling problem (OSSP). Three objectives are to minimize the MAKESPAN, total job tardiness and earliness, and total jobs SETUP COST. Due the complexity to solve such a hard problem, we develop a meta-heuristic algorithm based on multiobjective scatter search (MOSS), and a number of test problems are solved by this proposed algorithm. Finally, to prove its efficiency, the related results are compared with the results obtained by the wellknown multi-objective evolutionary algorithm, called NSGA-II. The results confirm the efficiency and the effectiveness of our proposed MOSS to provide good solutions, especially for medium and largesized problems.

Cites

No record.

References

No record.

Cite

APA: Copy

AMIRI, NAFISEH, TAVAKKOLI MOGHADDAM, REZA, GHOLIPOUR KANANI, YOSOUF, & TORABI, SEYED ALI. (2012). MODELLING A NOVEL MULTI-OBJECTIVE OPEN-SHOP SCHEDULING PROBLEM AND SOLVING BY A SCATTER SEARCH METHOD. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 23(2), 149-160. SID. https://sid.ir/paper/65744/en

Vancouver: Copy

AMIRI NAFISEH, TAVAKKOLI MOGHADDAM REZA, GHOLIPOUR KANANI YOSOUF, TORABI SEYED ALI. MODELLING A NOVEL MULTI-OBJECTIVE OPEN-SHOP SCHEDULING PROBLEM AND SOLVING BY A SCATTER SEARCH METHOD. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2012;23(2):149-160. Available from: https://sid.ir/paper/65744/en

IEEE: Copy

NAFISEH AMIRI, REZA TAVAKKOLI MOGHADDAM, YOSOUF GHOLIPOUR KANANI, and SEYED ALI TORABI, “MODELLING A NOVEL MULTI-OBJECTIVE OPEN-SHOP SCHEDULING PROBLEM AND SOLVING BY A SCATTER SEARCH METHOD,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 23, no. 2, pp. 149–160, 2012, [Online]. Available: https://sid.ir/paper/65744/en

Related Journal Papers