{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T22:14:45Z","timestamp":1755036885130,"version":"3.41.2"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100002338","name":"Ministry of Education of China","doi-asserted-by":"crossref","award":["18YJA630120"],"award-info":[{"award-number":["18YJA630120"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012456","name":"National Social Science Foundation of China","doi-asserted-by":"crossref","award":["18ZDA058"],"award-info":[{"award-number":["18ZDA058"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"crossref"}]},{"name":"LiaoNing Province Education Department","award":["JYT2020128"],"award-info":[{"award-number":["JYT2020128"]}]},{"DOI":"10.13039\/501100018617","name":"LiaoNing Revitalization Talents Program","doi-asserted-by":"crossref","award":["XLYC2002017"],"award-info":[{"award-number":["XLYC2002017"]}],"id":[{"id":"10.13039\/501100018617","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:p> We consider a single machine scheduling problem with slack due date assignment in which the actual processing time of a job is determined by its position in a sequence, its resource allocation function, and a rate-modifying activity simultaneously. The problem is to determine the optimal job sequence, the optimal common flow allowance, the optimal amount of the resource allocation, and the position of the rate-modifying activity such that the two constrained optimization objective cost functions are minimized. One is minimizing the total penalty cost containing the earliness, tardiness, common flow allowance subject to an upper bound on the total resource cost, the other is minimizing the total resource cost subject to an upper bound on the total penalty cost. For two optimization problems, we show that they can be solved in optimal time, respectively. <\/jats:p>","DOI":"10.1142\/s0217595921500469","type":"journal-article","created":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:51:37Z","timestamp":1632271897000},"source":"Crossref","is-referenced-by-count":6,"title":["Bicriteria Common Flow Allowance Scheduling with Aging Effect, Convex Resource Allocation, and a Rate-Modifying Activity on a Single Machine"],"prefix":"10.1142","volume":"39","author":[{"given":"Xiaoli","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Science, Shenyang Aerospace University, Shenyang 110136, P. R. China"}]},{"given":"Jian","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Data Science and Artificial Intelligence, Dongbei University of Finance and Economics, Dalian 116025, P. R. China"}]},{"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Science, Shenyang Aerospace University, Shenyang 110136, P. R. China"}]},{"given":"Lin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Science, Shenyang Aerospace University, Shenyang 110136, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"key":"S0217595921500469BIB001","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1996.155"},{"key":"S0217595921500469BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00246-X"},{"key":"S0217595921500469BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.05.040"},{"key":"S0217595921500469BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04550-3"},{"key":"S0217595921500469BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.07.013"},{"key":"S0217595921500469BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00181-3"},{"key":"S0217595921500469BIB007","doi-asserted-by":"publisher","DOI":"10.1080\/09537280110069621"},{"key":"S0217595921500469BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"S0217595921500469BIB009","doi-asserted-by":"publisher","DOI":"10.7494\/dmms.2007.1.2.59"},{"key":"S0217595921500469BIB010","doi-asserted-by":"publisher","DOI":"10.7494\/dmms.2011.5.1.19"},{"key":"S0217595921500469BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.08.020"},{"key":"S0217595921500469BIB012","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12121"},{"key":"S0217595921500469BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00066-1"},{"key":"S0217595921500469BIB014","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.954057"},{"key":"S0217595921500469BIB015","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2019.1580705"},{"key":"S0217595921500469BIB016","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595917500117"},{"key":"S0217595921500469BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-012-0467-7"},{"key":"S0217595921500469BIB018","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601215"},{"key":"S0217595921500469BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2006.03.008"},{"key":"S0217595921500469BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.10.007"},{"volume-title":"Combinatorial Optimization: Algorithms and Complexity","year":"1982","author":"Papadimitriou CH","key":"S0217595921500469BIB021"},{"key":"S0217595921500469BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.02.003"},{"key":"S0217595921500469BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.06.002"},{"key":"S0217595921500469BIB024","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595914500365"},{"key":"S0217595921500469BIB025","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1010746"},{"key":"S0217595921500469BIB026","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2016060"},{"key":"S0217595921500469BIB027","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxx121"},{"key":"S0217595921500469BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.08.020"},{"journal-title":"Journal of Industrial and Management Optimization","year":"2021","author":"Wang J-B","key":"S0217595921500469BIB029"},{"key":"S0217595921500469BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2012.09.072"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595921500469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T05:13:07Z","timestamp":1666415587000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0217595921500469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,9]]},"references-count":30,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["10.1142\/S0217595921500469"],"URL":"https:\/\/doi.org\/10.1142\/s0217595921500469","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"type":"print","value":"0217-5959"},{"type":"electronic","value":"1793-7019"}],"subject":[],"published":{"date-parts":[[2021,11,9]]},"article-number":"2150046"}}