{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:09Z","timestamp":1725516609835},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_40","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"427-437","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays"],"prefix":"10.1007","author":[{"given":"Yumei","family":"Huo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hairong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11970125_1","volume-title":"Approximation and Online Algorithms","author":"A.A. Ageev","year":"2007","unstructured":"Ageev, A.A., Kononov, A.V.: Approximation Algorithms for Scheduling Problems with Exact Delays. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol.\u00a04368, pp. 1\u201314. Springer, Heidelberg (2007)"},{"issue":"4","key":"40_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.orl.2006.09.006","volume":"35","author":"A.A. Ageev","year":"2007","unstructured":"Ageev, A.A., Kononov, A.V.: Approximation Algorithms for the Single and Two- Machine Scheduling Problems with Exact Delays. Operations Research Letters\u00a035(4), 533\u2013540 (2007)","journal-title":"Operations Research Letters"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/nav.3800290311","volume":"29","author":"I. Adiri","year":"1982","unstructured":"Adiri, I., Pohoryles, D.: Flowshop\/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly\u00a029, 495\u2013504 (1982)","journal-title":"Naval Research Logistics Quarterly"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/0360-8352(96)00042-3","volume":"30","author":"C.L. Chen","year":"1996","unstructured":"Chen, C.L., Neppalli, R.V., Aljaber, N.: Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering\u00a030, 919\u2013929 (1996)","journal-title":"Computers and Industrial Engineering"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/S0377-2217(02)00834-2","volume":"151","author":"A. Fink","year":"2003","unstructured":"Fink, A., Vo\u00df, S.: Solving the continuous flow-shop scheduling problem by mata- heuristics. European Journal of Operational Research\u00a0151, 400\u2013414 (2003)","journal-title":"European Journal of Operational Research"},{"key":"40_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu Search - Part II. ORSA J. on Comp.\u00a02, 4\u201332 (1990)","journal-title":"ORSA J. on Comp."},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/moor.7.1.57","volume":"7","author":"T. Gonzales","year":"1982","unstructured":"Gonzales, T.: Unit Execution Time Shop Problems. Mathematics of Operations Research\u00a07, 57\u201366 (1982)","journal-title":"Mathematics of Operations Research"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Grham","year":"1979","unstructured":"Grham, R.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequence and scheduling: A survey. Annals of Discrete Math.\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Math."},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/nav.3800230206","volume":"23","author":"J.N.D. Gupta","year":"1976","unstructured":"Gupta, J.N.D.: Optimal flowshop schedules with no intermediate storage space. Naval Research Logistics Quarterly\u00a023, 235\u2013243 (1976)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1142\/S0129054107004711","volume":"18","author":"J.Y.-T. Leung","year":"2007","unstructured":"Leung, J.Y.-T., Li, H., Zhao, H.: Scheduling Two-Machine Flow Shops with Exact Delay. International Journal of Foundations of Computer Science\u00a018(2), 341\u2013360 (2007)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"C.H. Papadimitriou","year":"1980","unstructured":"Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. Journal of the ACM\u00a027, 533\u2013549 (1980)","journal-title":"Journal of the ACM"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1002\/1520-6750(199010)37:5<695::AID-NAV3220370508>3.0.CO;2-L","volume":"37","author":"C. Rajendran","year":"1990","unstructured":"Rajendran, C., Chaudhuri, D.: Heursitic algorithms for coninuos flow-shop problem. Naval Research Logistics\u00a037, 695\u2013705 (1990)","journal-title":"Naval Research Logistics"},{"issue":"1","key":"40_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01919082","volume":"28","author":"H. R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H.: Some new results in flow shop scheduling. Mathematical Methods of Operations Research (ZOR)\u00a028(1), 1\u201316 (1984)","journal-title":"Mathematical Methods of Operations Research (ZOR)"},{"issue":"3","key":"40_CR14","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/0377-2217(86)90036-6","volume":"24","author":"C. Sriskandarajah","year":"1986","unstructured":"Sriskandarajah, C., Ladet, P.: Some No-wait Shops Scheduling Problems: Complexity Aspects. European Journal of Operational Research\u00a024(3), 424\u2013438 (1986)","journal-title":"European Journal of Operational Research"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1002\/nav.3800280413","volume":"28","author":"W. Szwarc","year":"1981","unstructured":"Szwarc, W.: A note on the fflow-shop problem without interruptions in job processing. Naval Research Logistics Quarterly\u00a028, 665\u2013669 (1981)","journal-title":"Naval Research Logistics Quarterly"},{"key":"40_CR16","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1057\/jors.1991.187","volume":"42","author":"J.A.A. Veen Van der","year":"1991","unstructured":"Van der Veen, J.A.A., van Dal, R.: Solvable cases of the no-wait flow-shop scheduling problem. Journal of the Oper. Res. Society\u00a042, 971\u2013980 (1991)","journal-title":"Journal of the Oper. Res. Society"},{"key":"40_CR17","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1080\/05695557408974929","volume":"6","author":"J.M. Deman Van","year":"1974","unstructured":"Van Deman, J.M., Baker, K.R.: Minimizing mean flowtime in the flow shop with no intermediate queues. AIIE Transactions\u00a06, 28\u201334 (1974)","journal-title":"AIIE Transactions"},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W. Yu","year":"2004","unstructured":"Yu, W., Hoogeveen, H., Lenstra, J.K.: Minimizing makespan in a two-machine flow shop with delays and unit- time operations is NP-hard. Journal of Scheduling\u00a07, 333\u2013348 (2004)","journal-title":"Journal of Scheduling"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:07Z","timestamp":1619523667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}