{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:42Z","timestamp":1725664362323},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613107"},{"type":"electronic","value":"9783540684534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_28","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:27:21Z","timestamp":1330291641000},"page":"374-388","source":"Crossref","is-referenced-by-count":6,"title":["Minimizing total completion time in a two-machine flowshop: Analysis of special cases"],"prefix":"10.1007","author":[{"given":"Han","family":"Hoogeveen","sequence":"first","affiliation":[]},{"given":"Tsuyoshi","family":"Kawaguchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"28_CR1","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"R.W. Conway, W.L. Maxwell, and L.W. Miller (1967). Theory of Scheduling, Addison-Wesley, Reading, Massachusetts."},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson, and R. Sethi (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 13, 330\u2013348.","journal-title":"Mathematics of Operations Research"},{"key":"28_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco."},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/opre.26.1.36","volume":"26","author":"T. Gonzalez","year":"1978","unstructured":"T. Gonzalez and S. Sahni (1978). Flowshop and jobshop schedules: Complexity and approximation. Operations Research 26, 36\u201352.","journal-title":"Operations Research"},{"key":"28_CR6","first-page":"173","volume":"70","author":"J.A. Hoogeveen","year":"1995","unstructured":"J.A. Hoogeveen and S.L. van De Velde (1995). Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. Mathematical Programming 70, 173\u2013190.","journal-title":"Mathematical Programming"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"13","author":"E. Ignall","year":"1965","unstructured":"E. Ignall and L. Schr\u00e4ge (1965). Application of the branch and bound technique for some flow-shop scheduling problems. Operations Research 13, 400\u2013412.","journal-title":"Operations Research"},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF03500931","volume":"26","author":"S.L. Velde van De","year":"1990","unstructured":"S.L. van De Velde (1990). Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation. Annals of Operations Research 26, 257\u2013268.","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:30:50Z","timestamp":1619573450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}