{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:33:50Z","timestamp":1694626430614},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T00:00:00Z","timestamp":1155600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T00:00:00Z","timestamp":1155600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optimization Letters"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s11590-006-0020-7","type":"journal-article","created":{"date-parts":[[2006,8,14]],"date-time":"2006-08-14T10:04:30Z","timestamp":1155549870000},"page":"213-225","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Heuristic for a new multiobjective scheduling problem"],"prefix":"10.1007","volume":"1","author":[{"given":"Anne","family":"Set\u00e4maa-K\u00e4rkk\u00e4inen","sequence":"first","affiliation":[]},{"given":"Kaisa","family":"Miettinen","sequence":"additional","affiliation":[]},{"given":"Jarkko","family":"Vuori","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,15]]},"reference":[{"key":"20_CR1","first-page":"1","volume-title":"Surveys in Combinatorial Optimization, vol 31 of Annals of Discrete Mathematics.","author":"J. B\u0142a\u017cewicz","year":"1987","unstructured":"B\u0142a\u017cewicz J. (1987) Selected topics in scheduling theory. In: Martello S., Laporte G., Minoux M., Ribeiro C. (eds) Surveys in Combinatorial Optimization, vol 31 of Annals of Discrete Mathematics. Elsevier, Amsterdam, p. 1\u201359"},{"key":"20_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L. (1990) Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company, New York"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0377-2217(02)00595-7","volume":"151","author":"M. Ehrgott","year":"2003","unstructured":"Ehrgott M., Tenfelde-Podehl D. (2003) Computation of ideal and Nadir values and implications for their use in MCDM methods. Eur. J. Operat. Res. 151(1): 119\u2013139","journal-title":"Eur. J. Operat. Res."},{"key":"20_CR4","first-page":"287","volume-title":"Discrete optimization II, vol 5 of Annals of Discrete Mathematics.","author":"R.L. Graham","year":"1979","unstructured":"Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer P.L., Johnson E.L., Korte B.H. (eds) Discrete optimization II, vol 5 of Annals of Discrete Mathematics. North-Holland Publishing Company, Amsterdam, pp. 287\u2013326"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/MWC.2003.1182111","volume":"10","author":"E. Gustafsson","year":"2003","unstructured":"Gustafsson E., Jonsson A. (2003) Always best connected. IEEE Wirel. Commun. 10(1): 49\u201355","journal-title":"IEEE Wirel. Commun."},{"key":"20_CR6","volume-title":"Approximation Algorithms for NP-hard Problems.","author":"L.A. Hall","year":"1997","unstructured":"Hall L.A. (1997) Approximation algorithms for scheduling. In: Hochbaum D.S. (ed) Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston"},{"key":"20_CR7","unstructured":"ILOG CPLEX 8.0 User\u2019s Manual. ILOG, (2002)"},{"key":"20_CR8","unstructured":"Intel XScale Microarchitecture, Technical Summary. Intel Corporation, (2000)"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/moor.26.2.324.10559","volume":"26","author":"K. Jansen","year":"2001","unstructured":"Jansen K., Porkolab L. (2001) Improved approximation schemes for scheduling unrelated parallel machines. Math. Oper. Res. 26(2): 324\u2013338","journal-title":"Math. Oper. Res."},{"key":"20_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2002","unstructured":"Korte B., Vygen J. (2002) Combinatorial Optimization: Theory and Algorithms. Springer, Berlin Heidelberg New York"},{"key":"20_CR11","volume-title":"Nonlinear Multiobjective Optimization","author":"K. Miettinen","year":"1999","unstructured":"Miettinen K. (1999) Nonlinear Multiobjective Optimization. Kluwer, Dordrecht"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Miettinen K., M\u00e4kel\u00e4, M.M., Kaario K.: Experiments with classification-based scalarizing functions in interactive multiobjective optimization. Eur. J. Oper. Res. (2006) (to appear)","DOI":"10.1016\/j.ejor.2005.06.019"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","volume":"81","author":"A. Nagar","year":"1995","unstructured":"Nagar A., Haddock J., Heragu S. (1995) Multiple and bicriteria scheduling: a literature survey. Eur. J. Oper. Res. 81(1): 88\u2013104","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"20_CR14","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1016\/j.cor.2005.02.006","volume":"33","author":"A. Set\u00e4maa-K\u00e4rkk\u00e4inen","year":"2006","unstructured":"Set\u00e4maa-K\u00e4rkk\u00e4inen A., Miettinen K., Vuori J. (2006) Best compromise solution for a new multiobjective scheduling problem. Comput. Oper. Res. 33(8): 2353\u20132368","journal-title":"Comput. Oper. Res."},{"key":"20_CR15","first-page":"445","volume-title":"Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys.","author":"V. T\u2019Kindt","year":"2002","unstructured":"T\u2019Kindt V., Billaut J.-C. (2002) Multicriteria scheduling problems. In: Ehrgott M., Gandibleux X. (eds) Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys. Kluwer, Dordrecht, pp. 445\u2013491"},{"key":"20_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04986-0","volume-title":"Multicriteria Scheduling: Theory, Models and Algorithms","author":"V. T\u2019kindt","year":"2002","unstructured":"T\u2019kindt V., Billaut J.-C. (2002) Multicriteria Scheduling: Theory, Models and Algorithms. Springer, Berlin Heidelberg New York"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1287\/opre.42.2.234","volume":"42","author":"M.A. Trick","year":"1994","unstructured":"Trick M.A. (1994) Scheduling multiple variable-speed machines. Oper. Res. 42(2): 234\u2013248","journal-title":"Oper. Res."},{"issue":"6","key":"20_CR18","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/2.953469","volume":"34","author":"U. Varshney","year":"2001","unstructured":"Varshney U., Jain R. (2001) Issues in emerging 4G wireless networks. IEEE Comput. 34(6): 94\u201396","journal-title":"IEEE Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0020-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-006-0020-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0020-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0020-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T17:58:06Z","timestamp":1652810286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-006-0020-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,15]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s11590-006-0020-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,15]]},"assertion":[{"value":"19 May 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}