AN OPTIMUM ALGORITHM FOR SINGLE MACHINE 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 GH.

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

Journal Paper

Paper Information

Journal: ESTEGHLAL Year:2000 | Volume:19 | Issue:1 Page(s): 35-48

Download Full-Text

Persian Verion

View:

1,138

Download:

Cites:

Information Journal Paper

Title

AN OPTIMUM ALGORITHM FOR SINGLE MACHINE WITH EARLY/TARDY COST

Author(s)

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

Keywords

Not Registered.

Abstract

The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied.Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for neighboring jobs have been developed and the dominant set for the optimal solution is determined. Branch and Bound (BB) method is also used for this problem. The strong upper and lower limits are introduced in BB, resulting in optimal solutions to a lot of problems in short time periods. To show the effectiveness of the suggested solution method:" as many as 720 problems in different sizes, with 5 to 100 jobs, have been randomly generated and solved.

Cites

No record.

References

No record.

Cite

APA: Copy

AMIN NAYERI, M., & MOSLEHI, GH.. (2000). AN OPTIMUM ALGORITHM FOR SINGLE MACHINE WITH EARLY/TARDY COST. ESTEGHLAL, 19(1), 35-48. SID. https://sid.ir/paper/5880/en

Vancouver: Copy

AMIN NAYERI M., MOSLEHI GH.. AN OPTIMUM ALGORITHM FOR SINGLE MACHINE WITH EARLY/TARDY COST. ESTEGHLAL[Internet]. 2000;19(1):35-48. Available from: https://sid.ir/paper/5880/en

IEEE: Copy

M. AMIN NAYERI, and GH. MOSLEHI, “AN OPTIMUM ALGORITHM FOR SINGLE MACHINE WITH EARLY/TARDY COST,” ESTEGHLAL, vol. 19, no. 1, pp. 35–48, 2000, [Online]. Available: https://sid.ir/paper/5880/en

Related Journal Papers