{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T20:41:27Z","timestamp":1726432887751},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424925_50","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T11:14:27Z","timestamp":1295090067000},"page":"467-476","source":"Crossref","is-referenced-by-count":8,"title":["New Heuristics for No-Wait Flowshop Scheduling with Precedence Constraints and Sequence Dependent Setup Time"],"prefix":"10.1007","author":[{"given":"Young Hae","family":"Lee","sequence":"first","affiliation":[]},{"given":"Jung Woo","family":"Jung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/S0305-0548(02)00068-0","volume":"30","author":"T. Aldowaisan","year":"2003","unstructured":"Aldowaisan, T., Allahverdi, A.: New Heuristics for No-wait Flowshops to Minimize Makespan. Comput. Oper. Res\u00a030, 1219\u20131231 (2003)","journal-title":"Comput. Oper. Res"},{"key":"50_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0167-6377(95)00008-8","volume":"17","author":"H. Emmons","year":"1995","unstructured":"Emmons, H., Mathur, K.: Lot Sizing in a No-wait Flowshop. Oper. Res. Lett.\u00a017, 159\u2013164 (1995)","journal-title":"Oper. Res. Lett."},{"key":"50_CR3","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0925-5273(93)90042-J","volume":"32","author":"R. Gangadharan","year":"1993","unstructured":"Gangadharan, R., Rajendran, C.: Heuristic Algorithms for Scheduling in the Nowait Flow-shop. Int. J. Prod. Econ.\u00a032, 285\u2013290 (1993)","journal-title":"Int. J. Prod. Econ."},{"key":"50_CR4","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1057\/palgrave.jors.2601026","volume":"51","author":"Y.F. Hung","year":"2000","unstructured":"Hung, Y.F., Chien, K.L.: A Multi-class Multi-level Capacitated Lot Sizing Model. J. Oper. Res. Soc.\u00a051, 1309\u20131318 (2000)","journal-title":"J. Oper. Res. Soc."},{"key":"50_CR5","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1057\/jors.1996.79","volume":"47","author":"J.K. Lee","year":"1996","unstructured":"Lee, J.K., Kim, Y.D.: Search Heuristics for Resource Constrained Project Scheduling. J. Oper. Res. Soc.\u00a047, 678\u2013689 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0305-0548(99)00138-0","volume":"28","author":"B.M.T. Lin","year":"2001","unstructured":"Lin, B.M.T., Cheng, T.C.E.: Batch Scheduling in the No-wait Two-machine Flowshop to Minimize the Makespan. Comput. Oper. Res.\u00a028, 613\u2013624 (2001)","journal-title":"Comput. Oper. Res."},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"F.A. Ogbu","year":"1990","unstructured":"Ogbu, F.A., Smith, D.K.: The Application of the Simulated Annealing Algorithm to the Solution of the n\/m\/Cmax Flowshop Problem. Comput. Oper. Res.\u00a017, 243\u2013253 (1990)","journal-title":"Comput. Oper. Res."},{"key":"50_CR8","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1057\/jors.1994.65","volume":"45","author":"C. Rajendran","year":"1994","unstructured":"Rajendran, C.: A No-wait Flowshop Scheduling Heuristic to Minimize Makespan. J. Oper. Res. Soc.\u00a045, 472\u2013478 (1994)","journal-title":"J. Oper. Res. Soc."},{"key":"50_CR9","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/62.65","volume":"31","author":"H. R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H.: The Three-machine No-wait Flow Shop is NP-complete. J. ACM.\u00a031, 336\u2013345 (1984)","journal-title":"J. ACM."},{"key":"50_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0020-0190(01)00181-8","volume":"80","author":"G. Wang","year":"2001","unstructured":"Wang, G., Cheng, T.C.E.: Heuristics for Two-machine No-wait Flowshop Scheduling with an Availability Constraint. Inform. Process. Lett.\u00a080, 305\u2013309 (2001)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:37:39Z","timestamp":1558294659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11424925_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}