MULTI-OBJECTIVE UNRELATED PARALLEL MACHINES SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENCE CONSTRAINTS

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.; TAHERI F.; BAZAZI M.

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

Journal Paper

Paper Information

Journal: International Journal of Engineering Year:2008 | Volume:21 | Issue:3 (TRANSACTIONS A: BASICS) Page(s): 269-278

Download Full-Text

View:

420

Download:

276

Cites:

Information Journal Paper

Title

MULTI-OBJECTIVE UNRELATED PARALLEL MACHINES SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENCE CONSTRAINTS

Author(s)

TAVAKOLI MOGHADAM R. | TAHERI F. | BAZAZI M. | Issue Writer Certificate

Keywords

UNRELATED PARALLEL MACHINE SCHEDULING

MULTI-OBJECTIVE MODEL

SEQUENCE-DEPENDENT SETUP TIMES

PRECEDENCE CONSTRAINTS

Abstract

This paper presents a novel, MULTI-OBJECTIVE MODEL of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. SEQUENCE-DEPENDENT SETUP TIMES embedded in the proposed model may vary in different machines based on their characteristics. This paper proposes a two-level mixed-integer programming for the given problem. By solving the presented model, the associated promising results show the effectiveness of this model for small and medium-sized problems, respectively.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., TAHERI, F., & BAZAZI, M.. (2008). MULTI-OBJECTIVE UNRELATED PARALLEL MACHINES SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENCE CONSTRAINTS. INTERNATIONAL JOURNAL OF ENGINEERING, 21(3 (TRANSACTIONS A: BASICS)), 269-278. SID. https://sid.ir/paper/355692/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., TAHERI F., BAZAZI M.. MULTI-OBJECTIVE UNRELATED PARALLEL MACHINES SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENCE CONSTRAINTS. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2008;21(3 (TRANSACTIONS A: BASICS)):269-278. Available from: https://sid.ir/paper/355692/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, F. TAHERI, and M. BAZAZI, “MULTI-OBJECTIVE UNRELATED PARALLEL MACHINES SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENCE CONSTRAINTS,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 21, no. 3 (TRANSACTIONS A: BASICS), pp. 269–278, 2008, [Online]. Available: https://sid.ir/paper/355692/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops