Efficient Algorithms for Just-In-Time Scheduling on a 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.

KESHAVARZ T.; Rafiee Parsa N.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2021 | Volume:18 | Issue:2 (69) Page(s): 1-23

Download Full-Text

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

Persian Verion

View:

305

Download:

Cites:

Information Journal Paper

Title

Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine

Author(s)

KESHAVARZ T. | Rafiee Parsa N. | Issue Writer Certificate

Keywords

Batch Processing MachineQ1

Just-In-TimeQ1

Earliness and TardinessQ1

Dynamic ProgrammingQ1

MetaheuristicsQ1

Abstract

Just-In-Time scheduling problem on a single Batch Processing Machine is investigated in this research. Batch Processing Machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of Just-In-Time strategy, the minimization of total Earliness and Tardiness penalties is considered as the criterion. It is an acceptable criterion for both manufacturer and customer. Since the research problem is proven to be NP-hard, the main objective of this research is to develop metaheuristic algorithms for finding efficient upper bounds for industry sized instances. Two algorithms are proposed for the research problem: a Hybrid Genetic Algorithm (HGA), and a Greedy Randomized Adaptive Search Procedure (GRASP). A Dynamic Programming approach is developed to sequence the batches in these algorithms. The computational results, based on available test problems in the literature, demonstrate that the proposed algorithms are effective, especially for large sized instances. The average percentage error of HGA is 6. 82% and the corresponding value for GRASP is 11. 64%. The results also show that the performance of the proposed algorithms is more considerable when the job sizes are small.

Cites

No record.

References

No record.

Cite

APA: Copy

KESHAVARZ, T., & Rafiee Parsa, N.. (2021). Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 18(2 (69) ), 1-23. SID. https://sid.ir/paper/411030/en

Vancouver: Copy

KESHAVARZ T., Rafiee Parsa N.. Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2021;18(2 (69) ):1-23. Available from: https://sid.ir/paper/411030/en

IEEE: Copy

T. KESHAVARZ, and N. Rafiee Parsa, “Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 18, no. 2 (69) , pp. 1–23, 2021, [Online]. Available: https://sid.ir/paper/411030/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops