{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:04:19Z","timestamp":1757617459177,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_36","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:32:41Z","timestamp":1741105961000},"page":"445-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Single Machine Lot Scheduling to\u00a0Minimize Maximum Weighted Completion Time"],"prefix":"10.1007","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Na","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"issue":"3","key":"36_CR1","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.ejor.2016.05.036","volume":"255","author":"A Allahverdi","year":"2016","unstructured":"Allahverdi, A.: A survey of scheduling problems with no-wait in process. Eur. J. Oper. Res. 255(3), 665\u2013686 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"36_CR2","doi-asserted-by":"publisher","first-page":"1850048","DOI":"10.1142\/S0217595918500483","volume":"35","author":"X Chai","year":"2018","unstructured":"Chai, X., Lu, L.F., Li, W.H., Zhang, L.Q.: Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time. Asia-Pacific J. Oper. Res. 35(6), 1850048 (2018)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"5","key":"36_CR3","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s10878-020-00654-5","volume":"43","author":"Y Chen","year":"2022","unstructured":"Chen, Y., Cheng, Y.X., Zhang, G.Q.: Single machine lot scheduling with non-uniform lot capacities and processing times. J. Comb. Optim. 43(5), 1359\u20131367 (2022)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"36_CR4","first-page":"121","volume":"11","author":"Q Feng","year":"2007","unstructured":"Feng, Q., Yuan, J.J.: NP-hardness of a multicriteria scheduling on two families of jobs. OR Trans. 11(4), 121\u2013126 (2007)","journal-title":"OR Trans."},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"36_CR6","first-page":"2350005","volume":"2023","author":"SN Guo","year":"2023","unstructured":"Guo, S.N., Chen, Y.N., Mao, Y.P., Zhang, X.Y.: Online single-processor scheduling with an unexpected breakdown. Asia-Pacific J. Oper. Res. 2023, 2350005 (2023)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"12","key":"36_CR7","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ipl.2014.06.016","volume":"114","author":"Y-T Hou","year":"2014","unstructured":"Hou, Y.-T., Yang, D.-L., Kuo, W.-H.: Lot scheduling on a single machine. Inf. Process. Lett. 114(12), 718\u2013722 (2014)","journal-title":"Inf. Process. Lett."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ins.2021.12.122","volume":"589","author":"M Li","year":"2022","unstructured":"Li, M., Wang, G.G.: A review of green shop scheduling problem. Inf. Sci. 589, 478\u2013496 (2022)","journal-title":"Inf. Sci."},{"issue":"4","key":"36_CR9","doi-asserted-by":"publisher","first-page":"1550030","DOI":"10.1142\/S021759591550030X","volume":"32","author":"WJ Li","year":"2015","unstructured":"Li, W.J.: A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion time. Asia-Pacific J. Oper. Res. 32(4), 1550030 (2015)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s11590-022-01889-3","volume":"17","author":"WJ Li","year":"2023","unstructured":"Li, W.J., Liu, H.L.: Online NDP-constraint scheduling of jobs with delivery times or weights. Optim. Lett. 17(3), 591\u2013612 (2023)","journal-title":"Optim. Lett."},{"key":"36_CR11","doi-asserted-by":"publisher","unstructured":"Liu, M., Liu, Z.Z., Zheng, F.F.: Mathematical models and optimal algorithms for Lot scheduling considering job splitting and due dates in green logistics. Asia-Pacific J. Oper. Res. https:\/\/doi.org\/10.1142\/S0217595923500409","DOI":"10.1142\/S0217595923500409"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Lu, L.F., Zhang, L.Q., Ou, J.W.: Single machine scheduling with rejection to minimize the weighted makespan. In: Algorithmic Aspects in Information and Management: 15th International Conference, 2021, pp. 96\u2013110 (2021)","DOI":"10.1007\/978-3-030-93176-6_9"},{"issue":"2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1080\/0305215X.2020.1722119","volume":"53","author":"B Mor","year":"2021","unstructured":"Mor, B.: Single-machine IoT scheduling with variable IoT processing times. Eng. Optim. 53(2), 321\u2013334 (2021)","journal-title":"Eng. Optim."},{"key":"36_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2020.106009","volume":"164","author":"B Mor","year":"2020","unstructured":"Mor, B., Mosheiov, G., Shapira, D.: Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf. Process. Lett. 164, 106009 (2020)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"36_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-021-00709-1","volume":"42","author":"B Mor","year":"2021","unstructured":"Mor, B., Mosheiov, G.: A note on the single machine CON and CONW problems with lot scheduling. J. Comb. Optim. 42(2), 327\u2013338 (2021)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00651-8","volume":"41","author":"B Mor","year":"2021","unstructured":"Mor, B., Mosheiov, G., Shapira, D.: Single machine Lot scheduling with optional job-rejection. J. Comb. Optim. 41(1), 1\u201311 (2021)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"36_CR17","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10878-023-01040-7","volume":"45","author":"G Mosheiov","year":"2023","unstructured":"Mosheiov, G., Sarig, A.: A note on Lot scheduling on a single machine to minimize maximum weighted tardiness. J. Comb. Optim. 45(5), 128 (2023)","journal-title":"J. Comb. Optim."},{"key":"36_CR18","doi-asserted-by":"publisher","unstructured":"Sun, R.: On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan. In: Cai, Z., Chen, Y., Zhang, J. (eds.) Theoretical Computer Science Singapore, vol. 2022, pp. 236\u2013247. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-19-8152-4_17","DOI":"10.1007\/978-981-19-8152-4_17"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Yang, D-L., Hou, Y-T., Kuo, W-H.: A note on a single-machine lot scheduling problem with indivisible orders. Comput. Oper. Res. 79, 34\u201338 (2017)","DOI":"10.1016\/j.cor.2016.10.004"},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ipl.2018.10.002","volume":"142","author":"E Zhang","year":"2019","unstructured":"Zhang, E., Liu, M., Zheng, F.F., Xu, Y.F.: Single machine Lot scheduling to minimize the total weighted (discounted) completion time. Inf. Process. Lett. 142, 46\u201351 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"13","key":"36_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ifacol.2019.11.115","volume":"52","author":"FF Zheng","year":"2019","unstructured":"Zheng, F.F., Jin, K.Y.: An improved heuristic for single machine lot scheduling problem. IFAC-PapersOnLine 52(13), 217\u2013222 (2019)","journal-title":"IFAC-PapersOnLine"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:07:11Z","timestamp":1757142431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}