{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T01:02:23Z","timestamp":1776128543173,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10878-020-00676-z","type":"journal-article","created":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T12:02:43Z","timestamp":1609502563000},"page":"290-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times"],"prefix":"10.1007","volume":"41","author":[{"given":"Ji-Bo","family":"Wang","sequence":"first","affiliation":[]},{"given":"Bo","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Wei-Wei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,1]]},"reference":[{"key":"676_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173\u2013178","journal-title":"Eur J Oper Res"},{"key":"676_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2001","unstructured":"Brucker P (2001) Scheduling algorithms, 3rd edn. Springer, Berlin","edition":"3"},{"key":"676_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ijpe.2012.03.027","volume":"141","author":"TCE Cheng","year":"2013","unstructured":"Cheng TCE, Wu C-C, Chen J-C, Wu W-H, Cheng S-R (2013) Two-machine flowshop scheduling with a truncated learning function to minimize the makespan. Int J Prod Econ 141:79\u201386","journal-title":"Int J Prod Econ"},{"key":"676_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69446-5_5","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin"},{"key":"676_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 RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"key":"676_CR6","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall NG, Posner ME (1991) Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper Res 39:836\u2013846","journal-title":"Oper Res"},{"key":"676_CR7","volume-title":"Inequalities","author":"GH Hardy","year":"1967","unstructured":"Hardy GH, Littlewood JE, Polya G (1967) Inequalities, 2nd edn. Cambridge University Press, Cambridge","edition":"2"},{"issue":"1","key":"676_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/0305215X.2019.1573898","volume":"52","author":"C Jiang","year":"2020","unstructured":"Jiang C, Zou D, Bai D, Wang J-B (2020) Proportionate flowshop scheduling with position-dependent weights. Eng Optim 52(1):37\u201352","journal-title":"Eng Optim"},{"key":"676_CR9","unstructured":"Kahlbacher H (1992) Termin-und Ablaufplanung-ein analytischer Zugang. Ph.D. thesis, University of Kaiserslautern"},{"key":"676_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.ijpe.2010.03.016","volume":"126","author":"C Koulamas","year":"2010","unstructured":"Koulamas C, Kyparisis GJ (2010) Single-machine scheduling problems with past-sequence-dependent delivery times. Int J Prod Econ 126:264\u2013266","journal-title":"Int J Prod Econ"},{"key":"676_CR11","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/s00521-016-2638-4","volume":"29","author":"L Li","year":"2018","unstructured":"Li L, Yan P, Ji P, Wang J-B (2018) Scheduling jobs with simultaneous considerations of controllable processing times and learning effect. Neural Comput Appl 29:1155\u20131162","journal-title":"Neural Comput Appl"},{"key":"676_CR12","doi-asserted-by":"publisher","first-page":"9630","DOI":"10.1016\/j.apm.2013.05.025","volume":"37","author":"M Liu","year":"2013","unstructured":"Liu M (2013) Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect. Appl Math Model 37:9630\u20139633","journal-title":"Appl Math Model"},{"issue":"1","key":"676_CR13","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/0305215X.2019.1580705","volume":"52","author":"W Liu","year":"2020","unstructured":"Liu W, Jiang C (2020) Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng Optim 52(1):74\u201389","journal-title":"Eng Optim"},{"key":"676_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2012.03.009","volume":"438","author":"M Liu","year":"2012","unstructured":"Liu M, Zheng F, Chu C, Xu Y (2012a) New results on single-machine scheduling with past-sequence-dependent delivery times. Theor Comput Sci 438:55\u201361","journal-title":"Theor Comput Sci"},{"key":"676_CR15","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ipl.2012.07.002","volume":"112","author":"M Liu","year":"2012","unstructured":"Liu M, Zheng F, Chu C, Xu Y (2012b) Single-machine scheduling with past-sequence-dependent delivery times and release times. Inf Process Lett 112:835\u2013838","journal-title":"Inf Process Lett"},{"key":"676_CR16","doi-asserted-by":"crossref","unstructured":"Liu M, Wang S, Chu, (2013) Scheduling deteriorating jobs with past-sequence-dependent delivery times. Int J Prod Econ 144:418\u2013421","DOI":"10.1016\/j.ijpe.2013.03.009"},{"key":"676_CR17","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/0305215X.2016.1197611","volume":"49","author":"W Liu","year":"2017","unstructured":"Liu W, Hu X, Wang X-Y (2017) Single machine scheduling with slack due dates assignment. Eng Optim 49:709\u2013717","journal-title":"Eng Optim"},{"key":"676_CR18","doi-asserted-by":"publisher","first-page":"3447","DOI":"10.1016\/j.apm.2015.09.081","volume":"40","author":"Y-Y Lu","year":"2016","unstructured":"Lu Y-Y (2016) Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs. Appl Math Model 40:3447\u20133450","journal-title":"Appl Math Model"},{"key":"676_CR19","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1080\/0305215X.2017.1414207","volume":"50","author":"Y-Y Lu","year":"2018","unstructured":"Lu Y-Y, Liu J-Y (2018) A note on resource allocation scheduling with position-dependent workloads. Eng Optim 50:1810\u20131827","journal-title":"Eng Optim"},{"key":"676_CR20","doi-asserted-by":"publisher","first-page":"1550026","DOI":"10.1142\/S0217595915500268","volume":"32","author":"Y-Y Lu","year":"2015","unstructured":"Lu Y-Y, Teng F, Feng Z-X (2015) Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects. Asia Pac J Oper Res 32:1550026","journal-title":"Asia Pac J Oper Res"},{"key":"676_CR21","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1007\/s00521-015-1993-x","volume":"27","author":"Y-Y Lu","year":"2016","unstructured":"Lu Y-Y, Jin J, Ji P, Wang J-B (2016) Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine. Neural Comput Appl 27:1993\u20132000","journal-title":"Neural Comput Appl"},{"key":"676_CR22","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.ipl.2010.11.016","volume":"111","author":"G Mosheiov","year":"2011","unstructured":"Mosheiov G (2011) Proportionate flowshops with general position-dependent processing times. Inf Process Lett 111:174\u2013177","journal-title":"Inf Process Lett"},{"key":"676_CR23","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0377-2217(02)00358-2","volume":"147","author":"G Mosheiov","year":"2003","unstructured":"Mosheiov G, Sidney JB (2003) Scheduling with general job-dependent learning curves. Eur J Oper Res 147:665\u2013670","journal-title":"Eur J Oper Res"},{"key":"676_CR24","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.cor.2014.12.006","volume":"58","author":"J-J Wang","year":"2015","unstructured":"Wang J-J, Zhang B-H (2015) Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects. Comput Oper Res 58:24\u201331","journal-title":"Comput Oper Res"},{"key":"676_CR25","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s11590-011-0334-y","volume":"6","author":"J-B Wang","year":"2012","unstructured":"Wang J-B, Ji P, Cheng TCE, Wang D (2012a) Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. Optim Lett 6:1393\u20131409","journal-title":"Optim Lett"},{"key":"676_CR26","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1080\/00207721.2010.542837","volume":"43","author":"J-B Wang","year":"2012","unstructured":"Wang J-B, Wang M-Z, Ji P (2012b) Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs. Int J Syst Sci 43:861\u2013868","journal-title":"Int J Syst Sci"},{"key":"676_CR27","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s11590-012-0579-0","volume":"8","author":"X-R Wang","year":"2014","unstructured":"Wang X-R, Jin J, Wang J-B, Ji P (2014) Single machine scheduling with truncated job-dependent learning effect. Optim Lett 8:669\u2013677","journal-title":"Optim Lett"},{"issue":"3","key":"676_CR28","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1111\/itor.12323","volume":"26","author":"J-B Wang","year":"2019","unstructured":"Wang J-B, Liu F, Wang J-J (2019) Research on $$m$$-machine flow shop scheduling with truncated learning effects. Int Trans Oper Res 26(3):1135\u20131151","journal-title":"Int Trans Oper Res"},{"issue":"9","key":"676_CR29","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1080\/0305215X.2019.1664498","volume":"52","author":"J-B Wang","year":"2020","unstructured":"Wang J-B, Gao M, Wang J-J, Liu L, He H (2020) Scheduling with a position-weighted learning effect and job release dates. Eng Optim 52(9):1475\u20131493","journal-title":"Eng Optim"},{"key":"676_CR30","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s00521-015-1910-3","volume":"27","author":"Y-B Wu","year":"2016","unstructured":"Wu Y-B, Wang J-J (2016) Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times. Neural Comput Appl 27:937\u2013943","journal-title":"Neural Comput Appl"},{"key":"676_CR31","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1057\/jors.2011.155","volume":"63","author":"S-J Yang","year":"2012","unstructured":"Yang S-J, Yang D-L (2012) Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times. J Oper Res Soc 63:1508\u20131515","journal-title":"J Oper Res Soc"},{"key":"676_CR32","doi-asserted-by":"crossref","first-page":"323","DOI":"10.3934\/jimo.2013.9.323","volume":"9","author":"Y Yin","year":"2013","unstructured":"Yin Y, Cheng TCE, Xu J, Cheng S-R, Wu C-C (2013) Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration. J Ind Manag Optim 9:323\u2013339","journal-title":"J Ind Manag Optim"},{"key":"676_CR33","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s12190-013-0722-9","volume":"45","author":"C Zhao","year":"2014","unstructured":"Zhao C, Tang H (2014) Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times. J Appl Math Comput 45:259\u2013274","journal-title":"J Appl Math Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00676-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00676-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00676-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T06:11:46Z","timestamp":1670652706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00676-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["676"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00676-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]},"assertion":[{"value":"9 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}