OPTIMAL SCHEDULING ON A BATCH PROCESSING MACHINE WITH MINIMUM NUMBER OF TARDY JOBS CRITERIA

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.

JOULAEI F.; RABANI M.

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

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2004 | Volume:15 | Issue:58-D Page(s): 462-468

Download Full-Text

Persian Verion

View:

1,043

Download:

Cites:

Information Journal Paper

Title

OPTIMAL SCHEDULING ON A BATCH PROCESSING MACHINE WITH MINIMUM NUMBER OF TARDY JOBS CRITERIA

Author(s)

JOULAEI F. | RABANI M. | Issue Writer Certificate

Keywords

SCHEDULINGQ4

BATCH PROCESSING MACHINEQ4

MINIMIZING MEAN NUMBER OF TARDY JOBSQ4

DYNAMIC PROGRAMMINGQ4

Abstract

In this paper we consider the problems related to minimizing number of tardy jobs criteria on a single BATCH PROCESSING MACHINE. A batch processor can process several jobs simultaneously as a batch. We developed a polynomial algorithm to find optimal solution for three special cases: fixed sequence of jobs, identical due dates and identical processing times of jobs. Finally, the results and further research fields are discussed.

Cites

No record.

References

No record.

Cite

APA: Copy

JOULAEI, F., & RABANI, M.. (2004). OPTIMAL SCHEDULING ON A BATCH PROCESSING MACHINE WITH MINIMUM NUMBER OF TARDY JOBS CRITERIA. AMIRKABIR, 15(58-D), 462-468. SID. https://sid.ir/paper/852/en

Vancouver: Copy

JOULAEI F., RABANI M.. OPTIMAL SCHEDULING ON A BATCH PROCESSING MACHINE WITH MINIMUM NUMBER OF TARDY JOBS CRITERIA. AMIRKABIR[Internet]. 2004;15(58-D):462-468. Available from: https://sid.ir/paper/852/en

IEEE: Copy

F. JOULAEI, and M. RABANI, “OPTIMAL SCHEDULING ON A BATCH PROCESSING MACHINE WITH MINIMUM NUMBER OF TARDY JOBS CRITERIA,” AMIRKABIR, vol. 15, no. 58-D, pp. 462–468, 2004, [Online]. Available: https://sid.ir/paper/852/en

Related Journal Papers