{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:01:49Z","timestamp":1742986909375,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_21","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"314-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Related Machine Scheduling with Machine Speeds Satisfying Linear Constraints"],"prefix":"10.1007","author":[{"given":"Siyun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Kameng","family":"Nip","sequence":"additional","affiliation":[]},{"given":"Zhenbo","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"issue":"7","key":"21_CR1","first-page":"193","volume":"28","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems I-general strategies. Zeitschrift f\u00fcr Oper. Res. 28(7), 193\u2013260 (1984)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","volume":"41","author":"RL Daniels","year":"1995","unstructured":"Daniels, R.L., Kouvelis, P.: Robust scheduling to hedge against processing time uncertainty in single-stage production. Manag. Sci. 41(2), 363\u2013376 (1995)","journal-title":"Manag. Sci."},{"issue":"2","key":"21_CR3","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.: Scheduling under linear constraints. Eur. J. Oper. Res. 253(2), 290\u2013297 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"21_CR4","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.: Bin packing under linear constraints. J. Comb. Optim. 34(4), 1198\u20131209 (2017)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"21_CR5","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.: Knapsack with variable weights satisfying linear constraints. J. Glob. Optim. 69(3), 713\u2013725 (2017)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1), 259\u2013271 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"DS Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Comput. 17(3), 539\u2013551 (1988)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"21_CR8","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"21_CR9","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-1-4614-1927-3_19","volume-title":"Mixed Integer Nonlinear Programming","author":"M K\u00f6ppe","year":"2012","unstructured":"K\u00f6ppe, M.: 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, pp. 533\u2013557. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_19"},{"key":"21_CR10","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.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1137\/0213044","volume":"13","author":"G Dobson","year":"1984","unstructured":"Dobson, G.: Scheduling independent tasks on uniform processors. SIAM J. Comput. 13(4), 705\u2013716 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y Cho","year":"1980","unstructured":"Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM J. Comput. 9(1), 91\u2013103 (1980)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T Gonzalez","year":"1977","unstructured":"Gonzalez, T., Ibarra, O.H., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM J. Comput. 6(1), 155\u2013166 (1977)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/0216037","volume":"16","author":"DK Friesen","year":"1987","unstructured":"Friesen, D.K.: Tighter bounds for LPT scheduling on uniform processors. SIAM J. Comput. 16(3), 554\u2013560 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"21_CR15","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.: New approximation bounds for LPT scheduling. Algorithmica 57(2), 413\u2013433 (2010)","journal-title":"Algorithmica"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BFb0036479","volume-title":"Theoretical Computer Science","author":"M Kunde","year":"1982","unstructured":"Kunde, M.: A multifit algorithm for uniform multiprocessor scheduling. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol. 145, pp. 175\u2013185. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0036479"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/11758471_20","volume-title":"Algorithms and Complexity","author":"A Kov\u00e1cs","year":"2006","unstructured":"Kov\u00e1cs, A.: Tighter approximation bounds for LPT scheduling in two special cases. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 187\u2013198. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11758471_20"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1007\/978-1-4613-0303-9_25","volume-title":"Handbook of Combinatorial Optimization: Volume 1\u20133","author":"B Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithms and approximability. In: Du, D., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization: Volume 1\u20133, pp. 1493\u20131641. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_25"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:49:11Z","timestamp":1710344951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}