{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:25:52Z","timestamp":1759667152785},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,25]],"date-time":"2018-01-25T00:00:00Z","timestamp":1516838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,25]],"date-time":"2018-01-25T00:00:00Z","timestamp":1516838400000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s12351-018-0373-6","type":"journal-article","created":{"date-parts":[[2018,1,25]],"date-time":"2018-01-25T12:23:43Z","timestamp":1516883023000},"page":"1255-1287","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Minimizing total weighted completion and batch delivery times with machine deterioration and learning effect: a case study from wax production"],"prefix":"10.1007","volume":"20","author":[{"given":"Mohammad","family":"Rostami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiva","family":"Nikravesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Shahin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,25]]},"reference":[{"key":"373_CR1","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 et al (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"issue":"2","key":"373_CR2","first-page":"253","volume":"3","author":"H Haddad","year":"2012","unstructured":"Haddad H, Ghanbari P, Moghaddam A (2012) A new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs. Int J Ind Eng Comput 3(2):253\u2013264","journal-title":"Int J Ind Eng Comput"},{"issue":"4","key":"373_CR3","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.cie.2011.01.009","volume":"60","author":"X Huang","year":"2011","unstructured":"Huang X, Wang M-Z, Wang J-B (2011) Single-machine group scheduling with both learning effects and deteriorating jobs. Comput Ind Eng 60(4):750\u2013754","journal-title":"Comput Ind Eng"},{"issue":"2","key":"373_CR4","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.ejor.2005.09.006","volume":"176","author":"M Ji","year":"2007","unstructured":"Ji M, He Y, Cheng TCE (2007) Batch delivery scheduling with batch delivery cost on a single machine. Eur J Oper Res 176(2):745\u2013755","journal-title":"Eur J Oper Res"},{"issue":"8","key":"373_CR5","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1080\/00207543.2013.866286","volume":"52","author":"M Karimi-Nasab","year":"2014","unstructured":"Karimi-Nasab M, Sabri-Laghaie K (2014) Developing approximate algorithms for EPQ problem with process compressibility and random error in production\/inspection. Int J Prod Res 52(8):2388\u20132421","journal-title":"Int J Prod Res"},{"issue":"3","key":"373_CR6","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.ejor.2013.06.021","volume":"231","author":"M Karimi-Nasab","year":"2013","unstructured":"Karimi-Nasab M, Seyedhoseini SM (2013) Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach. Eur J Oper Res 231(3):598\u2013616","journal-title":"Eur J Oper Res"},{"issue":"4598","key":"373_CR7","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simmulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"2","key":"373_CR8","first-page":"94","volume":"1","author":"M Mazdeh","year":"2014","unstructured":"Mazdeh M, Rostami M (2014) A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs. Int J Syst Sci Oper Logist 1(2):94\u2013104","journal-title":"Int J Syst Sci Oper Logist"},{"issue":"1","key":"373_CR9","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ejor.2006.09.087","volume":"183","author":"MM Mazdeh","year":"2007","unstructured":"Mazdeh MM, Sarhadi M, Hindi KS (2007) A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs. Eur J Oper Res 183(1):74\u201386","journal-title":"Eur J Oper Res"},{"issue":"1","key":"373_CR10","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.apm.2010.07.023","volume":"35","author":"MM Mazdeh","year":"2011","unstructured":"Mazdeh MM et al (2011) Single-machine batch scheduling minimizing weighted flow times and delivery costs. Appl Math Model 35(1):563\u2013570","journal-title":"Appl Math Model"},{"issue":"4","key":"373_CR11","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.cie.2013.09.014","volume":"66","author":"MM Mazdeh","year":"2013","unstructured":"Mazdeh MM, Rostami M, Namaki MH (2013) Minimizing maximum tardiness and delivery costs in a batched delivery system. Comput Ind Eng 66(4):675\u2013682","journal-title":"Comput Ind Eng"},{"key":"373_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20100","volume-title":"Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost","author":"G Pundoor","year":"2005","unstructured":"Pundoor G, Chen Z-L (2005) Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and distribution cost. Wiley, Hoboken"},{"issue":"16","key":"373_CR13","doi-asserted-by":"publisher","first-page":"4909","DOI":"10.1016\/j.apm.2015.03.052","volume":"39","author":"M Rostami","year":"2015","unstructured":"Rostami M, Kheirandish O, Ansari N (2015a) Minimizing maximum tardiness and delivery costs with batch delivery and job release times. Appl Math Model 39(16):4909\u20134927","journal-title":"Appl Math Model"},{"key":"373_CR14","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.cie.2015.03.022","volume":"85","author":"M Rostami","year":"2015","unstructured":"Rostami M, Pilerood A, Mazdeh M (2015b) Multi-objective parallel machine scheduling problem with job deterioration and learning effect under fuzzy environment. Comput Ind Eng 85:206\u2013215","journal-title":"Comput Ind Eng"},{"issue":"1","key":"373_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10951-011-0255-8","volume":"16","author":"E Selvarajah","year":"2013","unstructured":"Selvarajah E, Steiner G, Zhang R (2013) Single machine batch scheduling with release times and delivery costs. J Sched 16(1):69\u201379","journal-title":"J Sched"},{"issue":"4","key":"373_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.omega.2005.07.008","volume":"35","author":"J-B Wang","year":"2007","unstructured":"Wang J-B (2007) Single-machine scheduling problems with the effects of learning and deterioration. Omega 35(4):397\u2013402","journal-title":"Omega"},{"issue":"1","key":"373_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2006.01.017","volume":"178","author":"X Wang","year":"2007","unstructured":"Wang X, Edwin Cheng TC (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur J Oper Res 178(1):57\u201370","journal-title":"Eur J Oper Res"},{"issue":"8","key":"373_CR18","doi-asserted-by":"publisher","first-page":"4017","DOI":"10.1016\/j.apm.2011.02.023","volume":"35","author":"J-B Wang","year":"2011","unstructured":"Wang J-B, 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":"10","key":"373_CR19","doi-asserted-by":"publisher","first-page":"3848","DOI":"10.1016\/j.apm.2009.01.004","volume":"33","author":"J-B Wang","year":"2009","unstructured":"Wang J-B et al (2009) Learning effect and deteriorating jobs in the single machine scheduling problems. Appl Math Model 33(10):3848\u20133853","journal-title":"Appl Math Model"},{"issue":"5","key":"373_CR20","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1080\/00207721.2010.542837","volume":"43","author":"J-B Wang","year":"2011","unstructured":"Wang J-B, Wang M-Z, Ji P (2011) Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs. Int J Syst Sci 43(5):861\u2013868","journal-title":"Int J Syst Sci"},{"issue":"2","key":"373_CR21","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.omega.2012.06.002","volume":"41","author":"Y Yin","year":"2013","unstructured":"Yin Y et al (2013) Single-machine batch delivery scheduling with an assignable common due window. Omega 41(2):216\u2013225","journal-title":"Omega"},{"key":"373_CR22","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2013.07.026","volume":"256","author":"Y Yin","year":"2014","unstructured":"Yin Y et al (2014) A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inf Sci 256:91\u2013108","journal-title":"Inf Sci"},{"issue":"1","key":"373_CR23","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TSMCA.2011.2147305","volume":"42","author":"Y Yunqiang","year":"2012","unstructured":"Yunqiang Y et al (2012) Single-machine scheduling with job-position-dependent learning and time-dependent deterioration. IEEE Trans Syst Man Cybern Part A Syst Hum 42(1):192\u2013200","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0373-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0373-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0373-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T18:24:29Z","timestamp":1595874269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0373-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,25]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0373-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,25]]},"assertion":[{"value":"24 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}