Single machine lot scheduling to minimize maximum weighted completion time

Feifeng Zheng (), Na Li (), Ming Liu () and Yinfeng Xu ()
Additional contact information
Feifeng Zheng: Donghua University
Na Li: Donghua University
Ming Liu: Tongji University
Yinfeng Xu: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2025, vol. 50, issue 1, No 1, 36 pages

Abstract: Abstract The development of artificial intelligence is a significant factor in the surge in demand for micro-products. Consequently, optimizing production scheduling for micro-products has become crucial in improving efficiency, quality, and competitiveness, which is essential for the sustainable development of the industry. In micro-product manufacturing, it is common for manufacturers to receive customized orders with varying quantities and priority levels. This work focuses on situations where orders are processed in lots with unified capacity on a single machine. Each lot has the potential to accommodate multiple orders, and if necessary, any order can be split and processed in consecutive lots. Each order is characterized by its size and weight. The objective of the problem is to minimize the maximum weighted completion time. In order to investigate the differences in the calculation of completion times for split orders, two mixed-integer linear programming models are established, and the optimal characteristics of these problems are subsequently analyzed. Furthermore, in consideration of the inherent unpredictability of order arrival over time in practice, we also explore the potential of online versions of these problems and propose an online algorithm for online problems. Finally, the experimental results assess the efficacy of the proposed optimality rules and the online algorithm and derive several managerial insights.

Keywords: Micro-products; Lot scheduling; Single machine; Order-splitting; Maximum weighted completion time (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01327-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01327-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01327-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().