{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:10:11Z","timestamp":1743099011478,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"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_22","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"329-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Open-Shop Scheduling for Unit Jobs Under Precedence Constraints"],"prefix":"10.1007","author":[{"given":"An","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0377-2217(94)90335-2","volume":"72","author":"H Br\u00e4sel","year":"1994","unstructured":"Br\u00e4sel, H., Kluge, D., Werner, F.: A polynomial algorithm for the $$[n\/m\/0, t_{ij}=1, tree\/C_{\\max }]$$ open shop problem. Eur. J. Oper. Res. 72, 125\u2013134 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69516-5","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-3-540-69516-5"},{"key":"22_CR3","first-page":"59","volume":"37","author":"P Brucker","year":"1993","unstructured":"Brucker, P., Jurisch, B., Jurisch, M.Z.: Open shop problems with unit time operations. Oper. Res. 37, 59\u201373 (1993)","journal-title":"Oper. Res."},{"key":"22_CR4","unstructured":"Brucker, P., Knust, S.: Complexity results for scheduling problems (2009). http:\/\/www2.informatik.uni-osnabrueck.de\/knust\/class\/"},{"key":"22_CR5","unstructured":"D\u00fcrr, C.: The scheduling zoo (2016). http:\/\/schedulingzoo.lip6.fr"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzalez","year":"1976","unstructured":"Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23, 665\u2013679 (1976)","journal-title":"J. ACM"},{"key":"22_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9435-8_8","volume-title":"Mathematics Today Twelve Informal Essays","author":"RL Graham","year":"1978","unstructured":"Graham, R.L.: Combinatorial scheduling theory. In: Steen, L.A. (ed.) Mathematics Today Twelve Informal Essays. Springer, New York (1978). https:\/\/doi.org\/10.1007\/978-1-4613-9435-8_8"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26, 22\u201335 (1978)","journal-title":"Oper. Res."},{"key":"22_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, Algorithm and Systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithm and Systems. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-3-319-26580-3"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-017-0519-z","volume":"21","author":"D Prot","year":"2018","unstructured":"Prot, D., Bellenguez-Morinea, O.: A survey on how the structure of precedence constraints may change the complexity class of scheduling problems. J. Sched. 21, 3\u201316 (2018)","journal-title":"J. Sched."},{"key":"22_CR11","first-page":"191","volume":"82","author":"SV Sevastianov","year":"1998","unstructured":"Sevastianov, S.V., Woeginger, G.J.: Makespan minimization in open shops: a polynomial time approximation scheme. Math. Program. 82, 191\u2013198 (1998)","journal-title":"Math. Program."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0166-218X(00)00375-9","volume":"114","author":"SV Sevastianov","year":"2001","unstructured":"Sevastianov, S.V., Woeginger, G.J.: Linear time approximation scheme for the multiprocessor open shop problem. Discrete Appl. Math. 114, 273\u2013288 (2001)","journal-title":"Discrete Appl. Math."},{"key":"22_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1192-8","volume-title":"Scheduling Theory: Multi-Stage Systems","author":"VS Tanaev","year":"1994","unstructured":"Tanaev, V.S., Sotskov, Y.N., Strusevich, V.A.: Scheduling Theory: Multi-Stage Systems. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-94-011-1192-8"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0377-2217(02)00767-1","volume":"149","author":"VG Timkovsky","year":"2003","unstructured":"Timkovsky, V.G.: Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. Eur. J. Oper. Res. 149, 355\u2013376 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"DP Williamson","year":"1997","unstructured":"Williamson, D.P., et al.: Short shop schedules. Oper. Res. 45, 288\u2013294 (1997)","journal-title":"Oper. Res."}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:49:18Z","timestamp":1710344958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_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":"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"}}]}}