A PARALLEL MACHINE SCHEDULING PROBLEM MINIMIZING THE TOTAL WEIGHTED EARLINESS AND TOTAL WEIGHTED TARDINESS BY A MULTI-OBJECTIVE 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.

TAVAKOLI MOGHADAM R.; JOULAEI F.; GHANDI BIDGOLI S.

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

Journal Paper

Paper Information

Journal: Year:2009 | Volume:42 | Issue:7 (117) Page(s): 923-934

Download Full-Text

Persian Verion

View:

1,563

Download:

Cites:

Information Journal Paper

Title

A PARALLEL MACHINE SCHEDULING PROBLEM MINIMIZING THE TOTAL WEIGHTED EARLINESS AND TOTAL WEIGHTED TARDINESS BY A MULTI-OBJECTIVE SCATTER SEARCH METHOD

Author(s)

TAVAKOLI MOGHADAM R. | JOULAEI F. | GHANDI BIDGOLI S. | Issue Writer Certificate

Keywords

PARALLEL MACHINE SCHEDULING PROBLEMQ3

TOTAL WEIGHTED EARLINESSQ3

TOTAL WEIGHTED TARDINESSQ3

MULTIQ3

OBJECTIVE SCATTER SEARCHQ3

Abstract

The PARALLEL MACHINE SCHEDULING PROBLEM is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the objectives related to earliness and tardiness penalties have become increasingly popular. In this paper, two major goals are considered as follows: (1) TOTAL WEIGHTED EARLINESS; (2) TOTAL WEIGHTED TARDINESS. Due to the complexity of such a hard problem, a new MULTI-objective meta-heuristic method, i.e. MULTI-objective scatter search (MOSS), is proposed to obtain the locally Pareto-optimal frontier where the simultaneous minimization of the above-mentioned objectives is desired. In order to validate the performance of the proposed MOSS method, in terms of solution quality and diversity level, various test problems are considered and the reliability of this method, based on different comparison metrics, is compared with the Elite Tabu Search (ETS) devised in this paper. The computational results show the high capability of the proposed MOSS method.

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., JOULAEI, F., & GHANDI BIDGOLI, S.. (2009). A PARALLEL MACHINE SCHEDULING PROBLEM MINIMIZING THE TOTAL WEIGHTED EARLINESS AND TOTAL WEIGHTED TARDINESS BY A MULTI-OBJECTIVE SCATTER SEARCH METHOD. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), 42(7 (117)), 923-934. SID. https://sid.ir/paper/14107/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., JOULAEI F., GHANDI BIDGOLI S.. A PARALLEL MACHINE SCHEDULING PROBLEM MINIMIZING THE TOTAL WEIGHTED EARLINESS AND TOTAL WEIGHTED TARDINESS BY A MULTI-OBJECTIVE SCATTER SEARCH METHOD. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN)[Internet]. 2009;42(7 (117)):923-934. Available from: https://sid.ir/paper/14107/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, F. JOULAEI, and S. GHANDI BIDGOLI, “A PARALLEL MACHINE SCHEDULING PROBLEM MINIMIZING THE TOTAL WEIGHTED EARLINESS AND TOTAL WEIGHTED TARDINESS BY A MULTI-OBJECTIVE SCATTER SEARCH METHOD,” JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), vol. 42, no. 7 (117), pp. 923–934, 2009, [Online]. Available: https://sid.ir/paper/14107/en

Related Journal Papers