{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:23:14Z","timestamp":1770294194334,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T00:00:00Z","timestamp":1663286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["NRF-2018S1A5B8070344"],"award-info":[{"award-number":["NRF-2018S1A5B8070344"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Research Foundation of Kore","award":["NRF-2021R1A2C1093960"],"award-info":[{"award-number":["NRF-2021R1A2C1093960"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider a two-machine flow shop scheduling problem in which the processing time of each operation is inversely proportional to the power of the amount of resources consumed by it. The objective is to minimize the sum of the makespan and the total resource consumption cost. We show that the problem is NP-hard, and its constrained version remains so. Then, we develop 1.25- and 2-approximation algorithms for the problem and its constrained version, respectively.<\/jats:p>","DOI":"10.1007\/s11590-022-01934-1","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T04:06:47Z","timestamp":1663301207000},"page":"1241-1259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Two-machine flow shop scheduling with convex resource consumption functions"],"prefix":"10.1007","volume":"17","author":[{"given":"Byung-Cheon","family":"Choi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3382-6514","authenticated-orcid":false,"given":"Myoung-Ju","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,16]]},"reference":[{"key":"1934_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470451793","volume-title":"Principles of sequencing and scheeduling","author":"KR Baker","year":"2009","unstructured":"Baker, K.R., Trietsch, D.: Principles of sequencing and scheeduling. Wiley, New Jersey (2009)"},{"key":"1934_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1018943300630","volume":"96","author":"TCE Cheng","year":"2000","unstructured":"Cheng, T.C.E., Janiak, A.: A permutation flow-shop scheduling problem with convex models of operation processing times. Ann. Oper. Res. 96, 39\u201360 (2000)","journal-title":"Ann. Oper. Res."},{"key":"1934_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<253::AID-JOS30>3.0.CO;2-R","volume":"2","author":"TCE Cheng","year":"1999","unstructured":"Cheng, T.C.E., Shakhlevich, N.: Proportionate flow shop with controllable processing times. J. Sched. 2, 253\u2013265 (1999)","journal-title":"J. Sched."},{"key":"1934_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10951-022-00723-z","volume":"25","author":"BC Choi","year":"2022","unstructured":"Choi, B.C., Park, M.-J.: Single-machine scheduling with resource-dependent processing times and multiple unavailability periods. J. Sched. 25, 191\u2013202 (2022)","journal-title":"J. Sched."},{"key":"1934_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(89)90009-4","volume":"32","author":"A Janiak","year":"1989","unstructured":"Janiak, A.: Minimization of resource consumption under a given deadline in the two-processor flop-shop scheduling problem. Inf. Process. Lett. 32, 101\u2013112 (1989)","journal-title":"Inf. Process. Lett."},{"key":"1934_CR6","first-page":"59","volume":"1","author":"A Janiak","year":"2007","unstructured":"Janiak, A., Janiak, W., Lichtenstein, M.: Resource management in machine scheduling problems: a survey. Decision Making Manuf. Serv. 1, 59\u201389 (2007)","journal-title":"Decision Making Manuf. Serv."},{"key":"1934_CR7","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1016\/j.ejor.2004.07.012","volume":"167","author":"RK Kayan","year":"2005","unstructured":"Kayan, R.K., Akturk, M.S.: A new bounding mechanism for the CNC machine scheduling problem with controllable processing times. Eur. J. Oper. Res. 167, 624\u2013643 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"1934_CR8","doi-asserted-by":"publisher","first-page":"2279","DOI":"10.1016\/S0305-0548(03)00187-4","volume":"31","author":"D Shabtay","year":"2004","unstructured":"Shabtay, D., Kaspi, M.: Minimizing the total weighted flow time in a single machine with controllable processing times. Comput. Oper. Res. 31, 2279\u20132289 (2004)","journal-title":"Comput. Oper. Res."},{"key":"1934_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ejor.2004.12.008","volume":"173","author":"D Shabtay","year":"2006","unstructured":"Shabtay, D., Kaspi, M.: Parallel machine scheduling with a convex resource consumption function. Eur. J. Oper. Res. 173, 92\u2013107 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"1934_CR10","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay, D., Steiner, G.: A survey of scheduling with controllable processing times. Discret. Appl. Math. 155, 1643\u20131666 (2007)","journal-title":"Discret. Appl. Math."},{"key":"1934_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1080\/07408170601181674","volume":"39","author":"D Shabtay","year":"2007","unstructured":"Shabtay, D., Kaspi, M., Steiner, G.: The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times. IIE Trans. 39, 539\u2013557 (2007)","journal-title":"IIE Trans."},{"key":"1934_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ijpe.2017.12.025","volume":"198","author":"D Shabtay","year":"2018","unstructured":"Shabtay, D., Zofi, M.: Single machine scheduling with controllable processing times and an unavailablity period to minimize the makespan. Int. J. Prod. Econ. 198, 191\u2013200 (2018)","journal-title":"Int. J. Prod. Econ."},{"key":"1934_CR13","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","volume":"28","author":"RG Vickson","year":"1980","unstructured":"Vickson, R.G.: Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Oper. Res. 28, 1155\u20131167 (1980)","journal-title":"Oper. Res."},{"key":"1934_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10479-010-0827-6","volume":"186","author":"K Xu","year":"2011","unstructured":"Xu, K., Feng, Z., Ke, L.: Single machine scheduling with total tardiness criterion and convex controllable processing times. Ann. Oper. Res. 186, 383\u2013391 (2011)","journal-title":"Ann. Oper. Res."}],"updated-by":[{"DOI":"10.1007\/s11590-023-01982-1","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T00:00:00Z","timestamp":1675296000000}}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01934-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01934-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01934-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T10:33:44Z","timestamp":1683542024000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01934-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,16]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1934"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01934-1","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s11590-023-01982-1","asserted-by":"object"}]},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,16]]},"assertion":[{"value":"7 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11590-023-01982-1","URL":"https:\/\/doi.org\/10.1007\/s11590-023-01982-1","order":7,"name":"change_details","label":"Change Details","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"}}]}}