A NEW LOWER BOUND FOR FLEXIBLE FLOW SHOP PROBLEM WITH UNRELATED PARALLEL MACHINES

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.

NAHAVANDI NASIM; ASADI GANGRAJ EBRAHIM

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2014 | Volume:25 | Issue:1 Page(s): 65-70

Download Full-Text

View:

285

Download:

120

Cites:

Information Journal Paper

Title

A NEW LOWER BOUND FOR FLEXIBLE FLOW SHOP PROBLEM WITH UNRELATED PARALLEL MACHINES

Author(s)

NAHAVANDI NASIM | ASADI GANGRAJ EBRAHIM | Issue Writer Certificate

Keywords

LOWER BOUND

FLEXIBLE FLOW SHOP

MAKESPAN

UNRELATED PARALLEL MACHINES

Abstract

Flexible flow shop scheduling problem (FFS) with UNRELATED PARALLEL MACHINES contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessment the quality of this heuristic, this paper develop a global LOWER BOUND on FFS MAKESPAN problems with UNRELATED PARALLEL MACHINES.

Cites

No record.

References

No record.

Cite

APA: Copy

NAHAVANDI, NASIM, & ASADI GANGRAJ, EBRAHIM. (2014). A NEW LOWER BOUND FOR FLEXIBLE FLOW SHOP PROBLEM WITH UNRELATED PARALLEL MACHINES. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 25(1), 65-70. SID. https://sid.ir/paper/641346/en

Vancouver: Copy

NAHAVANDI NASIM, ASADI GANGRAJ EBRAHIM. A NEW LOWER BOUND FOR FLEXIBLE FLOW SHOP PROBLEM WITH UNRELATED PARALLEL MACHINES. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2014;25(1):65-70. Available from: https://sid.ir/paper/641346/en

IEEE: Copy

NASIM NAHAVANDI, and EBRAHIM ASADI GANGRAJ, “A NEW LOWER BOUND FOR FLEXIBLE FLOW SHOP PROBLEM WITH UNRELATED PARALLEL MACHINES,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 25, no. 1, pp. 65–70, 2014, [Online]. Available: https://sid.ir/paper/641346/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops