A lower bounding method for earliness and tardiness minimization 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.

Keshavarz Taha

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

Journal Paper

Paper Information

Journal: Journal of Industrial and Systems Engineering Year:2020 | Volume:13 | Issue:2 Page(s): 9-26

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A lower bounding method for earliness and tardiness minimization on a single batch processing machine

Author(s)

Keshavarz Taha | Issue Writer Certificate

Keywords

Batch processing machine

just-in-time

lower bound

column generation

Abstract

In this research, the problem of scheduling a single Batch processing machine with non-identical job sizes is considered. The objective is to minimize the total earliness and tardiness of all the jobs. A Batch processing machine can process a group of jobs simultaneously as a batch as long as its capacity is not violated. The processing time of a batch is equal to the maximum processing time of all the jobs in the batch. Since the problem under study is shown to be NP-hard, a lower bounding method based on column generation is proposed. The proposed lower bound can be used for evaluating the performance of the heuristic and metaheuristic algorithms developed for the research problem. The computational experiments are designed to analyze the performance of the proposed lower bound. The results show that the column generation approach can considerably generates better lower bound than the best known lower bounding method in the literature.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Keshavarz, Taha. (2020). A lower bounding method for earliness and tardiness minimization on a single batch processing machine. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), 13(2), 9-26. SID. https://sid.ir/paper/975805/en

Vancouver: Copy

Keshavarz Taha. A lower bounding method for earliness and tardiness minimization on a single batch processing machine. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE)[Internet]. 2020;13(2):9-26. Available from: https://sid.ir/paper/975805/en

IEEE: Copy

Taha Keshavarz, “A lower bounding method for earliness and tardiness minimization on a single batch processing machine,” JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), vol. 13, no. 2, pp. 9–26, 2020, [Online]. Available: https://sid.ir/paper/975805/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops