MINIMIZING THE NUMBER OF TARDY JOBS IN A TWO-MACHINE FLOWSHOP PROBLEM WITH NON-SIMULTANEOUS JOB ENTRANCE

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.

MOSLEHI GHASEM; HAKIMIAN ALI; ABOUEI ARDAKAN MOSTAFA

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2013 | Volume:23 | Issue:4 Page(s): 390-400

Download Full-Text

Persian Verion

View:

948

Download:

Cites:

Information Journal Paper

Title

MINIMIZING THE NUMBER OF TARDY JOBS IN A TWO-MACHINE FLOWSHOP PROBLEM WITH NON-SIMULTANEOUS JOB ENTRANCE

Author(s)

MOSLEHI GHASEM | HAKIMIAN ALI | ABOUEI ARDAKAN MOSTAFA | Issue Writer Certificate

Keywords

TWO MACHINE FLOWSHOPQ2

NUMBER OF TARDYQ2

NON-SIMULTANEOUS JOB ENTRANCEQ2

BRANCH AND BOUND ALGORITHMQ2

HEURISTIC ALGORITHMQ2

Abstract

In this paper, minimizing the NUMBER OF TARDY jobs in two-machine flowshop scheduling with NON-SIMULTANEOUS JOB ENTRANCE is discussed. It is proven that the complexity of the problem is NP_hard. Therefore, a HEURISTIC ALGORITHM is proposed to solve the large scale problems. Besides, an exact BRANCH AND BOUND ALGORITHM with utilizing HEURISTIC ALGORITHM as upper bound proposed to achieve optimal solution. Computational results demonstrate that branch and bound method solves problems with 28 jobs in the set High and 20 jobs in the set Low in a reasonable time. Results show the capability of the proposed upper bound, lower bounds and dominance rules. Also, it is shown that the average ratio of optimal solution to the heuristic one with the objective S (1-Ui) is at most 1.11 which is smaller in contrast with other researches in the literature. This ratio proves efficacy of the proposed HEURISTIC ALGORITHM. Finally, according to efficiency of the presented approach, sample problems with large dimensions were solved and their results were displayed.

Cites

No record.

References

No record.

Cite

APA: Copy

MOSLEHI, GHASEM, HAKIMIAN, ALI, & ABOUEI ARDAKAN, MOSTAFA. (2013). MINIMIZING THE NUMBER OF TARDY JOBS IN A TWO-MACHINE FLOWSHOP PROBLEM WITH NON-SIMULTANEOUS JOB ENTRANCE. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 23(4), 390-400. SID. https://sid.ir/paper/65579/en

Vancouver: Copy

MOSLEHI GHASEM, HAKIMIAN ALI, ABOUEI ARDAKAN MOSTAFA. MINIMIZING THE NUMBER OF TARDY JOBS IN A TWO-MACHINE FLOWSHOP PROBLEM WITH NON-SIMULTANEOUS JOB ENTRANCE. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2013;23(4):390-400. Available from: https://sid.ir/paper/65579/en

IEEE: Copy

GHASEM MOSLEHI, ALI HAKIMIAN, and MOSTAFA ABOUEI ARDAKAN, “MINIMIZING THE NUMBER OF TARDY JOBS IN A TWO-MACHINE FLOWSHOP PROBLEM WITH NON-SIMULTANEOUS JOB ENTRANCE,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 23, no. 4, pp. 390–400, 2013, [Online]. Available: https://sid.ir/paper/65579/en

Related Journal Papers