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

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.

NOORI DARVISH SAMANEH; TAVAKKOLI MOGHADDAM REZA

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2012 | Volume:8 | Issue:8 Page(s): 1-13

Download Full-Text

View:

358

Download:

105

Cites:

Information Journal Paper

Title

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

Author(s)

NOORI DARVISH SAMANEH | TAVAKKOLI MOGHADDAM REZA | Issue Writer Certificate

Keywords

OPEN SHOP SCHEDULING

TOTAL TARDINESS

MAKESPAN

SEQUENCE-DEPENDENT SETUP TIMES

NSGA-II

SPEA-II

Abstract

We consider an OPEN SHOP SCHEDULING problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the TOTAL TARDINESS and the MAKESPAN. Among several multi-objective decision making (MODM) methods, an interactive one, called the TH method is applied for solving small-sized instances optimally and obtaining Pareto-optimal solutions by the Lingo software. To achieve Pareto-optimal sets for medium to large-sized problems, an improved non-dominated sorting genetic algorithm II (NSGA-II) is presented that consists of a heuristic method for obtaining a good initial population. In addition, by using the design of experiments (DOE), the efficiency of the proposed improved NSGA-II is compared with the efficiency of a well-known multi-objective genetic algorithm, namely SPEAII.Finally, the performance of the improved NSGA-II is examined in a comparison with the performance of the traditional NSGA-II.

Cites

References

Cite

APA: Copy

NOORI DARVISH, SAMANEH, & TAVAKKOLI MOGHADDAM, REZA. (2012). MINIMIZING THE TOTAL TARDINESS AND MAKESPAN IN AN OPEN SHOP SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 8(8), 1-13. SID. https://sid.ir/paper/309922/en

Vancouver: Copy

NOORI DARVISH SAMANEH, TAVAKKOLI MOGHADDAM REZA. MINIMIZING THE TOTAL TARDINESS AND MAKESPAN IN AN OPEN SHOP SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2012;8(8):1-13. Available from: https://sid.ir/paper/309922/en

IEEE: Copy

SAMANEH NOORI DARVISH, and REZA TAVAKKOLI MOGHADDAM, “MINIMIZING THE TOTAL TARDINESS AND MAKESPAN IN AN OPEN SHOP SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 8, no. 8, pp. 1–13, 2012, [Online]. Available: https://sid.ir/paper/309922/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops