NO-WAIT HYBRID FLOWSHOP SCHEDULING: MODELS AND SOLOTION ALGORITHMS

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.

NADERI BAHMAN

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES Year:2017 | Volume:14 | Issue:43 Page(s): 53-77

Download Full-Text

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

Persian Verion

View:

679

Download:

Cites:

Information Journal Paper

Title

NO-WAIT HYBRID FLOWSHOP SCHEDULING: MODELS AND SOLOTION ALGORITHMS

Author(s)

NADERI BAHMAN | Issue Writer Certificate

Keywords

HYBRID FLOW SHOPQ1

NO-WAIT SCHEDULING PROBLEMQ1

MIXED INTEGER MATHEMATICAL PROGRAMMINGQ1

SIMULATED ANNEALINGQ1

IMPERIALIST COMPETITIVE ALGORITHMQ1

Abstract

In this paper hybrid flowshop scheduling problem where some jobs, not all, have to follow no-wait restriction (that is, the operations of that job must be processed with no stop) is examined. In the literature, all papers assume that all jobs of the shops have to follow no-wait restrictions. First, this paper mathematically formulates the problem with two different mixed integer linear models under proposed considerations. The models are evaluated using two performance measures of size complexity and computational complexity. The small instances of the problem are solved using commercial software of mathematical programming. To solve larger instances of problem, two solution algorithms have been developed. These two algorithms are based on IMPERIALIST COMPETITIVE ALGORITHM and SIMULATED ANNEALING. A comprehensive numerical experiment including small and large instances is conducted to evaluate the models and algorithms. The results show that the IMPERIALIST COMPETITIVE ALGORITHM outperforms SIMULATED ANNEALING.

Cites

No record.

References

No record.

Cite

APA: Copy

NADERI, BAHMAN. (2017). NO-WAIT HYBRID FLOWSHOP SCHEDULING: MODELS AND SOLOTION ALGORITHMS. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, 14(43 ), 53-77. SID. https://sid.ir/paper/213231/en

Vancouver: Copy

NADERI BAHMAN. NO-WAIT HYBRID FLOWSHOP SCHEDULING: MODELS AND SOLOTION ALGORITHMS. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES[Internet]. 2017;14(43 ):53-77. Available from: https://sid.ir/paper/213231/en

IEEE: Copy

BAHMAN NADERI, “NO-WAIT HYBRID FLOWSHOP SCHEDULING: MODELS AND SOLOTION ALGORITHMS,” JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, vol. 14, no. 43 , pp. 53–77, 2017, [Online]. Available: https://sid.ir/paper/213231/en

Related Journal Papers