NEW LOWER BOUNDS FOR THE OPTIMAL MAKESPAN ON A SINGLE BATCH PROCESSING MACHINE

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.

HUSSEINZADEH KASHAN A.; KARIMI B.

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

Journal Paper

Paper Information

Journal: JOURNAL OF MECHANICAL ENGINEERING AMIRKABIR (AMIRKABIR) Year:2012 | Volume:43 | Issue:2 Page(s): 75-84

Download Full-Text

Persian Verion

View:

923

Download:

Cites:

Information Journal Paper

Title

NEW LOWER BOUNDS FOR THE OPTIMAL MAKESPAN ON A SINGLE BATCH PROCESSING MACHINE

Author(s)

HUSSEINZADEH KASHAN A. | KARIMI B. | Issue Writer Certificate

Keywords

SCHEDULINGQ2

BATCH-PROCESSING MACHINEQ3

LOWER BOUNDSQ3

MAKESPANQ3

Abstract

This paper considers minimizing MAKESPAN (Cmax) on a single BATCH-PROCESSING MACHINE. A batch processing machine can process a group of jobs simultaneously, as long as the total size of jobs in the batch does not exceed the machine capacity (B). For each job, we assume a specific job size and job processing time. The processing time of a batch is just the longest processing time of all jobs in the batch. We introduce two new procedures for obtaining LOWER BOUNDS of the optimal MAKESPAN, entitled LB2 and LB3, respectively. We prove that both of the new bounds are tighter than the only existing bound called LB1. We also prove that LB3 is at least as tight as LB2.

Cites

No record.

References

No record.

Cite

APA: Copy

HUSSEINZADEH KASHAN, A., & KARIMI, B.. (2012). NEW LOWER BOUNDS FOR THE OPTIMAL MAKESPAN ON A SINGLE BATCH PROCESSING MACHINE. JOURNAL OF MECHANICAL ENGINEERING AMIRKABIR (AMIRKABIR), 43(2), 75-84. SID. https://sid.ir/paper/165902/en

Vancouver: Copy

HUSSEINZADEH KASHAN A., KARIMI B.. NEW LOWER BOUNDS FOR THE OPTIMAL MAKESPAN ON A SINGLE BATCH PROCESSING MACHINE. JOURNAL OF MECHANICAL ENGINEERING AMIRKABIR (AMIRKABIR)[Internet]. 2012;43(2):75-84. Available from: https://sid.ir/paper/165902/en

IEEE: Copy

A. HUSSEINZADEH KASHAN, and B. KARIMI, “NEW LOWER BOUNDS FOR THE OPTIMAL MAKESPAN ON A SINGLE BATCH PROCESSING MACHINE,” JOURNAL OF MECHANICAL ENGINEERING AMIRKABIR (AMIRKABIR), vol. 43, no. 2, pp. 75–84, 2012, [Online]. Available: https://sid.ir/paper/165902/en

Related Journal Papers