{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T18:36:43Z","timestamp":1697567803914},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s10589-005-4801-1","type":"journal-article","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T17:03:45Z","timestamp":1127840625000},"page":"299-320","source":"Crossref","is-referenced-by-count":9,"title":["Minimizing Labor Requirements in a Periodic Vehicle Loading Problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Cristina","family":"Delgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaqu\u00edn","family":"Pacheco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4801_CR1","unstructured":"B. Adenso-Diaz and M. Laguna, \u201cFine-tuning of algorithms using fractional experimental designs and local search,\u201d to appear in Operations Research."},{"issue":"1","key":"4801_CR2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01193837","volume":"47","author":"L. Babel","year":"1998","unstructured":"L. Babel, H. Kellerer, and V. Kotov, \u201cThe k-partitioning problem,\u201d Mathematical Methods of Operations Research, vol. 47, no. 1, pp. 59\u201382, 1998.","journal-title":"Mathematical Methods of Operations Research"},{"key":"4801_CR3","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J.L. Bentley","year":"1992","unstructured":"J.L. Bentley, \u201cFast algorithms for geometric traveling salesman problems,\u201d INFORMS Journal on Computing, vol. 4, pp. 387\u2013411, 1992.","journal-title":"INFORMS Journal on Computing"},{"key":"4801_CR4","first-page":"1","volume":"31","author":"J. Blazewicz","year":"1987","unstructured":"J. Blazewicz, \u201cSelected topics in scheduling theory,\u201d Annals of Discrete Mathematics, vol. 31, pp. 1\u201360, 1987.","journal-title":"Annals of Discrete Mathematics"},{"key":"4801_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1023\/A:1012793906010","volume":"21","author":"V. Campos","year":"2001","unstructured":"V. Campos, F. Glover, M. Laguna, and R. Mart\u00ed, \u201cAn experimental evaluation of a scatter search for the linear ordering problem,\u201d Journal of Global Optimization, vol. 21, pp. 397\u2013414, 2001.","journal-title":"Journal of Global Optimization"},{"key":"4801_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E.G. Coffman Jr.","year":"1978","unstructured":"E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, \u201cAn application of bin-packing to multiprocessor scheduling,\u201d SIAM Journal on Computing, vol. 7, pp. 1\u201317, 1978.","journal-title":"SIAM Journal on Computing"},{"key":"4801_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N. Christofides","year":"1984","unstructured":"N. Christofides and J.E. Beasley, \u201cThe period routing problem,\u201d Networks, vol. 14, pp. 237\u2013256, 1984.","journal-title":"Networks"},{"key":"4801_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M. Dell'amico","year":"1995","unstructured":"M. Dell'amico and S. Martello, \u201cOptimal scheduling of tasks on identical parallel processors,\u201d ORSA Journal on Computing, vol. 7, pp. 181\u2013200, 1995.","journal-title":"ORSA Journal on Computing"},{"key":"4801_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"T.A. Feo and M.G.C. Resende, \u201cA probabilistic heuristic for a computationally difficult set covering problem,\u201d Operations Research Letters, vol. 8, pp. 67\u201371, 1989.","journal-title":"Operations Research Letters"},{"key":"4801_CR10","first-page":"1","volume":"2","author":"T.A. Feo","year":"1995","unstructured":"T.A. Feo and M.G.C. Resende, \u201cGreedy randomized adaptive search procedures,\u201d Journal of Global Optimization, vol. 2, pp 1\u201327, 1995.","journal-title":"Journal of Global Optimization"},{"key":"4801_CR11","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"G. Finn and E. Horowitz, \u201cA linear time approximation algorithms for multiprocessor scheduling,\u201d BIT, vol. 19, pp. 312\u2013320, 1979.","journal-title":"BIT"},{"issue":"2","key":"4801_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0305-0548(94)90053-1","volume":"21","author":"P. Fran\u00e7A","year":"1994","unstructured":"P. Fran\u00e7a, M. Gendreau, G. Laporte, and F.M. Muller, \u201cA composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective,\u201d Computers and Operations Research, vol. 21, no. 2, pp. 205\u2013210, 1994.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"4801_CR13","first-page":"503","volume":"E83-D","author":"S. Fujita","year":"2000","unstructured":"S. Fujita and M. Yamashita, \u201cApproximation algorithms for multiprocessor scheduling problem,\u201d IEICE Trans. Information & Systems, vol. E83-D, no. 3, pp. 503\u2013509, 2000.","journal-title":"IEICE Trans. Information & Systems"},{"key":"4801_CR14","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"R.L. Graham, \u201cBounds on multiprocessing timing anomalies,\u201d SIAM Journal on Applied Mathematics, vol. 17, pp. 416\u2013429, 1969.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"4801_CR15","doi-asserted-by":"crossref","unstructured":"F. Glover, \u201cA template for scatter search and path relinking,\u201d in Artificial Evolution, Lecture Notes in Computer Science, 1363, J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (Eds.), Springer, pp. 13\u201354, 1998.","DOI":"10.1007\/BFb0026589"},{"issue":"3","key":"4801_CR16","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"F. Glover, M. Laguna, and R. Mart\u00ed, \u201cFundamentals of scatter search and path relinking,\u201d Control and Cybernetics, vol. 39, no. 3, pp. 653\u2013684, 2000.","journal-title":"Control and Cybernetics"},{"issue":"1","key":"4801_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1006\/jmaa.1995.1405","volume":"196","author":"F. Harche","year":"1995","unstructured":"F. Harche and S. Seshadri, \u201cAn LPT-bound for a parallel multiprocessor scheduling problem,\u201d Journal of Mathematical Analysis and Applications, vol. 196, no. 1, pp. 181\u2013195, 1995.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"4801_CR18","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","volume":"21","author":"R. H\u00fcbscher","year":"1994","unstructured":"R. H\u00fcbscher and F. Glover, \u201cApplying tabu search with influential diversification to multiprocessor scheduling,' Computers and Operations Research, vol. 21, pp. 877\u2013844, 1994.","journal-title":"Computers and Operations Research"},{"key":"4801_CR19","first-page":"183","volume-title":"Handbook of Applied Optimization","author":"M. Laguna","year":"2002","unstructured":"M. Laguna, \u201cScatter search,\u201d in Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende (Eds.), Oxford University Press, New York, 2002, pp. 183\u2013193."},{"key":"4801_CR20","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/BF01934441","volume":"22","author":"M.A. Langston","year":"1982","unstructured":"M.A. Langston, \u201cImproved 0\/1 interchange scheduling,\u201d BIT, vol. 22, pp. 282\u2013290, 1982.","journal-title":"BIT"},{"key":"4801_CR21","first-page":"168","volume-title":"Handbook of Applied Optimization","author":"L.S. Pitsoulis","year":"2002","unstructured":"L.S. Pitsoulis and M.G.C. Resende, \u201cGreedy randomized adaptive search procedures,\u201d in Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende (Eds.), Oxford University Press, New York, 2002, pp. 168\u2013182."},{"issue":"1","key":"4801_CR22","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S. Sahni","year":"1976","unstructured":"S. Sahni, \u201cAlgorithms for scheduling independent tasks,\u201d Journal of the Association for Computing Machinery, vol. 23, no. 1, pp. 116\u2013127, 1976.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"4801_CR23","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1009625629722","volume":"4","author":"A. Thesen","year":"1998","unstructured":"A. Thesen, \u201cDesign and evaluation of tabu search algorithms for multiprocessor scheduling,\u201d Journal of Heuristics, vol. 4, pp. 141\u2013160, 1998.","journal-title":"Journal of Heuristics"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4801-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-4801-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4801-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:30Z","timestamp":1559302590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-4801-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4801"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-4801-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}