SCHEDULING OF UNRELATED PARALLEL MACHINES USING TWO MULTI OBJECTIVE GENETIC ALGORITHMS WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENT 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.

SAFAEI S.; NADERI R.; SOHRABI A.; HATAMI A.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ADVANCED DESIGN AND MANUFACTURING TECHNOLOGY Year:2015 | Volume:8 | Issue:4 Page(s): 63-74

Download Full-Text

View:

360

Download:

177

Cites:

Information Journal Paper

Title

SCHEDULING OF UNRELATED PARALLEL MACHINES USING TWO MULTI OBJECTIVE GENETIC ALGORITHMS WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENT CONSTRAINTS

Author(s)

SAFAEI S. | NADERI R. | SOHRABI A. | HATAMI A. | Issue Writer Certificate

Keywords

DATA ENVELOPMENT ANALYSIS

GENETIC ALGORITHM

MAKESPAN

MULTI-OBJECTIVE

NUMBER OF TARDY JOB

PARALLEL MACHINE SCHEDULING

PRECEDENCE CONSTRAINTS

SEQUENCE-DEPENDENT SETUP TIMES

TOPSIS METHOD

Abstract

This paper considers the problem of scheduling N jobs on M unrelated parallel machines with SEQUENCE-DEPENDENT SETUP TIMES. To better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. Furthermore SEQUENCE-DEPENDENT SETUP TIMES and anticipatory setups are included in the proposed model. Our objective is to determine a schedule that minimizes MAKESPAN and NUMBER OF TARDY JOBs. The problem is NP-hard, so for obtaining an optimal solution, in reasonable computational time, we propose two multi objective GENETIC ALGORITHMs (MOGA). To evaluate the proposed algorithms, random test problems are produced in medium and large sizes with tight due dates. After setting the parameters, the performances of these algorithms are evaluated using the concept of DATA ENVELOPMENT ANALYSIS (DEA), distance method, and a number of non-dominated solutions.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

SAFAEI, S., NADERI, R., SOHRABI, A., & HATAMI, A.. (2015). SCHEDULING OF UNRELATED PARALLEL MACHINES USING TWO MULTI OBJECTIVE GENETIC ALGORITHMS WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENT CONSTRAINTS. INTERNATIONAL JOURNAL OF ADVANCED DESIGN AND MANUFACTURING TECHNOLOGY, 8(4), 63-74. SID. https://sid.ir/paper/686730/en

Vancouver: Copy

SAFAEI S., NADERI R., SOHRABI A., HATAMI A.. SCHEDULING OF UNRELATED PARALLEL MACHINES USING TWO MULTI OBJECTIVE GENETIC ALGORITHMS WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENT CONSTRAINTS. INTERNATIONAL JOURNAL OF ADVANCED DESIGN AND MANUFACTURING TECHNOLOGY[Internet]. 2015;8(4):63-74. Available from: https://sid.ir/paper/686730/en

IEEE: Copy

S. SAFAEI, R. NADERI, A. SOHRABI, and A. HATAMI, “SCHEDULING OF UNRELATED PARALLEL MACHINES USING TWO MULTI OBJECTIVE GENETIC ALGORITHMS WITH SEQUENCE-DEPENDENT SETUP TIMES AND PRECEDENT CONSTRAINTS,” INTERNATIONAL JOURNAL OF ADVANCED DESIGN AND MANUFACTURING TECHNOLOGY, vol. 8, no. 4, pp. 63–74, 2015, [Online]. Available: https://sid.ir/paper/686730/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops