{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:37:02Z","timestamp":1783010222997,"version":"3.54.5"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030416713","type":"print"},{"value":"9783030416720","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41672-0_16","type":"book-chapter","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T07:03:04Z","timestamp":1582182184000},"page":"252-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Review for Submodular Optimization on Machine Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Siwen","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,21]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10951-008-0076-6","volume":"12","author":"A Agnetis","year":"2009","unstructured":"Agnetis, A., Detti, P., Pranzo, M., Sodhi, M.S.: Sequencing unreliable jobs on parallel machines. J. Sched. 12(1), 45 (2009)","journal-title":"J. Sched."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.omega.2018.04.002","volume":"84","author":"C Arbib","year":"2019","unstructured":"Arbib, C., Felici, G., Servilio, M.: Common operation scheduling with general processing times: a branch-and-cut algorithm to minimize the weighted number of tardy jobs. Omega 84, 18\u201330 (2019)","journal-title":"Omega"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bambagini, M., Lelli, J., Buttazzo, G., Lipari, G.: On the energy-aware partitioning of real-time tasks on homogeneous multi-processor systems. In: 2013 4th Annual International Conference on Energy Aware Computing Systems and Applications (ICEAC), pp. 69\u201374. IEEE (2013)","DOI":"10.1109\/ICEAC.2013.6737640"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.tcs.2015.02.020","volume":"579","author":"E Bampis","year":"2015","unstructured":"Bampis, E., Letsios, D., Lucarelli, G.: Green scheduling, flows and matchings. Theor. Comput. Sci. 579, 126\u2013136 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1287\/ijoc.1050.0132","volume":"19","author":"G Belov","year":"2007","unstructured":"Belov, G., Scheithauer, G.: Setup and open-stacks minimization in one-dimensional stock cutting. INFORMS J. Comput. 19(1), 27\u201335 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551\u2013591 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"16_CR7","unstructured":"Chen, Y., Krause, A.: Near-optimal batch mode active learning and adaptive submodular optimization. ICML (1) 28(160\u2013168), 8\u20131 (2013)"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0167-6377(97)00010-2","volume":"21","author":"ZL Chen","year":"1997","unstructured":"Chen, Z.L., Lu, Q., Tang, G.: Single machine scheduling with discretely controllable processing times. Oper. Res. Lett. 21(2), 69\u201376 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1080\/07408179608966263","volume":"28","author":"T Cheng","year":"1996","unstructured":"Cheng, T., Chen, Z., Li, C.L.: Parallel-machine scheduling with controllable processing times. IIE Trans. 28(2), 177\u2013180 (1996)","journal-title":"IIE Trans."},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF00940554","volume":"79","author":"T Cheng","year":"1993","unstructured":"Cheng, T., Diamond, J., Lin, B.: Optimal scheduling in film production to minimize talent hold cost. J. Optim. Theor. Appl. 79(3), 479\u2013492 (1993)","journal-title":"J. Optim. Theor. Appl."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.ejor.2013.02.042","volume":"230","author":"EB Edis","year":"2013","unstructured":"Edis, E.B., Oguz, C., Ozkarahan, I.: Parallel machine scheduling with additional resources: notation, classification, models and solution methods. Eur. J. Oper. Res. 230(3), 449\u2013463 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Epasto, A., Lattanzi, S., Vassilvitskii, S., Zadimoghaddam, M.: Submodular optimization over sliding windows. In: Proceedings of the 26th International Conference on World Wide Web, pp. 421\u2013430 (2017). International World Wide Web Conferences Steering Committee","DOI":"10.1145\/3038912.3052699"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0305-0548(98)80001-4","volume":"26","author":"A Fink","year":"1999","unstructured":"Fink, A., Vo\u00df, S.: Applications of modern heuristic search methods to pattern sequencing problems. Comput. Oper. Res. 26(1), 17\u201334 (1999)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1287\/moor.2018.0978","volume":"44","author":"R Fokkink","year":"2019","unstructured":"Fokkink, R., Lidbetter, T., V\u00e9gh, L.A.: On submodular search and machine scheduling. Math. Oper. Res. 44(4), 1431\u20131449 (2019)","journal-title":"Math. Oper. Res."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of Discrete Mathematics, vol. 5, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.33.2.346","volume":"33","author":"H Ishii","year":"1985","unstructured":"Ishii, H., Martel, C., Masuda, T., Nishida, T.: A generalized uniform processor system. Oper. Res. 33(2), 346\u2013362 (1985)","journal-title":"Oper. Res."},{"key":"16_CR17","unstructured":"Jegelka, S., Bach, F., Sra, S.: Reflection methods for user-friendly submodular optimization. In: Advances in Neural Information Processing Systems, pp. 1313\u20131321 (2013)"},{"key":"16_CR18","unstructured":"Kim, G., Xing, E.P., Fei-Fei, L., Kanade, T.: Distributed cosegmentation via submodular optimization on anisotropic diffusion. In: 2011 International Conference on Computer Vision, pp. 169\u2013176. IEEE (2011)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Krause, A., Golovin, D.: Submodular function maximization (2014)","DOI":"10.1017\/CBO9781139177801.004"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s10922-016-9385-9","volume":"25","author":"M Masdari","year":"2017","unstructured":"Masdari, M., Salehi, F., Jalali, M., Bidaki, M.: A survey of pso-based scheduling algorithms in cloud computing. J. Netw. Syst. Manag. 25(1), 122\u2013158 (2017)","journal-title":"J. Netw. Syst. Manag."},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2013i. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"16_CR22","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E Nowicki","year":"1990","unstructured":"Nowicki, E., Zdrza\u0142ka, S.: A survey of results for sequencing problems with controllable processing times. Discret. Appl. Math. 26(2\u20133), 271\u2013287 (1990)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"16_CR23","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou, J., Zhong, X., Wang, G.: An improved heuristic for parallel machine scheduling with rejection. Eur. J. Oper. Res. 241(3), 653\u2013661 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"16_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ejor.2014.11.034","volume":"244","author":"J Pei","year":"2015","unstructured":"Pei, J., Pardalos, P.M., Liu, X., Fan, W., Yang, S.: Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan. Eur. J. Oper. Res. 244(1), 13\u201325 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"13","key":"16_CR25","doi-asserted-by":"publisher","first-page":"2279","DOI":"10.1016\/S0305-0548(03)00187-4","volume":"31","author":"D Shabtay","year":"2004","unstructured":"Shabtay, D., Kaspi, M.: Minimizing the total weighted flow time in a single machine with controllable processing times. Comput. Oper. Res. 31(13), 2279\u20132289 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"13","key":"16_CR26","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay, D., Steiner, G.: A survey of scheduling with controllable processing times. Discret. Appl. Math. 155(13), 1643\u20131666 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"02","key":"16_CR27","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054109006541","volume":"20","author":"NV Shakhlevich","year":"2009","unstructured":"Shakhlevich, N.V., Shioura, A., Strusevich, V.A.: Single machine scheduling with controllable processing times by submodular optimization. Int. J. Found. Comput. Sci. 20(02), 247\u2013269 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"16_CR28","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10951-005-6813-1","volume":"8","author":"NV Shakhlevich","year":"2005","unstructured":"Shakhlevich, N.V., Strusevich, V.A.: Pre-emptive scheduling problems with controllable processing times. J. Sched. 8(3), 233\u2013253 (2005)","journal-title":"J. Sched."},{"issue":"4","key":"16_CR29","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00453-007-9091-9","volume":"51","author":"NV Shakhlevich","year":"2008","unstructured":"Shakhlevich, N.V., Strusevich, V.A.: Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica 51(4), 451\u2013473 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"16_CR30","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/110843836","volume":"27","author":"A Shioura","year":"2013","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines. SIAM J. Discret. Math. 27(1), 186\u2013204 (2013)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"16_CR31","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-014-0814-9","volume":"153","author":"A Shioura","year":"2015","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math. Program. 153(2), 495\u2013534 (2015)","journal-title":"Math. Program."},{"key":"16_CR32","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: Energy saving computational models with speed scaling via submodular optimization. In: Proceedings of Third International Conference on Green Computing, Technology and Innovation, pp. 7\u201318 (2015)"},{"issue":"1","key":"16_CR33","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/ijoc.2015.0660","volume":"28","author":"A Shioura","year":"2016","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines. INFORMS J. Comput. 28(1), 148\u2013161 (2016)","journal-title":"INFORMS J. Comput."},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-44914-2_7","volume-title":"Discrete Optimization and Operations Research","author":"A Shioura","year":"2016","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: Handling scheduling problems with controllable parameters by methods of submodular optimization. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 74\u201390. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_7"},{"issue":"4","key":"16_CR35","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1287\/ijoc.2017.0758","volume":"29","author":"A Shioura","year":"2017","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: Machine speed scaling by adapting methods for convex optimization with submodular constraints. INFORMS J. Comput. 29(4), 724\u2013736 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"16_CR36","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ejor.2017.08.034","volume":"266","author":"A Shioura","year":"2018","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches. Eur. J. Oper. Res. 266(3), 795\u2013818 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. J. Glob. Optim., 1\u201320 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0686-2","DOI":"10.1007\/s10898-018-0686-2"},{"issue":"3","key":"16_CR38","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"R Vickson","year":"1980","unstructured":"Vickson, R.: Two single machine sequencing problems involving controllable job processing times. AIIE Trans. 12(3), 258\u2013262 (1980)","journal-title":"AIIE Trans."},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Wang, J., Qiao, C., Yu, H.: On progressive network recovery after a major disruption. In: 2011 Proceedings IEEE INFOCOM, pp. 1925\u20131933. IEEE (2011)","DOI":"10.1109\/INFCOM.2011.5934996"},{"issue":"3","key":"16_CR40","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1080\/00207543.2012.676683","volume":"51","author":"S Wang","year":"2013","unstructured":"Wang, S., Liu, M.: A branch and bound algorithm for single-machine production scheduling integrated with preventive maintenance planning. Int. J. Prod. Res. 51(3), 847\u2013868 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"16_CR41","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/00207543.2014.949363","volume":"53","author":"S Wang","year":"2015","unstructured":"Wang, S., Liu, M., Chu, C.: A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int. J. Prod. Res. 53(4), 1143\u20131167 (2015)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"16_CR42","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TPWRS.2016.2603448","volume":"32","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Liu, Y., Kirschen, D.S.: Scenario reduction with submodular optimization. IEEE Trans. Power Syst. 32(3), 2479\u20132480 (2016)","journal-title":"IEEE Trans. Power Syst."},{"key":"16_CR43","volume-title":"Integer and Combinatorial Optimization","author":"LA Wolsey","year":"1999","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization, vol. 55. Wiley, Hoboken (1999)"},{"key":"16_CR44","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cie.2015.12.003","volume":"92","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Wang, Y., Cheng, T., Wang, D.J., Wu, C.C.: Two-agent single-machine scheduling to minimize the batch delivery cost. Comput. Ind. Eng. 92, 16\u201330 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"16_CR45","doi-asserted-by":"crossref","unstructured":"Zhang, H., Vorobeychik, Y.: Submodular optimization with routing constraints. In: Thirtieth AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10066"},{"key":"16_CR46","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tcs.2012.11.002","volume":"468","author":"K Zhao","year":"2013","unstructured":"Zhao, K., Lu, X.: Approximation schemes for two-agent scheduling on parallel machines. Theor. Comput. Sci. 468, 114\u2013121 (2013)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Complexity and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41672-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T02:29:30Z","timestamp":1665887370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41672-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030416713","9783030416720"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41672-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}