A novel mathematical model with an LCA-based solution method to minimize earliness-tardiness costs on a single machine by considering batch delivery

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.

Pourali Zahra; Ebrahimi Bohlool

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

Journal Paper

Paper Information

Journal: Big Data and Computing Visions Year:2025 | Volume:5 | Issue:1 Page(s): 74-93

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A novel mathematical model with an LCA-based solution method to minimize earliness-tardiness costs on a single machine by considering batch delivery

Author(s)

Pourali Zahra | Ebrahimi Bohlool | Issue Writer Certificate

Keywords

scheduling

Earliness tardiness penalties

Batch Delivery

League Championship Algorithm

mathematical programming

Abstract

This paper addresses a practical but complicated version of Just in Time (JIT) problem in which a set of available jobs with known processing times and due dates are processed on a single machine and delivered in batches of arbitrary size. A new mathematical model is developed to minimize the non-convex sum of earliness-tardiness and delivery costs criteria. Due to the limitations imposed by the large size complexity of the proposed model and its nonlinear nature, we use the recently proposed League Championship Algorithm (LCA) to solve arbitrary test problem instances of the problem on hand. Since LCA works in continuous space, we use several representational schemes to map the solutions generated by LCA to discrete space and compare the output of the algorithm under each mapping scenario. To measure how effective LCA is in comparison with the mathematical modeling approach and other heuristic methods, we use the Lingo system and a discrete version of the Imperialistic Competitive Algorithm (ICA) as the comparator algorithms, respectively. Experimental results show that LCA is strongly efficient and dominates the comparator algorithms. At the same time, the time saved by LCA to report the final output is significant, which recommends the use of this algorithm for other practical optimization problems.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans