@inproceedings{50ba11a00ab74bbc9bb1472bd1fd1829,
title = "Single Machine Lot Scheduling to Minimize Maximum Weighted Completion Time",
abstract = "In manufacturing, it is common for manufacturers to receive customized orders with varying quantities and priority levels. This work focuses on the situation 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. By proving that processing orders in non-increasing sequence of their weights yields an optimal schedule, we conclude that the problem can be solved in polynomial time.",
keywords = "Lot scheduling, Maximum weighted completion time, Order-splitting, Single machine",
author = "Feifeng Zheng and Na Li and Ming Liu and Yinfeng Xu",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.; 30th International Computing and Combinatorics Conference, COCOON 2024 ; Conference date: 23-08-2024 Through 25-08-2024",
year = "2025",
doi = "10.1007/978-981-96-1090-7\_36",
language = "英语",
isbn = "9789819610891",
series = "Lecture Notes in Computer Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "445--454",
editor = "Yong Chen and Xiaofeng Gao and Xiaoming Sun and An Zhang",
booktitle = "Computing and Combinatorics - 30th International Conference, COCOON 2024, Proceedings",
}