{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:52:28Z","timestamp":1725475948774},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340751"},{"type":"electronic","value":"9783540340768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751595_58","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T10:27:59Z","timestamp":1147343279000},"page":"546-553","source":"Crossref","is-referenced-by-count":1,"title":["Cost \u2013 Time Trade Off Models Application to Crashing Flow Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Morteza","family":"Bagherpour","sequence":"first","affiliation":[]},{"given":"Siamak","family":"Noori","sequence":"additional","affiliation":[]},{"given":"S. Jafar","family":"Sadjadi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","first-page":"345","volume":"32","author":"T. Aldowaisan","year":"2004","unstructured":"Aldowaisan, T., Allahverdi, A.: New heuristics for m-machine no-wait flowshop to minimize total completion time. International journal of management science\u00a032, 345\u2013352 (2004)","journal-title":"International journal of management science"},{"issue":"B","key":"58_CR2","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"H.G. Campbell","year":"1970","unstructured":"Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science\u00a016(B), 630\u2013637 (1970)","journal-title":"Management Science"},{"issue":"11","key":"58_CR3","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","volume":"23","author":"D.G. Dannenbring","year":"1977","unstructured":"Dannenbring, D.G.: An evaluation of flow shop sequencing heuristics. Management Science\u00a023(11), 1174\u20131182 (1977)","journal-title":"Management Science"},{"issue":"1","key":"58_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1057\/jors.1971.18","volume":"22","author":"J.N.D. Gupta","year":"1971","unstructured":"Gupta, J.N.D.: A functional heuristic algorithm for the flow shop scheduling problem. Operational Research Quarterly\u00a022(1), 39\u201347 (1971)","journal-title":"Operational Research Quarterly"},{"key":"58_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0377-2217(91)90080-F","volume":"52","author":"J.C. Ho","year":"1990","unstructured":"Ho, J.C., Chang, Y.L.: A new heuristic for the n-job, m-machine flow shop problem. European Journal of Operational Research\u00a052, 194\u2013206 (1990)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"58_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly\u00a01(1), 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"58_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1057\/jors.1965.7","volume":"16","author":"Z.A. Lomnicki","year":"1965","unstructured":"Lomnicki, Z.A.: A branch and bound algorithm for the exact solution of the three-machine scheduling problem. Operational Research Quarterly\u00a016(1), 89\u2013100 (1965)","journal-title":"Operational Research Quarterly"},{"key":"58_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research\u00a091, 160\u2013175 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"58_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M. Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA: International Journal of Management Science\u00a011(1), 91\u201395 (1983)","journal-title":"OMEGA: International Journal of Management Science"},{"key":"58_CR10","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 flow shop problem. Computers and Operations Research\u00a017, 243\u2013253 (1990)","journal-title":"Computers and Operations Research"},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I.H. Osman","year":"1989","unstructured":"Osman, I.H., Potts, C.N.: Simulated annealing for permutation flow shop scheduling. OMEGA: International Journal of Management Science\u00a017, 551\u2013557 (1989)","journal-title":"OMEGA: International Journal of Management Science"},{"issue":"1","key":"58_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1057\/jors.1965.8","volume":"16","author":"D.S. Palmer","year":"1965","unstructured":"Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time\u2014a quick method of obtaining a near optimum. Operational Research Quarterly\u00a016(1), 101\u2013107 (1965)","journal-title":"Operational Research Quarterly"},{"key":"58_CR13","first-page":"303","volume":"45","author":"H. Rkock","year":"1982","unstructured":"Rkock, H., Schmidt, G.: Machine aggregation heuristics in shop scheduling. Methods of Operations Research\u00a045, 303\u2013314 (1982)","journal-title":"Methods of Operations Research"},{"key":"58_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E. Taillard","year":"1990","unstructured":"Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research\u00a047, 65\u201374 (1990)","journal-title":"European Journal of Operational Research"},{"key":"58_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0305-0483(87)90054-5","volume":"15","author":"S. Turner","year":"1987","unstructured":"Turner, S., Booth, D.: Comparison of heuristics for flow shop sequencing. OMEGA: International Journal of Management Science\u00a015, 75\u201378 (1987)","journal-title":"OMEGA: International Journal of Management Science"},{"key":"58_CR16","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M. Widmer","year":"1989","unstructured":"Widmer, M., Hertz, A.: A new heuristic for the flow shop sequencing problem. European Journal of Operational Research\u00a041, 186\u2013193 (1989)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751595_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:00:04Z","timestamp":1619492404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751595_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340751","9783540340768"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11751595_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}