{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T19:21:49Z","timestamp":1770578509447,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T00:00:00Z","timestamp":1451433600000},"content-version":"tdm","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":[[2017,2]]},"DOI":"10.1007\/s10878-015-9984-5","type":"journal-article","created":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T07:46:09Z","timestamp":1451461569000},"page":"626-644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Resource constrained scheduling with general truncated job-dependent learning effect"],"prefix":"10.1007","volume":"33","author":[{"given":"Hongyu","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengqi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"9984_CR1","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1057\/jors.1996.155","volume":"47","author":"GI Adamopoulos","year":"1996","unstructured":"Adamopoulos GI, Pappis CP (1996) Single machine scheduling with flow allowances. J Oper Res Soc 47:1280\u20131285","journal-title":"J Oper Res Soc"},{"key":"9984_CR2","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/17.141275","volume":"39","author":"AB Badiru","year":"1992","unstructured":"Badiru AB (1992) Computational survey of univariate and multivariate learning curve models. IEEE Trans Eng Manag 39:176\u2013188","journal-title":"IEEE Trans Eng Manag"},{"key":"9984_CR3","doi-asserted-by":"crossref","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":"9984_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"D Biskup","year":"2008","unstructured":"Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315\u2013329","journal-title":"Eur J Oper Res"},{"key":"9984_CR5","doi-asserted-by":"crossref","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":"9984_CR6","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","volume":"27","author":"JJ Kanet","year":"1981","unstructured":"Kanet JJ (1981) Minimizing variation of flow time in single machine systems. Manag Sci 27:1453\u20131459","journal-title":"Manag Sci"},{"key":"9984_CR7","unstructured":"Karush W (1939) Minima of functions of several variables with inequalities as side conditions. MS thesis, Department of Mathematics, University of Chicago"},{"key":"9984_CR8","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1016\/S0305-0548(03)00103-5","volume":"31","author":"M Kaspi","year":"2004","unstructured":"Kaspi M, Shabtay D (2004) Convex resource allocation for minimizing the makespan in a single machine with job release dates. Comput Oper Res 31:1481\u20131489","journal-title":"Comput Oper Res"},{"key":"9984_CR9","first-page":"481","volume-title":"Nonlinear programming","author":"HW Kuhn","year":"1951","unstructured":"Kuhn HW, Tucker AW (1951) Nonlinear programming. Proceedings of the second symposium. University of California Press, Berkeley, pp 481\u2013492"},{"key":"9984_CR10","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1080\/00207543.2014.954057","volume":"53","author":"G Li","year":"2015","unstructured":"Li G, Luo M-L, Zhang W-J, Wang X-Y (2015) Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int J Prod Res 53:1228\u20131241","journal-title":"Int J Prod Res"},{"key":"9984_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s11590-012-0467-7","volume":"8","author":"Y-Y Lu","year":"2014","unstructured":"Lu Y-Y, Li G, Wu Y-B, Ji P (2014) Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optim Lett 8:113\u2013127","journal-title":"Optim Lett"},{"key":"9984_CR12","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/moor.15.4.736","volume":"15","author":"CL Monma","year":"1990","unstructured":"Monma CL, Schrijver A, Todd MJ, Wei VK (1990) Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Math Oper Res 15:736\u2013748","journal-title":"Math Oper Res"},{"key":"9984_CR13","doi-asserted-by":"crossref","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":"9984_CR14","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"SS Panwalker","year":"1982","unstructured":"Panwalker SS, Smith ML, Seidmann A (1982) Common due-date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30:391\u2013399","journal-title":"Oper Res"},{"key":"9984_CR15","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: algorithms and complexity. Prentice-Hall, Englewood Cliffs"},{"key":"9984_CR16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.ejor.2012.04.037","volume":"222","author":"K Rustogi","year":"2012","unstructured":"Rustogi K, Strusevich VA (2012) Simple matching vs linear assignment in scheduling models with positional effects: a critical review. Eur J Oper Res 222:393\u2013407","journal-title":"Eur J Oper Res"},{"key":"9984_CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/00207548108956667","volume":"19","author":"A Seidmann","year":"1981","unstructured":"Seidmann A, Panwalkar SS, Smith ML (1981) Optimal assignment of due dates for a single processor scheduling problem. Int J Prod Res 19:393\u2013399","journal-title":"Int J Prod Res"},{"issue":"13","key":"9984_CR18","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155(13):1643\u20131666","journal-title":"Discret Appl Math"},{"key":"9984_CR19","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10951-010-0208-7","volume":"14","author":"D Shabtay","year":"2011","unstructured":"Shabtay D, Steiner G (2011) A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. J Sched 14:455\u2013469","journal-title":"J Sched"},{"key":"9984_CR20","doi-asserted-by":"crossref","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"},{"key":"9984_CR21","doi-asserted-by":"crossref","first-page":"1450036","DOI":"10.1142\/S0217595914500365","volume":"31","author":"JB Wang","year":"2014","unstructured":"Wang JB, Wang MZ (2014) Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia Pac J Oper Res 31:1450036","journal-title":"Asia Pac J Oper Res"},{"key":"9984_CR22","doi-asserted-by":"crossref","first-page":"5826","DOI":"10.1080\/00207543.2015.1010746","volume":"53","author":"J-B Wang","year":"2015","unstructured":"Wang J-B, Wang J-J (2015) Research on scheduling with job-dependent learning effect and convex resource dependent processing times. Int J Prod Res 53:5826\u20135836","journal-title":"Int J Prod Res"},{"key":"9984_CR23","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.cie.2010.06.002","volume":"59","author":"D Wang","year":"2010","unstructured":"Wang D, Wang M-Z, Wang J-B (2010) Single-machine scheduling with learning effect and resource-dependent processing times. Comput Ind Eng 59:458\u2013462","journal-title":"Comput Ind Eng"},{"key":"9984_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1057\/jors.2012.46","volume":"64","author":"C-C Wu","year":"2013","unstructured":"Wu C-C, Yin Y, Cheng S-R (2013) Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J Oper Res Soc 64:147\u2013156","journal-title":"J Oper Res Soc"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9984-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9984-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9984-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9984-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:28Z","timestamp":1559276608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9984-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,30]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9984"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9984-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,30]]}}}