{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:33:30Z","timestamp":1777415610789,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T00:00:00Z","timestamp":1295049600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10479-011-0835-1","type":"journal-article","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T11:40:15Z","timestamp":1295005215000},"page":"345-356","source":"Crossref","is-referenced-by-count":14,"title":["Single-machine scheduling problems with time and\u00a0position dependent processing times"],"prefix":"10.1007","volume":"186","author":[{"given":"Xingong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Guangle","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Wanzhen","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Guochun","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,15]]},"reference":[{"key":"835_CR1","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1057\/palgrave.jors.2601359","volume":"53","author":"A. Bachman","year":"2002","unstructured":"Bachman, A., Cheng, T. C. E., Janiak, A., & Ng, C. T. (2002). Scheduling start time dependent jobs to minimize the total weighted completion time. Journal of the Operational Research Society, 53, 688\u2013693.","journal-title":"Journal of the Operational Research Society"},{"key":"835_CR2","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. European Journal of Operational Research, 115, 173\u2013178.","journal-title":"European Journal of Operational Research"},{"key":"835_CR3","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 effect. European Journal of Operational Research, 188, 315\u2013329.","journal-title":"European Journal of Operational Research"},{"key":"835_CR4","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S. Browne","year":"1990","unstructured":"Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495\u2013498.","journal-title":"Operations Research"},{"key":"835_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1019216726076","volume":"98","author":"T. C. E. Cheng","year":"2000","unstructured":"Cheng, T. C. E., & Wang, G. (2000). Single machine scheduling problems with learning effect considerations. Annal of Operations Research, 98, 273\u2013290.","journal-title":"Annal of Operations Research"},{"key":"835_CR6","volume-title":"Time-dependent scheduling","author":"S. Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer."},{"key":"835_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy\u00a0Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"835_CR8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"J. N. D. Gupta","year":"1988","unstructured":"Gupta, J. N. D., & Gupta, S. K. (1988). Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering, 14, 387\u2013393.","journal-title":"Computers and Industrial Engineering"},{"key":"835_CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0020-0190(93)90175-9","volume":"48","author":"K. I. J. Ho","year":"1993","unstructured":"Ho, K. I. J., Leung, J. Y. T., & Wei, W. D. (1993). Complexity of scheduling tasks with time-dependent execution times. Information Processing Letter, 48, 315\u2013320.","journal-title":"Information Processing Letter"},{"key":"835_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.15807\/jorsj.22.205","volume":"22","author":"H. Kise","year":"1979","unstructured":"Kise, H., Ibaraki, T., & Mine, H. (1979). Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the. Operational Research, Society of Japan, 22, 205\u2013224.","journal-title":"Operational Research, Society of Japan"},{"key":"835_CR11","first-page":"83","volume":"3","author":"W. C. Lee","year":"2004","unstructured":"Lee, W. C. (2004). A note on deteriorating jobs and learning in single-machine scheduling problems. International Journal of Business and Economics, 3, 83\u201389.","journal-title":"International Journal of Business and Economics"},{"issue":"7","key":"835_CR12","doi-asserted-by":"crossref","first-page":"3885","DOI":"10.1016\/j.ins.2009.07.011","volume":"179","author":"W. C. Lee","year":"2009","unstructured":"Lee, W. C., & Wu, C. C. (2009). Some single-machine and m-machine flowshop scheduling problems with learning considerations. Information Sciences, 179(7), 3885\u20133892.","journal-title":"Information Sciences"},{"key":"835_CR13","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1287\/opre.39.6.979","volume":"39","author":"G. Mosheiov","year":"1991","unstructured":"Mosheiov, G. (1991). V-shaped policies for scheduling deteriorating jobs. Operations Research, 39, 979\u2013991.","journal-title":"Operations Research"},{"key":"835_CR14","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/0305-0548(94)90080-9","volume":"21","author":"G. Mosheiov","year":"1994","unstructured":"Mosheiov, G. (1994). Scheduling jobs under simple linear deterioration. Computers and Operations Research, 21, 653\u2013659.","journal-title":"Computers and Operations Research"},{"key":"835_CR15","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G. Mosheiov","year":"2001","unstructured":"Mosheiov, G. (2001). Scheduling problems with a learning effect. European of Journal Operation Research, 132, 687\u2013692.","journal-title":"European of Journal Operation Research"},{"key":"835_CR16","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, J. B. (2003). Scheduling with general job-dependent learning curves. European of Journal Operation Research, 147, 665\u2013670.","journal-title":"European of Journal Operation Research"},{"key":"835_CR17","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1057\/palgrave.jors.2601809","volume":"56","author":"G. Mosheiov","year":"2005","unstructured":"Mosheiov, G., & Sidney, J. B. (2005). Note on scheduling with general learning curves to minimize the number of tardy jobs. Journal of Operation Research Society, 56, 110\u2013112.","journal-title":"Journal of Operation Research Society"},{"key":"835_CR18","first-page":"316","volume":"1","author":"C. C. Pegels","year":"1969","unstructured":"Pegels, C. C. (1969). On startup or learning curves: an expanded view. AIIE Transactions, 1, 316\u2013322.","journal-title":"AIIE Transactions"},{"key":"835_CR19","volume-title":"Scheduling: Theory algorithms and systems","author":"M. Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: Theory algorithms and systems. Prentice-Hall: Englewood Cliffs."},{"key":"835_CR20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics, 3, 59\u201366.","journal-title":"Naval Research Logistics"},{"key":"835_CR21","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF02936581","volume":"18","author":"J. B. Wang","year":"2005","unstructured":"Wang, J. B. (2005). Flow shop scheduling jobs with position-dependent processing times. Journal of Applied Mathematics and Computing, 18, 383\u2013391.","journal-title":"Journal of Applied Mathematics and Computing"},{"key":"835_CR22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1142\/S021759590700122X","volume":"24","author":"J. B. Wang","year":"2007","unstructured":"Wang, J. B., & Cheng, T. C. E. (2007). Scheduling problems with the effects of deterioration and learning. Asia-Pacific Journal of Operational Research, 24, 245\u2013261.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"835_CR23","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1016\/j.cie.2008.09.020","volume":"56","author":"J.\u00a0B. Wang","year":"2009","unstructured":"Wang, J.\u00a0B., Liu, L. L. (2009). Two-machine flow shop scheduling with linear decreasing job deterioration. Computer and Industrial Engineering, 56, 1487\u20131493.","journal-title":"Computer and Industrial Engineering"},{"key":"835_CR24","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1057\/palgrave.jors.2601856","volume":"56","author":"J. B. Wang","year":"2005","unstructured":"Wang, J. B., & Xia, Z. Q. (2005). Flow-shop scheduling with a learning effect. Journal of the Operational Research Society, 56, 1325\u20131330.","journal-title":"Journal of the Operational Research Society"},{"key":"835_CR25","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.camwa.2008.09.025","volume":"57","author":"J. B. Wang","year":"2009","unstructured":"Wang, J. B., Wang, D., Wang, L. Y., Lin, L., Yin, N., & Wang, W. W. (2009). Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times. Computers and Mathematics with Applications, 57, 9\u201316.","journal-title":"Computers and Mathematics with Applications"},{"key":"835_CR26","doi-asserted-by":"crossref","first-page":"2813","DOI":"10.1016\/j.apm.2009.12.015","volume":"34","author":"J. B. Wang","year":"2010","unstructured":"Wang, J. B., Sun, L., & Sun, L. (2010). Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect. Applied Mathematics and Modelling, 34, 2813\u20132819.","journal-title":"Applied Mathematics and Modelling"},{"key":"835_CR27","doi-asserted-by":"crossref","first-page":"3321","DOI":"10.1016\/j.amc.2010.08.064","volume":"217","author":"S. J. Yang","year":"2010","unstructured":"Yang, S. J. (2010). Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration. Applied Mathematics and Computation, 217, 3321\u20133329.","journal-title":"Applied Mathematics and Computation"},{"key":"835_CR28","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.cie.2009.06.016","volume":"58","author":"D. L. Yang","year":"2010","unstructured":"Yang, D. L., & Kuo, W. H. (2010). Some scheduling problems with deteriorating jobs and learning effects. Computers and Industrial Engineering, 58, 25\u201328.","journal-title":"Computers and Industrial Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0835-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0835-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0835-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:08:34Z","timestamp":1559941714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0835-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,15]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["835"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0835-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,15]]}}}