{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:14Z","timestamp":1759847834563,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T00:00:00Z","timestamp":1530835200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"JSPS KAKENHI","award":["15K00030","15H00848"],"award-info":[{"award-number":["15K00030","15H00848"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10898-018-0686-2","type":"journal-article","created":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T04:49:47Z","timestamp":1530852587000},"page":"471-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost"],"prefix":"10.1007","volume":"76","author":[{"given":"Akiyoshi","family":"Shioura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia V.","family":"Shakhlevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4602-8573","authenticated-orcid":false,"given":"Vitaly A.","family":"Strusevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"686_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0097-3165(86)90122-6","volume":"41","author":"N Alon","year":"1986","unstructured":"Alon, N., Gy\u0151ri, E.: The number of small semispaces of a finite set of points in the plane. J. Comb. Optim. A 41, 154\u2013157 (1986)","journal-title":"J. Comb. Optim. A"},{"key":"686_CR2","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer, Berlin (2007)","edition":"5"},{"key":"686_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0218195996000186","volume":"6","author":"H Everett","year":"1996","unstructured":"Everett, H., Robert, J.-M., van Kreveld, M.: An optimal algorithm for computing $$\\left( \\le k\\right) $$ \u2264 k -levels, with applications. Int. J. Comput. Geom. Appl. 6, 247\u2013261 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"686_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1287\/mnsc.32.3.341","volume":"32","author":"A Federgruen","year":"1986","unstructured":"Federgruen, A., Groenevelt, H.: Preemptive scheduling of uniform machines by ordinary network flow techniques. Manag. Sci. 32, 341\u2013349 (1986)","journal-title":"Manag. Sci."},{"key":"686_CR5","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1287\/moor.5.2.186","volume":"5","author":"S Fujishige","year":"1980","unstructured":"Fujishige, S.: Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5, 186\u2013196 (1980)","journal-title":"Math. Oper. Res."},{"key":"686_CR6","series-title":"Annals of Discrete Mathematics","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics, vol. 58, 2nd edn. Elsevier, New York City (2005)","edition":"2"},{"key":"686_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"686_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"TF Gonzales","year":"1978","unstructured":"Gonzales, T.F., Sahni, S.: Preemptive scheduling of uniform processor systems. J. ACM 25, 92\u2013101 (1978)","journal-title":"J. ACM"},{"key":"686_CR9","unstructured":"Gordon, V.S., Tanaev, V.S.: Deadlines in single-stage deterministic scheduling. In: Optimization of Systems for Collecting, Transfer and Processing of Analogous and Discrete Data in Local Information Computing Systems. Materials of the 1st Joint Soviet-Bulgarian Seminar (Institute of Engineering Cybernetics of Academy of Sciences of BSSR\u2014Institute of Engineering Cybernetics of Bulgarian Academy of Sciences, Minsk), pp. 53\u201358 (1973) (in Russian)"},{"key":"686_CR10","first-page":"35-1","volume-title":"Handbook of Scheduling: Algorithms, Models and Performance Analysis","author":"KI-J Ho","year":"2004","unstructured":"Ho, K.I.-J.: Dual criteria optimization problems for imprecise computation tasks. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 35-1\u201335-26. CRC Press, Boca Raton (2004)"},{"key":"686_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1006\/jagm.1994.1020","volume":"16","author":"KI-J Ho","year":"1994","unstructured":"Ho, K.I.-J., Leung, J.Y.-T., Wei, W.-D.: Minimizing maximum weighted error for imprecise computation tasks. J. Algorithms 16, 431\u2013452 (1994)","journal-title":"J. Algorithms"},{"key":"686_CR12","first-page":"269","volume":"69","author":"DS Hochbaum","year":"1995","unstructured":"Hochbaum, D.S., Hong, S.-P.: About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Math. Program. A 69, 269\u2013309 (1995)","journal-title":"Math. Program. A"},{"key":"686_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"W Horn","year":"1974","unstructured":"Horn, W.: Some simple scheduling algorithms. Naval Res. Logist. Quart. 21, 177\u2013185 (1974)","journal-title":"Naval Res. Logist. Quart."},{"key":"686_CR14","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. J. ACM 48, 761\u2013777 (2001)","journal-title":"J. ACM"},{"key":"686_CR15","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","volume":"94","author":"A Janiak","year":"1996","unstructured":"Janiak, A., Kovalyov, M.Y.: Single machine scheduling with deadlines and resource dependent processing times. Eur. J. Oper. Res. 94, 284\u2013291 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"686_CR16","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/S0305-0548(03)00101-1","volume":"31","author":"K Jansen","year":"2004","unstructured":"Jansen, K., Mastrolilli, M.: Approximation schemes for parallel machine scheduling problems with controllable processing times. Comput. Oper. Res. 31, 1565\u20131581 (2004)","journal-title":"Comput. Oper. Res."},{"key":"686_CR17","first-page":"159","volume-title":"Handbook of Combinatorial Optimization","author":"N Katoh","year":"1998","unstructured":"Katoh, N., Ibaraki, T.: Resource allocation problems. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 2, pp. 159\u2013260. Kluwer, Dordrecht (1998)"},{"key":"686_CR18","doi-asserted-by":"crossref","first-page":"34-1","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models and Performance Analysis","author":"JY-T Leung","year":"2004","unstructured":"Leung, J.Y.-T.: Minimizing total weighted error for imprecise computation tasks. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 34-1\u201334-16. CRC Press, Boca Raton (2004)"},{"key":"686_CR19","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1287\/opre.47.5.744","volume":"47","author":"ST McCormick","year":"1999","unstructured":"McCormick, S.T.: Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. Oper. Res. 47, 744\u2013756 (1999)","journal-title":"Oper. Res."},{"key":"686_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"12","author":"R McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Manag. Sci. 12, 1\u201312 (1959)","journal-title":"Manag. Sci."},{"key":"686_CR21","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. Discrete Appl. Math. 26, 271\u2013287 (1990)","journal-title":"Discrete Appl. Math."},{"key":"686_CR22","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1287\/opre.27.5.925","volume":"27","author":"S Sahni","year":"1979","unstructured":"Sahni, S.: Preemptive scheduling with due dates. Oper. Res. 27, 925\u2013934 (1979)","journal-title":"Oper. Res."},{"key":"686_CR23","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/322203.322214","volume":"27","author":"S Sahni","year":"1980","unstructured":"Sahni, S., Cho, Y.: Scheduling independent tasks with due times on a uniform processor system. J. ACM 27, 550\u2013563 (1980)","journal-title":"J. ACM"},{"key":"686_CR24","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory B 80, 346\u2013355 (2000)","journal-title":"J. Comb. Theory B"},{"key":"686_CR25","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"686_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. Discrete Appl. Math. 155, 1643\u20131666 (2007)","journal-title":"Discrete Appl. Math."},{"key":"686_CR27","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, 233\u2013253 (2005)","journal-title":"J. Sched."},{"key":"686_CR28","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. Discrete Math. 27, 186\u2013204 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"686_CR29","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. A 153, 495\u2013534 (2015)","journal-title":"Math. Program. A"},{"key":"686_CR30","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, 148\u2013161 (2016)","journal-title":"INFORMS J. Comput."},{"key":"686_CR31","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, 795\u2013818 (2018)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0686-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0686-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0686-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T01:15:31Z","timestamp":1661562931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0686-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,6]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["686"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0686-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,7,6]]},"assertion":[{"value":"28 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}