A TABU SEARCH METHOD FOR A NEW BI-OBJECTIVE OPEN SHOP SCHEDULING PROBLEM BY A FUZZY MULTI-OBJECTIVE DECISION MAKING APPROACH (RESEARCH NOTE)

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.

SERAJ O.; TAVAKOLI MOGHADAM R.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING Year:2009 | Volume:22 | Issue:(3 TRANSACTIONS B: APPLICATION) Page(s): 269-282

Download Full-Text

View:

394

Download:

163

Cites:

Information Journal Paper

Title

A TABU SEARCH METHOD FOR A NEW BI-OBJECTIVE OPEN SHOP SCHEDULING PROBLEM BY A FUZZY MULTI-OBJECTIVE DECISION MAKING APPROACH (RESEARCH NOTE)

Author(s)

SERAJ O. | TAVAKOLI MOGHADAM R. | Issue Writer Certificate

Keywords

OPEN SHOP SCHEDULING PROBLEM

FUZZY MULTI-OBJECTIVE DECISION MAKING

TABU SEARCH

Abstract

This paper proposes a novel, bi-objective mixed-integer mathematical programming for an OPEN SHOP SCHEDULING PROBLEM (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a FUZZY MULTI-OBJECTIVE DECISION MAKING (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can be achieved. Since the OSSP are known as a class of NP-hard problems, a TABU SEARCH (TS) method is thus used to solve several medium to large-sized instances in reasonable runtime. The efficiency of the results obtained by the proposed TS for small, medium and large-sized instances is evaluated by considering the corresponding overall satisfactory level of all objectives. Also the adaptability of the yielded solutions of the proposed TS for the small-sized instances is evaluated by comparing the results reported by the Lingo software. Several experiments on differentsized test problems are considered and the related results are indicated the ability of the proposed TS algorithm to converge to the efficient solutions.

Cites

MINIMIZING THE TOTAL TARDINESS AND MAKESPAN IN AN OPEN SHOP SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES

References

No record.

Cite

APA: Copy

SERAJ, O., & TAVAKOLI MOGHADAM, R.. (2009). A TABU SEARCH METHOD FOR A NEW BI-OBJECTIVE OPEN SHOP SCHEDULING PROBLEM BY A FUZZY MULTI-OBJECTIVE DECISION MAKING APPROACH (RESEARCH NOTE). INTERNATIONAL JOURNAL OF ENGINEERING, 22((3 TRANSACTIONS B: APPLICATION)), 269-282. SID. https://sid.ir/paper/561764/en

Vancouver: Copy

SERAJ O., TAVAKOLI MOGHADAM R.. A TABU SEARCH METHOD FOR A NEW BI-OBJECTIVE OPEN SHOP SCHEDULING PROBLEM BY A FUZZY MULTI-OBJECTIVE DECISION MAKING APPROACH (RESEARCH NOTE). INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2009;22((3 TRANSACTIONS B: APPLICATION)):269-282. Available from: https://sid.ir/paper/561764/en

IEEE: Copy

O. SERAJ, and R. TAVAKOLI MOGHADAM, “A TABU SEARCH METHOD FOR A NEW BI-OBJECTIVE OPEN SHOP SCHEDULING PROBLEM BY A FUZZY MULTI-OBJECTIVE DECISION MAKING APPROACH (RESEARCH NOTE),” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 22, no. (3 TRANSACTIONS B: APPLICATION), pp. 269–282, 2009, [Online]. Available: https://sid.ir/paper/561764/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops