{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:30:52Z","timestamp":1723242652091},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T00:00:00Z","timestamp":1477353600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s00521-016-2638-4","type":"journal-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T01:49:32Z","timestamp":1477360172000},"page":"1155-1162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling jobs with simultaneous considerations of controllable processing times and learning effect"],"prefix":"10.1007","volume":"29","author":[{"given":"Lin","family":"Li","sequence":"first","affiliation":[]},{"given":"Ping","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,25]]},"reference":[{"key":"2638_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: theory, algorithms and systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo M (2012) Scheduling: theory, algorithms and systems, 4th edn. Prentic Hall, Englewood Cliffs","edition":"4"},{"issue":"6","key":"2638_CR2","first-page":"2113","volume":"10","author":"XN Shen","year":"2014","unstructured":"Shen XN, Zhang M, Fu JZ (2014) Multi-objective dynamic job shop scheduling: a survey and prospects. Int J Innov Comput Inf Control 10(6):2113\u20132126","journal-title":"Int J Innov Comput Inf Control"},{"issue":"1","key":"2638_CR3","first-page":"213","volume":"11","author":"MNA Khalid","year":"2015","unstructured":"Khalid MNA, Yusof UK (2015) Optimizing distributed production scheduling problem in flexible manufacturing system subjects to machine maintenance: A modified chemical reaction approach. Int J Innov Comput Inf Control 11(1):213\u2013228","journal-title":"Int J Innov Comput Inf Control"},{"issue":"13","key":"2638_CR4","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. Discrete Appl Math 155(13):1643\u20131666","journal-title":"Discrete Appl Math"},{"issue":"2","key":"2638_CR5","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(2):315\u2013329","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2638_CR6","first-page":"19","volume":"5","author":"A Janiak","year":"2011","unstructured":"Janiak A, Krysiak T, Trela R (2011) Scheduling problems with learning and ageing effects: a survey. Decis Mak Manuf Serv 5(1):19\u201336","journal-title":"Decis Mak Manuf Serv"},{"issue":"11","key":"2638_CR7","doi-asserted-by":"crossref","first-page":"2998","DOI":"10.1016\/j.camwa.2010.09.061","volume":"60","author":"JB Wang","year":"2010","unstructured":"Wang JB, Wang MZ (2010) Single machine multiple common due dates scheduling with learning effects. Comput Math Appl 60(11):2998\u20133002","journal-title":"Comput Math Appl"},{"issue":"8","key":"2638_CR8","doi-asserted-by":"crossref","first-page":"4017","DOI":"10.1016\/j.apm.2011.02.023","volume":"35","author":"JB Wang","year":"2011","unstructured":"Wang JB, Wang C (2011) Single-machine due-window assignment problem with learning effect and deteriorating jobs. Appl Math Model 35(8):4017\u20134022","journal-title":"Appl Math Model"},{"issue":"18\u201319","key":"2638_CR9","doi-asserted-by":"crossref","first-page":"8394","DOI":"10.1016\/j.apm.2013.03.041","volume":"37","author":"JB Wang","year":"2013","unstructured":"Wang JB, Liu L, Wang C (2013) Single machine SLK\/DIF due window assignment problem with learning effect and deteriorating jobs. Appl Math Model 37(18\u201319):8394\u20138400","journal-title":"Appl Math Model"},{"key":"2638_CR10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.cor.2014.12.006","volume":"58","author":"JJ Wang","year":"2015","unstructured":"Wang JJ, Zhang BH (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"},{"issue":"1","key":"2638_CR11","first-page":"59","volume":"1","author":"A Janiak","year":"2007","unstructured":"Janiak A, Janiak W, Lichtenstein M (2007) Resource management in machine scheduling problems: a survey. Decis Mak Manuf Serv 1(1):59\u201389","journal-title":"Decis Mak Manuf Serv"},{"issue":"6","key":"2638_CR12","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ijpe.2013.12.021","volume":"150","author":"DL Yang","year":"2014","unstructured":"Yang DL, Lai CJ, Yang SJ (2014) Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. Int J Prod Econ 150(6):96\u2013103","journal-title":"Int J Prod Econ"},{"issue":"1","key":"2638_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1057\/jors.2012.161","volume":"65","author":"YQ Yin","year":"2014","unstructured":"Yin YQ, Cheng TCE, Wu CC, Cheng SR (2014) Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. J Oper Res Soc 65(1):1\u201313","journal-title":"J Oper Res Soc"},{"issue":"4","key":"2638_CR14","first-page":"1587","volume":"10","author":"TR Chang","year":"2014","unstructured":"Chang TR, Lee HT, Yang DL, Yang SJ (2014) Unrelated-parallel machine scheduling with simultaneous considerations of resource-dependent processing times and rate-modifying activities. Int J Innov Comput Inf Control 10(4):1587\u20131600","journal-title":"Int J Innov Comput Inf Control"},{"issue":"3","key":"2638_CR15","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 MZ, Wang JB (2010) Single-machine scheduling with learning effect and resource-dependent processing times. Comput Ind Eng 59(3):458\u2013462","journal-title":"Comput Ind Eng"},{"issue":"5\u20138","key":"2638_CR16","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s00170-010-2973-z","volume":"54","author":"N Yin","year":"2011","unstructured":"Yin N, Wang XY (2011) Single-machine scheduling with controllable processing times and learning effect. Int J Adv Manuf Technol 54(5\u20138):743\u2013748","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"2638_CR17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s11590-012-0467-7","volume":"8","author":"YY Lu","year":"2014","unstructured":"Lu YY, Li G, Wu YB, Ji P (2014) Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optim Lett 8(1):113\u2013127","journal-title":"Optim Lett"},{"key":"2638_CR18","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.cie.2014.06.017","volume":"75","author":"Y Liu","year":"2014","unstructured":"Liu Y, Feng Z (2014) Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Comput Ind Eng 75:170\u2013175","journal-title":"Comput Ind Eng"},{"issue":"4","key":"2638_CR19","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1080\/00207543.2014.954057","volume":"53","author":"G Li","year":"2015","unstructured":"Li G, Luo ML, Zhang WJ, Wang XY (2015) Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int J Prod Res 53(4):1228\u20131241","journal-title":"Int J Prod Res"},{"issue":"3","key":"2638_CR20","first-page":"1550033","volume":"32","author":"XJ Li","year":"2015","unstructured":"Li XJ, Wang JJ, Wang XR (2015) Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times, Asia-Pac J Oper Res 32(3):1550033 (12 pages)","journal-title":"Asia-Pac J Oper Res"},{"issue":"1","key":"2638_CR21","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(1):173\u2013178","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2638_CR22","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(3):665\u2013670","journal-title":"Eur J Oper Res"},{"key":"2638_CR23","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, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"2","key":"2638_CR24","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(2):391\u2013399","journal-title":"Oper Res"},{"issue":"10","key":"2638_CR25","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(10):1280\u20131285","journal-title":"J Oper Res Soc"},{"issue":"4","key":"2638_CR26","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(4):393\u2013399","journal-title":"Int J Prod Res"},{"issue":"12","key":"2638_CR27","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(12):1453\u20131459","journal-title":"Manag Sci"},{"issue":"1","key":"2638_CR28","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/opre.37.1.118","volume":"37","author":"UB Bagchi","year":"1989","unstructured":"Bagchi UB (1989) Simultaneous minimization of mean and variation of flow-time and waiting time in single machine systems. Oper Res 37(1):118\u2013125","journal-title":"Oper Res"},{"key":"2638_CR29","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"},{"issue":"3","key":"2638_CR30","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1287\/opre.40.3.596","volume":"40","author":"S Chand","year":"1992","unstructured":"Chand S, Chhajed D (1992) A single machine model for determination of optimal due dates and sequence. Oper Res 40(3):596\u2013602","journal-title":"Oper Res"},{"issue":"4","key":"2638_CR31","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/nav.9","volume":"48","author":"B Dickman","year":"2001","unstructured":"Dickman B, Wilamowsky Y, Epstein S (2001) Multiple common due dates. Naval Res Logist 48(4):293\u2013298","journal-title":"Naval Res Logist"},{"issue":"9","key":"2638_CR32","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","volume":"49","author":"SD Liman","year":"1998","unstructured":"Liman SD, Panwalkar SS, Thongmee S (1998) Common due window size and location determination in a single machine scheduling problem. J Oper Res Soc 49(9):1007\u20131010","journal-title":"J Oper Res Soc"},{"key":"2638_CR33","first-page":"185","volume":"35","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov G, Oron D (2010) Job-dependent due-window assignment based on a common flow allowance. Found Comput Decis Sci 35:185\u2013195","journal-title":"Found Comput Decis Sci"},{"issue":"1","key":"2638_CR34","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.ijpe.2011.07.013","volume":"135","author":"B Mor","year":"2012","unstructured":"Mor B, Mosheiov G (2012) Scheduling a maintenance activity and due-window assignment based on common flow allowance. Int J Prod Econ 135(1):222\u2013230","journal-title":"Int J Prod Econ"},{"issue":"2","key":"2638_CR35","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/s11590-012-0579-0","volume":"8","author":"XR Wang","year":"2014","unstructured":"Wang XR, Wang JB, Jin J, Ji P (2014) Single machine scheduling with truncated job-dependent learning effect. Optim Lett 8(2):669\u2013677","journal-title":"Optim Lett"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2638-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2638-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2638-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T05:57:31Z","timestamp":1525759051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2638-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,25]]},"references-count":35,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2638"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2638-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,25]]}}}