FLEXIBLE FLOWSHOP SCHEDULING WITH EQUAL NUMBER OF UNRELATED PARALLEL MACHINES; TECHNICAL NOTE

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.

MAHDAVI I.; ZAREZADEH V.; SHAHNAZARI SHAHREZAEI P.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2011 | Volume:7 | Issue:13 Page(s): 74-83

Download Full-Text

View:

250

Download:

101

Cites:

Information Journal Paper

Title

FLEXIBLE FLOWSHOP SCHEDULING WITH EQUAL NUMBER OF UNRELATED PARALLEL MACHINES; TECHNICAL NOTE

Author(s)

MAHDAVI I. | ZAREZADEH V. | SHAHNAZARI SHAHREZAEI P. | Issue Writer Certificate

Keywords

FLEXIBLE FLOWSHOP

MAKESPAN

UNRELATED MACHINES

Abstract

This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the MAKESPAN for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly generated and results obtained by proposed heuristic are compared with optimal solutions reported by the Lingo 8.0 package applying the branch & bound approach. The results show that the proposed hybrid method is more efficient when the problem sizes have been increased.

Cites

No record.

References

No record.

Cite

APA: Copy

MAHDAVI, I., ZAREZADEH, V., & SHAHNAZARI SHAHREZAEI, P.. (2011). FLEXIBLE FLOWSHOP SCHEDULING WITH EQUAL NUMBER OF UNRELATED PARALLEL MACHINES; TECHNICAL NOTE. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 7(13), 74-83. SID. https://sid.ir/paper/309872/en

Vancouver: Copy

MAHDAVI I., ZAREZADEH V., SHAHNAZARI SHAHREZAEI P.. FLEXIBLE FLOWSHOP SCHEDULING WITH EQUAL NUMBER OF UNRELATED PARALLEL MACHINES; TECHNICAL NOTE. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2011;7(13):74-83. Available from: https://sid.ir/paper/309872/en

IEEE: Copy

I. MAHDAVI, V. ZAREZADEH, and P. SHAHNAZARI SHAHREZAEI, “FLEXIBLE FLOWSHOP SCHEDULING WITH EQUAL NUMBER OF UNRELATED PARALLEL MACHINES; TECHNICAL NOTE,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 7, no. 13, pp. 74–83, 2011, [Online]. Available: https://sid.ir/paper/309872/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops