AN OPTIMUM ALGORITHM FOR FLOW SHOP WITH EARLY/TARDY COST

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.

AMIN NAYERI M.; MOSLEHI G.

مرکز اطلاعات علمی 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:2001 | Volume:12 | Issue:3 Page(s): 191-209

Download Full-Text

Persian Verion

View:

2,320

Download:

Cites:

Information Journal Paper

Title

AN OPTIMUM ALGORITHM FOR FLOW SHOP WITH EARLY/TARDY COST

Author(s)

AMIN NAYERI M. | MOSLEHI G. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

The problem of determining the sequence of a set of jobs with the objective function (OF) for minimizing the maximum earliness and tardiness, is studied. Since this OF is trying to minimizing and diminish the values of earliness and tardiness, it corresponds to different production systems, such as jIT. This OF is studied in problems associated with m machine and n jobs in Flow Shop case (n/m/P/Etmax).Several methods have developed for solving flow shop problems. Two quick heuristic methods, called HI and H2, with the aim of finding proper solutions in short time, are suggested. The branch and bound (BB) optimal method for solving n/rn/P/ETmax problems is applied. Offering fair upper and lower bounds results in obtaining optimal solutions in many problems. 400 n/rn/P/ETmax problems of small, medium and large sizes are randomly generated.For 83% of problems, optimal solutions are obtained, by BB method. The associated ranges for these problems are 4 to 75 machines and 4 to 50 jobs.

Cites

No record.

References

No record.

Cite

APA: Copy

AMIN NAYERI, M., & MOSLEHI, G.. (2001). AN OPTIMUM ALGORITHM FOR FLOW SHOP WITH EARLY/TARDY COST. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 12(3), 191-209. SID. https://sid.ir/paper/65852/en

Vancouver: Copy

AMIN NAYERI M., MOSLEHI G.. AN OPTIMUM ALGORITHM FOR FLOW SHOP WITH EARLY/TARDY COST. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2001;12(3):191-209. Available from: https://sid.ir/paper/65852/en

IEEE: Copy

M. AMIN NAYERI, and G. MOSLEHI, “AN OPTIMUM ALGORITHM FOR FLOW SHOP WITH EARLY/TARDY COST,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 12, no. 3, pp. 191–209, 2001, [Online]. Available: https://sid.ir/paper/65852/en

Related Journal Papers