{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:37:15Z","timestamp":1778852235100,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,11,12]],"date-time":"2016-11-12T00:00:00Z","timestamp":1478908800000},"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":["J Sched"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10951-016-0502-0","type":"journal-article","created":{"date-parts":[[2016,11,12]],"date-time":"2016-11-12T18:07:07Z","timestamp":1478974027000},"page":"183-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations"],"prefix":"10.1007","volume":"20","author":[{"given":"Liliana","family":"Grigoriu","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Briskorn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,12]]},"reference":[{"issue":"5","key":"502_CR1","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10951-011-0248-7","volume":"15","author":"S Bock","year":"2012","unstructured":"Bock, S., Briskorn, D., & Horbach, A. (2012). Scheduling flexible maintenance activities subject to job-dependent machine deterioration. Journal of Scheduling, 15(5), 565\u2013578.","journal-title":"Journal of Scheduling"},{"key":"502_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling Algorithms. Berlin: Springer."},{"key":"502_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0166-218X(91)90053-Y","volume":"31","author":"B Chen","year":"1991","unstructured":"Chen, B. (1991). Tighter bound for MULTIFIT scheduling on uniform processors. Discrete Applied Mathematics, 31, 227\u2013260.","journal-title":"Discrete Applied Mathematics"},{"key":"502_CR4","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ejor.2007.06.029","volume":"190","author":"J-S Chen","year":"2008","unstructured":"Chen, J.-S. (2008). Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operational Research, 190, 90\u2013102.","journal-title":"European Journal of Operational Research"},{"key":"502_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman","year":"1978","unstructured":"Coffman, E. G., Garey, M. R., & Johnson, D. S. (1978). An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing, 7, 1\u201317.","journal-title":"SIAM Journal on Computing"},{"key":"502_CR6","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0212004","volume":"12","author":"D Friesen","year":"1983","unstructured":"Friesen, D., & Langston, M. (1983). Bounds for multifit scheduling on uniform processors. SIAM Journal on Computing, 12, 60\u201369.","journal-title":"SIAM Journal on Computing"},{"key":"502_CR7","volume-title":"Computers and Intractability - A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability - A guide to the theory of NP-completeness. New York: W.H Freemand and Company."},{"key":"502_CR8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","volume":"3","author":"G Gens","year":"1981","unstructured":"Gens, G., & Levner, E. (1981). Fast approximation algorithm for job sequencing with deadlines. Discrete Applied Mathematics, 3, 313\u2013318.","journal-title":"Discrete Applied Mathematics"},{"key":"502_CR9","first-page":"236","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. G. H. R. (1979). Optimisation and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 236\u2013287.","journal-title":"Annals of Discrete Mathematics"},{"key":"502_CR10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.disopt.2010.04.003","volume":"7","author":"L Grigoriu","year":"2010","unstructured":"Grigoriu, L., & Friesen, D. K. (2010). Scheduling on same-speed processors with at most one downtime on each machine. Discrete Optimization, 7, 212\u2013221.","journal-title":"Discrete Optimization"},{"key":"502_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0167-6377(99)00066-8","volume":"26","author":"M G\u00fcntzer","year":"2000","unstructured":"G\u00fcntzer, M., & Jungnickel, D. (2000). Approximate minimization algorithms for the 0\/1 knapsack and subset-sum problem. Operations Research Letters, 26, 55\u201366.","journal-title":"Operations Research Letters"},{"issue":"1","key":"502_CR12","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM, 34(1), 144\u2013162.","journal-title":"Journal of the ACM"},{"key":"502_CR13","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","volume":"94","author":"A Janiak","year":"1996","unstructured":"Janiak, A., & Kovalyov, M. (1996). Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research, 94, 284\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"502_CR14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0377-2217(99)00157-5","volume":"120","author":"H Kellerer","year":"2000","unstructured":"Kellerer, H., Mansini, R., & Speranza, M. (2000). Two linear approximation algorithms for the subset-sum problem. European Journal of Operational Research, 120, 289\u2013296.","journal-title":"European Journal of Operational Research"},{"key":"502_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack Problems. Berlin: Springer."},{"key":"502_CR16","first-page":"101","volume":"6","author":"M Kovalyov","year":"1996","unstructured":"Kovalyov, M. (1996). A rounding technique to construct approximation algorithms for knapsack and partition type problems. Applied Mathematics and Computer Science, 6, 101\u2013113.","journal-title":"Applied Mathematics and Computer Science"},{"key":"502_CR17","unstructured":"Lee, C.-Y. (2004). Machine scheduling with availability constraints. In: J.\u00a0Y.-T. Leung (Eds.), Handbook of scheduling: Algorithms, models and performance analysis (pp. 22-1\u201322-13). Boca Raton, FL: Chapman and Hall\/CRC."},{"key":"502_CR18","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.ejor.2009.03.027","volume":"201","author":"EJ Lodree Jr","year":"2010","unstructured":"Lodree, E. J, Jr., & Geiger, C. D. (2010). A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration. European Journal of Operational Research, 201, 644\u2013648.","journal-title":"European Journal of Operational Research"},{"key":"502_CR19","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. International Journal of Production Economics, 135, 222\u2013230.","journal-title":"International Journal of Production Economics"},{"key":"502_CR20","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1016\/j.cor.2008.10.007","volume":"36","author":"G Mosheiov","year":"2009","unstructured":"Mosheiov, G., & Sarig, A. (2009). Scheduling a maintenance activity and due-window assignment on a single machine. Computers & Operations Research, 36, 2541\u20132545.","journal-title":"Computers & Operations Research"},{"key":"502_CR21","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. Berlin: Springer."},{"key":"502_CR22","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.omega.2011.12.007","volume":"40","author":"K Rustogi","year":"2012","unstructured":"Rustogi, K., & Strusevich, V. A. (2012a). Single machine scheduling with general positional deterioration and rate-modifying maintenance. Omega, 40, 791\u2013804.","journal-title":"Omega"},{"key":"502_CR23","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, V. A. (2012b). Simple matching vs linear assignment in scheduling models with positional effects: A critical review. European Journal of Operational Research, 222, 393\u2013407.","journal-title":"European Journal of Operational Research"},{"key":"502_CR24","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.omega.2013.05.005","volume":"42","author":"K Rustogi","year":"2014","unstructured":"Rustogi, K., & Strusevich, V. A. (2014). Combining time and position dependent effects on a single machine subject to rate-modifying activities. Omega, 42, 166\u2013178.","journal-title":"Omega"},{"key":"502_CR25","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 Applied Mathematics, 155, 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"key":"502_CR26","doi-asserted-by":"crossref","unstructured":"Sun, K., & Li, H. (2010). Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines. International Journal of Production Economics, 124, 151\u2013158.","DOI":"10.1016\/j.ijpe.2009.10.018"},{"key":"502_CR27","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.ins.2013.02.013","volume":"235","author":"D-L Yang","year":"2013","unstructured":"Yang, D.-L., & Yang, S.-J. (2013). Unrelated parallel-machine scheduling problems with multiple rate-modifying activities. Information Sciences, 235, 280\u2013286.","journal-title":"Information Sciences"},{"key":"502_CR28","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1080\/00207543.2013.841330","volume":"52","author":"D-L Yang","year":"2014","unstructured":"Yang, D.-L., Cheng, T. C. E., & Yang, S.-J. (2014). Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions. International Journal of Production Research, 52, 1133\u20131141.","journal-title":"International Journal of Production Research"},{"key":"502_CR29","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":"502_CR30","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.omega.2010.01.003","volume":"38","author":"S-J Yang","year":"2010","unstructured":"Yang, S.-J., & Yang, D.-L. (2010a). Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. Omega, 38, 528\u2013533.","journal-title":"Omega"},{"key":"502_CR31","doi-asserted-by":"crossref","first-page":"2161","DOI":"10.1016\/j.camwa.2010.08.003","volume":"60","author":"S-J Yang","year":"2010","unstructured":"Yang, S.-J., & Yang, D.-L. (2010b). Minimizing the total completion time in single-machine scheduling with aging\/deteriorating effects and deteriorating maintenance activities. Computers and Mathematics with Applications, 60, 2161\u20132169.","journal-title":"Computers and Mathematics with Applications"},{"key":"502_CR32","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02216826","volume":"24","author":"M Yue","year":"1990","unstructured":"Yue, M. (1990). On the exact upper bound of the multifit processor scheduling algorithm. Annals of Operations Research, 24, 233\u2013259.","journal-title":"Annals of Operations Research"},{"key":"502_CR33","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/j.apm.2009.07.002","volume":"34","author":"C-L Zhao","year":"2010","unstructured":"Zhao, C.-L., & Tang, H.-Y. (2010). Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Applied Mathematical Modelling, 34, 837\u2013841.","journal-title":"Applied Mathematical Modelling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0502-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0502-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0502-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T08:10:22Z","timestamp":1495613422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0502-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,12]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["502"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0502-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,12]]}}}