{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:12:52Z","timestamp":1725567172892},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162381"},{"type":"electronic","value":"9783642162398"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16239-8_31","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T23:14:43Z","timestamp":1285888483000},"page":"230-237","source":"Crossref","is-referenced-by-count":4,"title":["A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Christoforos","family":"Charalambous","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Fleszar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalil S.","family":"Hindi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Arnaout, J.P., Rabadi, G., Musa, R.: A two-stage ant colony optimisation algorithm to monomize the makespan of unrelated parallel machines with sequence-dependent setup times. Journal of Intelligent Manufacturing (2009) (forthcoming)","DOI":"10.1007\/s10845-009-0246-1"},{"key":"31_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling computer and manufacturing processes","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling computer and manufacturing processes. Springer, Berlin (1996)"},{"key":"31_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P.: Scheduling algorithms. Springer, Berlin (2004)"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ejor.2004.04.015","volume":"165","author":"M. Ghirardi","year":"2005","unstructured":"Ghirardi, M., Potts, C.N.: Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research\u00a0165(2), 457\u2013467 (2005)","journal-title":"European Journal of Operational Research"},{"key":"31_CR5","volume-title":"Handbook of applied optimization","author":"C.-Y. Lee","year":"2002","unstructured":"Lee, C.-Y., Pinedo, M.: Optimization and heuristics of scheduling. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of applied optimization. Oxford University Press, New York (2002)"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0166-218X(96)00087-X","volume":"75","author":"S. Martello","year":"1997","unstructured":"Martello, S., Soumis, F., Toth, P.: Exact and approximation algorithms for makespan minimization on unrelated parallel machines. Discrete Applied Mathematics\u00a075, 169\u2013188 (1997)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"31_CR7","first-page":"193","volume":"18","author":"E. Mokotoff","year":"2001","unstructured":"Mokotoff, E.: Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research\u00a018(2), 193\u2013242 (2001)","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0377-2217(01)00270-3","volume":"141","author":"E. Mokotoff","year":"2002","unstructured":"Mokotoff, E., Chretienne, P.: A cutting plane algorithm for the unrelated parallel machine scheduling problem. European Journal of Operational Research\u00a0141(3), 515\u2013525 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"1-4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1021569406280","volume":"117","author":"E. Mokotoff","year":"2002","unstructured":"Mokotoff, E., Jimeno, J.L.: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Annals of Operations Research\u00a0117(1-4), 133\u2013150 (2002)","journal-title":"Annals of Operations Research"},{"key":"31_CR10","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice Hall, New Jersey (2002)","edition":"2"},{"issue":"6","key":"31_CR11","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/nav.20157","volume":"53","author":"E.V. Shchepin","year":"2006","unstructured":"Shchepin, E.V., Vakhania, N.: An absolute approximation algorithm for scheduling unrelated machines. Naval Research Logistics\u00a053(6), 502\u2013507 (2006)","journal-title":"Naval Research Logistics"},{"issue":"2","key":"31_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.orl.2004.05.004","volume":"33","author":"E.V. Shchepin","year":"2005","unstructured":"Shchepin, E.V., Vakhania, N.: An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters\u00a033(2), 127\u2013133 (2005)","journal-title":"Operations Research Letters"}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16239-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:46:27Z","timestamp":1606167987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16239-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162381","9783642162398"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16239-8_31","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2010]]}}}