{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:28Z","timestamp":1740122428857,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T00:00:00Z","timestamp":1581724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00523-1","type":"journal-article","created":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T11:03:12Z","timestamp":1581764592000},"page":"1724-1740","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Related machine scheduling with machine speeds satisfying linear constraints"],"prefix":"10.1007","volume":"44","author":[{"given":"Siyun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Kameng","family":"Nip","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1359-4621","authenticated-orcid":false,"given":"Zhenbo","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,15]]},"reference":[{"key":"523_CR1","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer S, Letchford AN (2012) Non-convex mixed-integer nonlinear programming: a survey. Surv Oper Res Manag Sci 17:97\u2013106","journal-title":"Surv Oper Res Manag Sci"},{"key":"523_CR2","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/978-1-4613-0303-9_25","volume-title":"Handbook of combinatorial optimization","author":"B Chen","year":"1998","unstructured":"Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity, algorithms and approximability. In: Du D, Pardalos PM (eds) Handbook of combinatorial optimization. Springer, Boston, pp 1493\u20131641"},{"key":"523_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y Cho","year":"1980","unstructured":"Cho Y, Sahni S (1980) Bounds for list schedules on uniform processors. SIAM J Comput 9:91\u2013103","journal-title":"SIAM J Comput"},{"key":"523_CR4","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","volume":"41","author":"RL Daniels","year":"1995","unstructured":"Daniels RL, Kouvelis P (1995) Robust scheduling to hedge against processing time uncertainty in single-stage production. Manag Sci 41:363\u2013376","journal-title":"Manag Sci"},{"key":"523_CR5","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1137\/0213044","volume":"13","author":"G Dobson","year":"1984","unstructured":"Dobson G (1984) Scheduling independent tasks on uniform processors. SIAM J Comput 13:705\u2013716","journal-title":"SIAM J Comput"},{"key":"523_CR6","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/0216037","volume":"16","author":"DK Friesen","year":"1987","unstructured":"Friesen DK (1987) Tighter bounds for LPT scheduling on uniform processors. SIAM J Comput 16:554\u2013560","journal-title":"SIAM J Comput"},{"key":"523_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco"},{"key":"523_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T Gonzalez","year":"1977","unstructured":"Gonzalez T, Ibarra OH, Sahni S (1977) Bounds for LPT schedules on uniform processors. SIAM J Comput 6:155\u2013166","journal-title":"SIAM J Comput"},{"key":"523_CR9","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling problems: theoretical and practical results. J ACM 34:144\u2013162","journal-title":"J ACM"},{"key":"523_CR10","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"DS Hochbaum","year":"1988","unstructured":"Hochbaum DS, Shmoys DB (1988) A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J Comput 17:539\u2013551","journal-title":"SIAM J Comput"},{"key":"523_CR11","first-page":"533","volume-title":"Mixed integer nonlinear programming. The IMA volumes in mathematics and its applications","author":"M K\u00f6ppe","year":"2012","unstructured":"K\u00f6ppe M (2012) On the complexity of nonlinear mixed-integer optimization. In: Lee J, Leyffer S (eds) Mixed integer nonlinear programming. The IMA volumes in mathematics and its applications, vol 154. Springer, New York, pp 533\u2013557"},{"key":"523_CR12","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs A (2006) Tighter approximation bounds for LPT scheduling in two special cases. In Calamoneri T, Finocchi I, Italiano G F (eds) Algorithms and complexity: 6th Italian conference, CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, pp 187\u2013198","DOI":"10.1007\/11758471_20"},{"key":"523_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00453-008-9224-9","volume":"57","author":"A Kov\u00e1cs","year":"2010","unstructured":"Kov\u00e1cs A (2010) New approximation bounds for LPT scheduling. Algorithmica 57:413\u2013433","journal-title":"Algorithmica"},{"key":"523_CR14","first-page":"175","volume-title":"Theoretical computer science. Lecture Notes in Computer Science","author":"M Kunde","year":"1982","unstructured":"Kunde M (1982) A multifit algorithm for uniform multiprocessor scheduling. In: Cremers AB, Kriegel HP (eds) Theoretical computer science. Lecture Notes in Computer Science, vol 145. Springer, Berlin, pp 175\u2013185"},{"key":"523_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra JK, Shmoys DB, Tardos \u00c9 (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46:259\u2013271","journal-title":"Math Program"},{"key":"523_CR16","first-page":"193","volume":"28","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring RH, Radermacher FJ, Weiss G (1984) Stochastic scheduling problems I\u2014general strategies. Zeitschrift f\u00fcr Oper Res 28:193\u2013260","journal-title":"Zeitschrift f\u00fcr Oper Res"},{"key":"523_CR17","doi-asserted-by":"crossref","unstructured":"Nip K, Wang Z (2019) Two-machine flow shop scheduling problem under linear constraints. In: Li Y, Cardei M, Huang Y (eds) The 13th annual international conference on combinatorial optimization and applications (COCOA 2019). Lecture Notes in Computer Science, vol 11949. Springer Nature, Switzerland AG, pp 400\u2013411","DOI":"10.1007\/978-3-030-36412-0_32"},{"key":"523_CR18","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2016.02.028","volume":"253","author":"K Nip","year":"2016","unstructured":"Nip K, Wang Z, Wang Z (2016) Scheduling under linear constraints. Eur J Oper Res 253:290\u2013297","journal-title":"Eur J Oper Res"},{"key":"523_CR19","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10898-017-0540-y","volume":"69","author":"K Nip","year":"2017","unstructured":"Nip K, Wang Z, Wang Z (2017) Knapsack with variable weights satisfying linear constraints. J Global Optim 69:713\u2013725","journal-title":"J Global Optim"},{"key":"523_CR20","doi-asserted-by":"crossref","unstructured":"Nip K, Wang Z, Shi T (2019) Some graph optimization problems with weights satisfying linear constraints. In: Li Y, Cardei M, Huang Y (eds) The 13th annual international conference on combinatorial optimization and applications (COCOA 2019). Lecture Notes in Computer Science, vol 11949. Springer Nature, Switzerland AG, pp 412\u2013424","DOI":"10.1007\/978-3-030-36412-0_33"},{"key":"523_CR21","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1007\/s10878-017-0140-2","volume":"34","author":"Z Wang","year":"2017","unstructured":"Wang Z, Nip K (2017) Bin packing under linear constraints. J Comb Optim 34:1198\u20131209","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00523-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00523-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00523-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:45:31Z","timestamp":1664354731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00523-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,15]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["523"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00523-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,2,15]]},"assertion":[{"value":"15 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}