{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T06:29:07Z","timestamp":1744784947904,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029264"},{"type":"electronic","value":"9783642029271"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02927-1_56","type":"book-chapter","created":{"date-parts":[[2009,7,4]],"date-time":"2009-07-04T04:37:10Z","timestamp":1246682230000},"page":"677-688","source":"Crossref","is-referenced-by-count":2,"title":["Improved Bounds for Flow Shop Scheduling"],"prefix":"10.1007","author":[{"given":"Monaldo","family":"Mastrolilli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"56_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/rsa.3240020402","volume":"2","author":"J. Beck","year":"1991","unstructured":"Beck, J.: An algorithmic approach to the lovasz local lemma. Random Structures and Algorithms\u00a02(4), 343\u2013365 (1991)","journal-title":"Random Structures and Algorithms"},{"key":"56_CR2","first-page":"21","volume":"3","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C., Woeginger, G.: A review of machine scheduling: Complexity, algorithms and approximability. Handbook of Combinatorial Optimization\u00a03, 21\u2013169 (1998)","journal-title":"Handbook of Combinatorial Optimization"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Scheideler, C.: A new algorithm approach to the general lov\u00e1sz local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC, pp. 38\u201347 (2000)","DOI":"10.1145\/335305.335310"},{"issue":"3","key":"56_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s004930200018","volume":"22","author":"U. Feige","year":"2002","unstructured":"Feige, U., Scheideler, C.: Improved bounds for acyclic job shop scheduling. Combinatorica\u00a022(3), 361\u2013399 (2002)","journal-title":"Combinatorica"},{"issue":"1","key":"56_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/S0895480199326104","volume":"14","author":"L. Goldberg","year":"2001","unstructured":"Goldberg, L., Paterson, M., Srinivasan, A., Sweedyk, E.: Better approximation guarantees for job-shop scheduling. SIAM Journal on Discrete Mathematics\u00a014(1), 67\u201392 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"56_CR6","first-page":"287","volume-title":"Annals of Discrete Mathematics","author":"R. Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Annals of Discrete Mathematics, vol.\u00a05, pp. 287\u2013326. North-Holland, Amsterdam (1979)"},{"issue":"2","key":"56_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/ijoc.13.2.157.10520","volume":"13","author":"H. Hoogeveen","year":"2001","unstructured":"Hoogeveen, H., Schuurman, P., Woeginger, G.J.: Non-approximability results for scheduling problems with minsum criteria. INFORMS Journal on Computing\u00a013(2), 157\u2013168 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: FOCS, pp. 600\u2013609 (2001)","DOI":"10.1109\/SFCS.2001.959936"},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"E. Lawler","year":"1993","unstructured":"Lawler, E., Lenstra, J., Kan, A.R., Shmoys, D.: Sequencing and scheduling: Algorithms and complexity. Handbook in Operations Research and Management Science\u00a04, 445\u2013522 (1993)","journal-title":"Handbook in Operations Research and Management Science"},{"issue":"2","key":"56_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica\u00a014(2), 167\u2013186 (1994)","journal-title":"Combinatorica"},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"F.T. Leighton","year":"1999","unstructured":"Leighton, F.T., Maggs, B.M., Richa, A.W.: Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica\u00a019, 375\u2013401 (1999)","journal-title":"Combinatorica"},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"Mastrolilli, M., Svensson, O.: (Acyclic) jobshops are hard to approximate. In: FOCS, pp. 583\u2013592 (2008)","DOI":"10.1109\/FOCS.2008.36"},{"key":"56_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-68891-4_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"V. Nagarajan","year":"2008","unstructured":"Nagarajan, V., Sviridenko, M.: Tight bounds for permutation flow shop scheduling. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 154\u2013168. Springer, Heidelberg (2008)"},{"key":"56_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0167-6377(91)90014-G","volume":"10","author":"C. Potts","year":"1991","unstructured":"Potts, C., Shmoys, D., Williamson, D.: Permutation vs. nonpermutation flow shop schedules. Operations Research Letters\u00a010, 281\u2013284 (1991)","journal-title":"Operations Research Letters"},{"issue":"4","key":"56_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/jos.96","volume":"5","author":"M. Queyranne","year":"2002","unstructured":"Queyranne, M., Sviridenko, M.: Approximation algorithms for shop scheduling problems with minsum objective. Journal of Scheduling\u00a05(4), 287\u2013305 (2002)","journal-title":"Journal of Scheduling"},{"issue":"5","key":"56_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling\u00a02(5), 203\u2013213 (1999)","journal-title":"Journal of Scheduling"},{"key":"56_CR17","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/S009753979222676X","volume":"23","author":"D. Shmoys","year":"1994","unstructured":"Shmoys, D., Stein, C., Wein, J.: Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing\u00a023, 617\u2013632 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"56_CR18","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"D. Williamson","year":"1997","unstructured":"Williamson, D., Hall, L., Hoogeveen, J., Hurkens, C., Lenstra, J., Sevastianov, S., Shmoys, D.: Short shop schedules. Operations Research\u00a045, 288\u2013294 (1997)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02927-1_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T02:53:20Z","timestamp":1558407200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02927-1_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029264","9783642029271"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02927-1_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}