{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T03:08:38Z","timestamp":1708657718215},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11590-021-01805-1","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T05:02:37Z","timestamp":1632718957000},"page":"1817-1833","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Single machine batch scheduling with non-increasing time slot costs"],"prefix":"10.1007","volume":"16","author":[{"given":"Junfeng","family":"Ren","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"key":"1805_CR1","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur J Oper Res 187, 985\u20131032 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2006.06.060","journal-title":"Eur J Oper Res"},{"key":"1805_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-662-48054-0_18","volume-title":"Mathematical foundations of computer science 2015","author":"L Chen","year":"2015","unstructured":"Chen, L., Megow, N., Rischke, R., Stougie, L., Verschae, J.: Optimal Algorithms and a PTAS for Cost-Aware Scheduling. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) Mathematical foundations of computer science 2015, pp. 211\u2013222. Springer, Berlin, Heidelberg (2015)"},{"key":"1805_CR3","first-page":"1068","volume":"35","author":"R Chen","year":"2015","unstructured":"Chen, R., Qin, L., Tang, G.: Scheduling with outsourcing and variable time slot costs. J Math 35, 1068\u20131074 (2015)","journal-title":"J Math"},{"key":"1805_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF02248589","volume":"26","author":"EG Coffman","year":"1990","unstructured":"Coffman, E.G., Yannakakis, M., Magazine, M.J., Santos, C.: Batch sizing and job sequencing on a single machine. Ann Oper Res 26, 135\u2013147 (1990). https:\/\/doi.org\/10.1007\/BF02248589","journal-title":"Ann Oper Res"},{"key":"1805_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0167-6377(97)00028-X","volume":"21","author":"JB Ghosh","year":"1997","unstructured":"Ghosh, J.B., Gupta, J.N.D.: Batch scheduling to minimize maximum lateness. Oper Res Lett 21, 77\u201380 (1997). https:\/\/doi.org\/10.1016\/S0167-6377(97)00028-X","journal-title":"Oper Res Lett"},{"key":"1805_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0167-6377(94)90063-9","volume":"16","author":"DS Hochbaum","year":"1994","unstructured":"Hochbaum, D.S., Landy, D.: Scheduling with batching: minimizing the weighted number of tardy jobs. Oper. Res. Lett. 16, 79\u201386 (1994). https:\/\/doi.org\/10.1016\/0167-6377(94)90063-9","journal-title":"Oper. Res. Lett."},{"key":"1805_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.asoc.2018.02.018","volume":"66","author":"S Lu","year":"2018","unstructured":"Lu, S., Liu, X., Pei, J.T., Thai, M.M., Pardalos, P.: A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity. Appl Soft Comput 66, 168\u2013182 (2018). https:\/\/doi.org\/10.1016\/j.asoc.2018.02.018","journal-title":"Appl Soft Comput"},{"key":"1805_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2020.113195","volume":"384","author":"S Lu","year":"2021","unstructured":"Lu, S., Pei, J., Liu, X., Pardalos, P.M.: A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities. J. Comput. Appl. Math. 384, 113195 (2021). https:\/\/doi.org\/10.1016\/j.cam.2020.113195","journal-title":"J. Comput. Appl. Math."},{"key":"1805_CR9","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10951-019-00619-5","volume":"23","author":"S Lu","year":"2020","unstructured":"Lu, S., Pei, J., Liu, X., Qian, X., Mladenovic, N., Pardalos, P.M.: Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing. J Sched. 23, 649\u2013664 (2020). https:\/\/doi.org\/10.1007\/s10951-019-00619-5","journal-title":"J Sched."},{"key":"1805_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.orl.2004.09.007","volume":"33","author":"G Mosheiov","year":"2005","unstructured":"Mosheiov, G., Oron, D., Ritov, Y.: Minimizing flow-time on a single machine with integer batch sizes. Oper. Res. Lett. 33, 497\u2013501 (2005). https:\/\/doi.org\/10.1016\/j.orl.2004.09.007","journal-title":"Oper. Res. Lett."},{"key":"1805_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: A review. European J. Oper. Res. 120, 228\u2013249 (2000). https:\/\/doi.org\/10.1016\/S0377-2217(99)00153-8","journal-title":"European J. Oper. Res."},{"key":"1805_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ijpe.2004.04.013","volume":"105","author":"D Quadt","year":"2007","unstructured":"Quadt, D., Kuhn, H.: Batch scheduling of jobs with identical process times on flexible flow lines. Int. J. Prod. Econ. 105, 385\u2013401 (2007). https:\/\/doi.org\/10.1016\/j.ijpe.2004.04.013","journal-title":"Int. J. Prod. Econ."},{"key":"1805_CR13","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.omega.2007.11.002","volume":"36","author":"L Tang","year":"2008","unstructured":"Tang, L., Wang, G.: Decision support system for the batching problems of steelmaking and continuous-casting production. Omega 36, 976\u2013991 (2008). https:\/\/doi.org\/10.1016\/j.omega.2007.11.002","journal-title":"Omega"},{"key":"1805_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/nav.20393","volume":"57","author":"G Wan","year":"2010","unstructured":"Wan, G., Qi, X.: Scheduling with variable time slot costs. Naval Res. Logistics. 57, 159\u2013171 (2010). https:\/\/doi.org\/10.1002\/nav.20393","journal-title":"Naval Res. Logistics."},{"key":"1805_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2020.03.018","volume":"821","author":"K Wang","year":"2020","unstructured":"Wang, K.: Calibration scheduling with time slot cost. Theoret. Comput. Sci. 821, 1\u201314 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.03.018","journal-title":"Theoret. Comput. Sci."},{"key":"1805_CR16","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster, S., Baker, K.R.: Scheduling Groups of Jobs on a Single Machine. Oper. Res. 43, 692\u2013703 (1995). https:\/\/doi.org\/10.1287\/opre.43.4.692","journal-title":"Oper. Res."},{"key":"1805_CR17","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.ijpe.2004.04.014","volume":"105","author":"JJ Yuan","year":"2007","unstructured":"Yuan, J.J., Lin, Y.X., Cheng, T.C.E., Ng, C.T.: Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time. Int. J. Prod. Econ. 105, 402\u2013406 (2007)","journal-title":"Int. J. Prod. Econ."},{"key":"1805_CR18","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10951-015-0462-9","volume":"19","author":"Y Zhao","year":"2016","unstructured":"Zhao, Y., Qi, X., Li, M.: On scheduling with non-increasing time slot cost to minimize total weighted completion time. J Sched. 19, 759\u2013767 (2016). https:\/\/doi.org\/10.1007\/s10951-015-0462-9","journal-title":"J Sched."},{"key":"1805_CR19","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-642-25766-7_90","volume-title":"Recent Advances in Computer Science and Information Engineering","author":"W Zhong","year":"2012","unstructured":"Zhong, W., Liu, X.: A Single Machine Scheduling Problem with Time Slot Costs. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds.) Recent Advances in Computer Science and Information Engineering, pp. 677\u2013681. Springer, Berlin Heidelberg, Berlin, Heidelberg (2012)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01805-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01805-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01805-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T11:18:24Z","timestamp":1654514304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01805-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1805"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01805-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,27]]},"assertion":[{"value":"22 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and material"}}]}}