{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T02:30:54Z","timestamp":1768703454700,"version":"3.49.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319947754","type":"print"},{"value":"9783319947761","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-94776-1_18","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"205-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph"],"prefix":"10.1007","author":[{"given":"Yinhui","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangting","family":"Chen","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":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longcheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.20200","volume":"50","author":"K Asdre","year":"2007","unstructured":"Asdre, K., Nikolopoulos, S.D.: A linear-time algorithm for the $$k$$-fixed-endpoint path cover problem on cographs. Networks 50, 231\u2013240 (2007)","journal-title":"Networks"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.tcs.2009.11.003","volume":"411","author":"K Asdre","year":"2010","unstructured":"Asdre, K., Nikolopoulos, S.D.: A polynomial solution to the $$k$$-fixed-endpoint path cover problem on proper interval graphs. Theoret. Comput. Sci. 411, 967\u2013975 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(96)00031-X","volume":"162","author":"BS Baker","year":"1996","unstructured":"Baker, B.S., Coffman, E.G.: Mutual exclusion scheduling. Theoret. Comput. Sci. 162, 225\u2013243 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.cor.2011.04.014","volume":"39","author":"M Bendraouche","year":"2012","unstructured":"Bendraouche, M., Boudhar, M.: Scheduling jobs on identical machines with agreement graph. Comput. Oper. Res. 39, 382\u2013390 (2012)","journal-title":"Comput. Oper. Res."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"3508","DOI":"10.1080\/00207543.2015.1073860","volume":"54","author":"M Bendraouche","year":"2016","unstructured":"Bendraouche, M., Boudhar, M.: Scheduling with agreements: new results. Int. J. Prod. Res. 54, 3508\u20133522 (2016)","journal-title":"Int. J. Prod. Res."},{"key":"18_CR6","unstructured":"B\u0142a\u017cewicz, J., et al.: Scheduling Under Resource Constraints - Deterministic Models (1986)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF02283747","volume":"16","author":"J B\u0142a\u017cewicz","year":"1988","unstructured":"B\u0142a\u017cewicz, J., et al.: Scheduling unit - time tasks on flow - shops under resource constraints. Ann. Oper. Res. 16, 255\u2013266 (1988)","journal-title":"Ann. Oper. Res."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., et al.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11\u201324 (1983)","journal-title":"Discrete Appl. Math."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)00057-4","volume":"148","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Theoret. Comput. Sci. 148, 93\u2013109 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1287\/opre.44.6.891","volume":"44","author":"B Chen","year":"1996","unstructured":"Chen, B., et al.: A new heuristic for three-machine flow shop scheduling. Oper. Res. 44, 891\u2013898 (1996)","journal-title":"Oper. Res."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10951-008-0089-1","volume":"12","author":"G Even","year":"2009","unstructured":"Even, G., et al.: Scheduling with conflicts: online and offline algorithms. J. Sched. 12, 199\u2013224 (2009)","journal-title":"J. Sched."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: STOC 1983, pp. 448\u2013456 (1983)","DOI":"10.1145\/800061.808776"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M.R., Graham, R.L.: Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4, 187\u2013200 (1975)","journal-title":"SIAM J. Comput."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4, 397\u2013411 (1975)","journal-title":"SIAM J. Comput."},{"key":"18_CR15","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":"18_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., et al.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., et al.: The planar hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5, 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"18_CR18","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier, New York (2004)"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/opre.26.1.36","volume":"26","author":"T Gonzalez","year":"1978","unstructured":"Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 26, 36\u201352 (1978)","journal-title":"Oper. Res."},{"key":"18_CR20","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., et al.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"18_CR21","first-page":"175","volume":"82","author":"LA Hall","year":"1998","unstructured":"Hall, L.A.: Approximability of flow shop scheduling. Math. Program. 82, 175\u2013190 (1998)","journal-title":"Math. Program."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0890-5401(02)00032-9","volume":"180","author":"MM Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., et al.: Multicoloring trees. Inf. Comput. 180, 113\u2013129 (2003)","journal-title":"Inf. Comput."},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-machine production schedules with setup times included. Naval Res. Logist. 1, 61\u201368 (1954)","journal-title":"Naval Res. Logist."},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156, 291\u2013298 (1996)","journal-title":"Discrete Math."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ipl.2007.12.006","volume":"107","author":"LL Pao","year":"2008","unstructured":"Pao, L.L., Hong, C.H.: The two-equal-disjoint path cover problem of matching composition network. Inf. Process. Lett. 107, 18\u201323 (2008)","journal-title":"Inf. Process. Lett."},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: gap location. Comput. Complex. 4, 133\u2013157 (1994)","journal-title":"Comput. Complex."},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"S5","DOI":"10.1186\/1471-2105-15-S9-S5","volume":"15","author":"R Rizzi","year":"2014","unstructured":"Rizzi, R., et al.: On the complexity of minimum path cover with subpath constraints for multi-assembly. BMC Bioinform. 15, S5 (2014)","journal-title":"BMC Bioinform."},{"key":"18_CR28","unstructured":"R\u00f6ck, H.: Scheduling unit task shops with resource constraints and excess usage costs. Technical report, Fachbereich Informatik, Technical University of Berlin, Berlin (1983)"},{"key":"18_CR29","first-page":"1","volume":"28","author":"H R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H.: Some new results in flow shop scheduling. Zeitschrift f\u00fcr Oper. Res. 28, 1\u201316 (1984)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"key":"18_CR30","first-page":"497","volume":"36","author":"H S\u00fcral","year":"1992","unstructured":"S\u00fcral, H., et al.: Scheduling unit-time tasks in renewable resource constrained flowshops. Zeitschrift f\u00fcr Oper. Res. 36, 497\u2013516 (1992)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"key":"18_CR31","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1080\/00207543.2016.1206672","volume":"55","author":"NEH Tellache","year":"2017","unstructured":"Tellache, N.E.H., Boudhar, M.: Two-machine flow shop problem with unit-time operations and conflict graph. Int. J. Prod. Res. 55, 1664\u20131679 (2017)","journal-title":"Int. J. Prod. Res."},{"key":"18_CR32","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10479-017-2560-x","volume":"261","author":"NEH Tellache","year":"2018","unstructured":"Tellache, N.E.H., Boudhar, M.: Flow shop scheduling problem with conflict graphs. Ann. Oper. Res. 261, 339\u2013363 (2018)","journal-title":"Ann. Oper. Res."},{"key":"18_CR33","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","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:34:12Z","timestamp":1710347652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}