{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:10:17Z","timestamp":1742926217137,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046170"},{"type":"electronic","value":"9783030046187"}],"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-04618-7_22","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T20:47:58Z","timestamp":1542401278000},"page":"268-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop"],"prefix":"10.1007","author":[{"given":"Longcheng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanqun","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03088-2","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"1995","unstructured":"Brucker, P.: Scheduling Algorithms. Springer, Berlin (1995). https:\/\/doi.org\/10.1007\/978-3-662-03088-2"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1145\/322261.322265","volume":"28","author":"FY Chin","year":"1981","unstructured":"Chin, F.Y., Tsai, L.L.: On $$j$$-maximal and $$j$$-minimal flow shop schedules. J. ACM 28, 462\u2013476 (1981)","journal-title":"J. ACM"},{"key":"22_CR3","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 and Company, San Francisco (1979)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annu. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Annu. Discret. Math."},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:JOCO.0000021934.29833.6b","volume":"8","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U.: Improved dynamic programming in connection with an FPTAS for the knapsack problem. J. Comb. Optim. 8, 5\u201311 (2004)","journal-title":"J. Comb. Optim."},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2014.11.037","volume":"243","author":"C Koulamas","year":"2015","unstructured":"Koulamas, C., Kyparisis, G.J.: The three-machine proportionate open shop and mixed shop minimum makespan problems. Eur. J. Oper. Res. 243, 70\u201374 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0305-0548(87)90029-3","volume":"14","author":"CY Liu","year":"1987","unstructured":"Liu, C.Y., Bulfin, R.L.: Scheduling ordered open shops. Comput. Oper. Res. 14, 257\u2013264 (1987)","journal-title":"Comput. Oper. Res."},{"key":"22_CR9","unstructured":"Liu, L., et al.: Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR 1809.05745 (2018)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0166-218X(85)80007-X","volume":"11","author":"T Masuda","year":"1985","unstructured":"Masuda, T., Ishii, H., Nishida, T.: The mixed shop scheduling problem. Discret. Appl. Math. 11, 175\u2013186 (1985)","journal-title":"Discret. Appl. Math."},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1287\/mnsc.31.7.852","volume":"31","author":"PS Ow","year":"1985","unstructured":"Ow, P.S.: Focused scheduling in proportionate flowshops. Manag. Sci. 31, 852\u2013869 (1985)","journal-title":"Manag. Sci."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/nav.21518","volume":"60","author":"S Panwalkar","year":"2013","unstructured":"Panwalkar, S., Smith, M.L., Koulamas, C.: Review of the ordered and proportionate flow shop scheduling research. Nav. Res. Logist. 60, 46\u201355 (2013)","journal-title":"Nav. Res. Logist."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1018943016617","volume":"92","author":"N Shakhlevich","year":"1999","unstructured":"Shakhlevich, N., Sotskov, Y.N., Werner, F.: Shop-scheduling problems with fixed and non-fixed machine orders of the jobs. Ann. Oper. Res. 92, 281\u2013304 (1999)","journal-title":"Ann. Oper. Res."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02243393","volume":"52","author":"NV Shakhlevich","year":"1994","unstructured":"Shakhlevich, N.V., Sotskov, Y.N.: Scheduling two jobs with fixed and nonfixed routes. Computing 52, 17\u201330 (1994)","journal-title":"Computing"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0377-2217(99)00161-7","volume":"120","author":"NV Shakhlevich","year":"2000","unstructured":"Shakhlevich, N.V., Sotskov, Y.N., Werner, F.: Complexity of mixed shop scheduling problems: a survey. Eur. J. Oper. Res. 120, 343\u2013351 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1057\/jors.1991.96","volume":"42","author":"VA Strusevich","year":"1991","unstructured":"Strusevich, V.A.: Two-machine super-shop scheduling problem. J. Oper. Res. Soc. 42, 479\u2013492 (1991)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:45:37Z","timestamp":1710344737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_22","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":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 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":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}