{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T14:17:45Z","timestamp":1778336265811,"version":"3.51.4"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T00:00:00Z","timestamp":1338595200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10479-012-1164-8","type":"journal-article","created":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T12:41:02Z","timestamp":1338554462000},"page":"383-401","source":"Crossref","is-referenced-by-count":20,"title":["GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times"],"prefix":"10.1007","volume":"201","author":[{"given":"F. J.","family":"Rodriguez","sequence":"first","affiliation":[]},{"given":"C.","family":"Blum","sequence":"additional","affiliation":[]},{"given":"C.","family":"Garc\u00eda-Mart\u00ednez","sequence":"additional","affiliation":[]},{"given":"M.","family":"Lozano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,2]]},"reference":[{"issue":"4","key":"1164_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R. Aiex","year":"2003","unstructured":"Aiex, R., Binato, S., & Resende, M. (2003). Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29(4), 393\u2013430.","journal-title":"Parallel Computing"},{"issue":"2","key":"1164_CR2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"R. Aiex","year":"2005","unstructured":"Aiex, R., Resende, M., Pardalos, P., & Toraldo, G. (2005). GRASP with path relinking for three-index assignment. INFORMS Journal on Computing, 17(2), 224\u2013247.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"1164_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A. Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27(2), 219\u2013239.","journal-title":"Omega"},{"issue":"11","key":"1164_CR4","doi-asserted-by":"crossref","first-page":"3471","DOI":"10.1016\/j.cor.2006.02.009","volume":"34","author":"D. Anghinolfi","year":"2007","unstructured":"Anghinolfi, D., & Paolucci, M. (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research, 34(11), 3471\u20133490.","journal-title":"Computers & Operations Research"},{"key":"1164_CR5","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/s10845-009-0246-1","volume":"21","author":"J. P. Arnaout","year":"2010","unstructured":"Arnaout, J. P., Rabadi, G., & Musa, R. (2010). A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Journal of Intelligent Manufacturing, 21, 693\u2013701.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"1","key":"1164_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0377-2217(97)00427-X","volume":"113","author":"M. Azizoglu","year":"1999","unstructured":"Azizoglu, M., & Kirca, O. (1999a). On the minimization of total weighted flow time with identical and uniform parallel machines. European Journal of Operational Research, 113(1), 91\u2013100.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1164_CR7","first-page":"153","volume":"31","author":"M. Azizoglu","year":"1999","unstructured":"Azizoglu, M., & Kirca, O. (1999b). Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions, 31(2), 153\u2013159.","journal-title":"IIE Transactions"},{"key":"1164_CR8","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1002\/nav.3800200417","volume":"20","author":"K. Baker","year":"1973","unstructured":"Baker, K., & Merten, A. (1973). Scheduling with parallel machines and linear delay costs. Naval Research Logistics Quarterly, 20, 793\u2013804.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"1164_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(92)00176-M","volume":"48","author":"H. Belouadah","year":"1994","unstructured":"Belouadah, H., & Potts, C. (1994). Scheduling identical parallel machines to minimize total weighted completion time. Discrete Applied Mathematics, 48(3), 201\u2013218.","journal-title":"Discrete Applied Mathematics"},{"key":"1164_CR10","series-title":"International handbooks on information systems","volume-title":"Handbook on scheduling: models and methods for advanced planning","author":"J. Blazewicz","year":"2007","unstructured":"Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., & Weglarz, J. (2007). International handbooks on information systems. Handbook on scheduling: models and methods for advanced planning. Secaucus: Springer."},{"issue":"1","key":"1164_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1018959704264","volume":"96","author":"P. Brucker","year":"2000","unstructured":"Brucker, P., & Hurink, J. (2000). Solving a chemical batch scheduling problem by local search. Annals of Operations Research, 96(1), 17\u201338.","journal-title":"Annals of Operations Research"},{"issue":"7","key":"1164_CR12","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J. Bruno","year":"1974","unstructured":"Bruno, J., Coffman, E., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), 382\u2013387.","journal-title":"Communications of the ACM"},{"key":"1164_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0377-2217(89)90349-4","volume":"39","author":"G. Buxey","year":"1989","unstructured":"Buxey, G. (1989). Production scheduling: practice and theory. European Journal of Operational Research, 39, 17\u201331.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1164_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00170-008-1692-1","volume":"43","author":"C. L. Chen","year":"2009","unstructured":"Chen, C. L., & Chen, C. L. (2009). Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. The International Journal of Advanced Manufacturing Technology, 43(1), 161\u2013169.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"1164_CR15","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z. L. Chen","year":"1999","unstructured":"Chen, Z. L., & Powell, W. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11(1), 78\u201394.","journal-title":"INFORMS Journal on Computing"},{"issue":"1\u20134","key":"1164_CR16","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/0360-8352(95)00126-L","volume":"29","author":"R. Cheng","year":"1995","unstructured":"Cheng, R., Gen, M., & Tozawa, T. (1995). Minmax earliness\/tardiness scheduling in identical parallel machine system using genetic algorithms. Computers & Industrial Engineering, 29(1\u20134), 513\u2013517.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"1164_CR17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"T. Cheng","year":"1990","unstructured":"Cheng, T., & Sin, C. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3), 271\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"1164_CR18","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1023\/A:1018999101596","volume":"92","author":"F. D. Croce","year":"1999","unstructured":"Croce, F. D., Tadei, R., & Asioli, P. (1999). Scheduling a round robin tennis tournament under courts and players availability constraints. Annals of Operations Research, 92, 349\u2013361.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"1164_CR19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(91)90162-O","volume":"52","author":"B. Dodin","year":"1991","unstructured":"Dodin, B., & Chan, K. H. (1991). Application of production scheduling methods to external and internal audit scheduling. European Journal of Operational Research, 52(3), 267\u2013279.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1164_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","volume":"6","author":"S. Elmaghraby","year":"1974","unstructured":"Elmaghraby, S., & Park, S. (1974). Scheduling jobs on a number of identical machines. AIIE Transactions, 6(1), 1\u201313.","journal-title":"AIIE Transactions"},{"issue":"1","key":"1164_CR21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2010.03.030","volume":"207","author":"L. Fanjul-Peyro","year":"2010","unstructured":"Fanjul-Peyro, L., & Ruiz, R. (2010). Iterated greedy local search methods for unrelated parallel machine scheduling. European Journal of Operational Research, 207(1), 55\u201369.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1164_CR22","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.cor.2010.05.005","volume":"38","author":"L. Fanjul-Peyro","year":"2011","unstructured":"Fanjul-Peyro, L., & Ruiz, R. (2011). Size-reduction heuristics for the unrelated parallel machines scheduling problem. Computers & Operations Research, 38(1), 301\u2013309.","journal-title":"Computers & Operations Research"},{"issue":"7","key":"1164_CR23","doi-asserted-by":"crossref","first-page":"1745","DOI":"10.1016\/j.cor.2011.10.012","volume":"39","author":"L. Fanjul-Peyro","year":"2012","unstructured":"Fanjul-Peyro, L., & Ruiz, R. (2012). Scheduling unrelated parallel machines with optional machines and jobs selection. Computers & Operations Research, 39(7), 1745\u20131753.","journal-title":"Computers & Operations Research"},{"key":"1164_CR24","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10479-007-0284-z","volume":"159","author":"G. Feng","year":"2008","unstructured":"Feng, G., & Lau, H. (2008). Efficient algorithms for machine scheduling problems with earliness and tardiness penalties. Annals of Operations Research, 159, 83\u201395.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1164_CR25","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T. Feo","year":"1989","unstructured":"Feo, T., & Resende, M. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2), 67\u201371.","journal-title":"Operations Research Letters"},{"issue":"2","key":"1164_CR26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T., & Resende, M. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"1164_CR27","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S. Garcia","year":"2008","unstructured":"Garcia, S., Molina, D., Lozano, M., & Herrera, F. (2008). A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: A case study on the CEC\u20192005 special session on real parameter optimization. Journal of Heuristics, 15, 617\u2013644.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"1164_CR28","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0895-7177(94)90205-4","volume":"20","author":"C. A. Glass","year":"1994","unstructured":"Glass, C. A., Potts, C. N., & Shade, P. (1994). Unrelated parallel machine scheduling using local search. Mathematical and Computer Modelling, 20(2), 41\u201352.","journal-title":"Mathematical and Computer Modelling"},{"key":"1164_CR29","first-page":"1","volume-title":"Interfaces in computer science and operations research","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). Tabu search and adaptive memory programing\u2014advances, applications and challenges. In Interfaces in computer science and operations research (pp. 1\u201375). Norwell: Kluwer Academic."},{"key":"1164_CR30","first-page":"142","volume-title":"Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms, SODA\u201996","author":"L. A. Hall","year":"1996","unstructured":"Hall, L. A., Shmoys, D. B., & Wein, J. (1996). Scheduling to minimize average completion time: off-line and on-line algorithms. In Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms, SODA\u201996 (pp. 142\u2013151). Philadelphia: Society for Industrial and Applied Mathematics."},{"issue":"3","key":"1164_CR31","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L. Hall","year":"1997","unstructured":"Hall, L., Schulz, A., Shmoys, D., & Wein, J. (1997). Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research, 22(3), 513\u2013544.","journal-title":"Mathematics of Operations Research"},{"key":"1164_CR32","first-page":"65","volume":"6","author":"S. Holm","year":"1979","unstructured":"Holm, S. (1979). A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6, 65\u201370.","journal-title":"Scandinavian Journal of Statistics"},{"issue":"6","key":"1164_CR33","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1080\/03610928008827904","volume":"9","author":"R. Iman","year":"1980","unstructured":"Iman, R., & Davenport, J. (1980). Approximations of the critical region of the Friedman statistic. Communications in Statistics. Theory and Methods, 9(6), 571\u2013595.","journal-title":"Communications in Statistics. Theory and Methods"},{"issue":"2","key":"1164_CR34","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0377-2217(92)90025-5","volume":"63","author":"A. I. Z. Jarrah","year":"1992","unstructured":"Jarrah, A. I. Z., Bard, J. F., & de Silva, A. H. (1992). A heuristic for machine scheduling at general mail facilities. European Journal of Operational Research, 63(2), 192\u2013206.","journal-title":"European Journal of Operational Research"},{"key":"1164_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-009-0582-8","volume":"180","author":"G. Kendall","year":"2010","unstructured":"Kendall, G., Tan, K., Burke, E., & Smith, S. (2010). Preface for the special volume on computational intelligence in scheduling. Annals of Operations Research, 180, 1\u20132.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"1164_CR36","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., & Marti, R. (1999). GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11(1), 44\u201352.","journal-title":"INFORMS Journal on Computing"},{"key":"1164_CR37","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume-title":"Studies in integer programming, annals of discrete mathematics","author":"J. Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy-Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. In B. K. P. L. Hammer, E. L. Johnson & G. Nemhauser (Eds.), Studies in integer programming, annals of discrete mathematics (Vol.\u00a01, pp. 343\u2013362). Amsterdam: Elsevier."},{"issue":"4","key":"1164_CR38","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1016\/j.apm.2008.05.019","volume":"33","author":"K. Li","year":"2009","unstructured":"Li, K., & Yang, S. L. (2009). Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms. Applied Mathematical Modelling, 33(4), 2145\u20132158.","journal-title":"Applied Mathematical Modelling"},{"key":"1164_CR39","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00170-010-2824-y","volume":"53","author":"S. W. Lin","year":"2011","unstructured":"Lin, S. W., Lu, C. C., & Ying, K. C. (2011a). Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints. The International Journal of Advanced Manufacturing Technology, 53, 353\u2013361.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"6","key":"1164_CR40","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.cor.2010.08.018","volume":"38","author":"Y. Lin","year":"2011","unstructured":"Lin, Y., Pfund, M., & Fowler, J. (2011b). Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Computers & Operations Research, 38(6), 901\u2013916.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"1164_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6(1), 1\u201312.","journal-title":"Management Science"},{"issue":"2","key":"1164_CR42","first-page":"193","volume":"18","author":"E. Mokotoff","year":"2001","unstructured":"Mokotoff, E. (2001). Parallel machine scheduling problems: a survey. Asia-Pacific Journal of Operational Research, 18(2), 193\u2013242.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"1","key":"1164_CR43","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1018958209290","volume":"95","author":"P. Pendharkar","year":"2000","unstructured":"Pendharkar, P., & Rodger, J. (2000). Nonlinear programming and genetic search application for production scheduling in coal mines. Annals of Operations Research, 95(1), 251\u2013267.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"1164_CR44","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/S0895480194279057","volume":"10","author":"C. Phillips","year":"1997","unstructured":"Phillips, C., Stein, C., & Wein, J. (1997). Parallel machine scheduling problems: a survey. SIAM Journal on Discrete Mathematics, 10(4), 573\u2013598.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"1164_CR45","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"M. Resende","year":"2010","unstructured":"Resende, M., Marti, R., Gallego, M., & Duarte, A. (2010). GRASP and path relinking for the max-min diversity problem. Computers & Operations Research, 37(3), 498\u2013508.","journal-title":"Computers & Operations Research"},{"key":"1164_CR46","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of metaheuristics","author":"M. Resende","year":"2003","unstructured":"Resende, M., & Ribeiro, C. (2003). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 219\u2013249). Norwell: Kluwer Academic."},{"key":"1164_CR47","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.10065","volume":"41","author":"M. Resende","year":"2003","unstructured":"Resende, M., & Ribero, C. (2003). A GRASP with path-relinking for private virtual circuit routing. Networks, 41, 104\u2013114.","journal-title":"Networks"},{"issue":"1","key":"1164_CR48","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M. Resende","year":"2004","unstructured":"Resende, M., & Werneck, R. (2004). A hybrid heuristic for the p-median problem. Journal of Heuristics, 10(1), 59\u201388.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"1164_CR49","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C. Ribeiro","year":"2002","unstructured":"Ribeiro, C., Uchoa, E., & Werneck, R. (2002). A hybrid GRASP with perturbations for the steiner problem in graphs. INFORMS Journal on Computing, 14(3), 228\u2013246.","journal-title":"INFORMS Journal on Computing"},{"key":"1164_CR50","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1009613700772","volume":"4","author":"Y. Rochat","year":"1998","unstructured":"Rochat, Y. (1998). A genetic approach for solving a scheduling problem in a robotized analytical system. Journal of Heuristics, 4, 245\u2013261.","journal-title":"Journal of Heuristics"},{"key":"1164_CR51","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0377-2217(87)90131-7","volume":"31","author":"E. Rosenbloom","year":"1987","unstructured":"Rosenbloom, E., & Goertzen, N. (1987). Cyclic nurse scheduling. European Journal of Operational Research, 31, 19\u201323.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"1164_CR52","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/00207548808947934","volume":"26","author":"S. Sarin","year":"1988","unstructured":"Sarin, S., Ahn, S., & Bishop, A. (1988). An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime. International Journal of Production Research, 26(7), 1183\u20131191.","journal-title":"International Journal of Production Research"},{"key":"1164_CR53","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-63248-4_11","volume-title":"Proceedings of the first international symposium on randomization and approximation techniques in computer science (Random\u201997)","author":"A. Schulz","year":"1997","unstructured":"Schulz, A., & Skutella, M. (1997). Random-based scheduling: new approximations and LP lower bounds. In Proceedings of the first international symposium on randomization and approximation techniques in computer science (Random\u201997) (pp. 119\u2013133). Berlin: Springer."},{"key":"1164_CR54","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1137\/S0895480199357078","volume":"15","author":"A. S. Schulz","year":"2002","unstructured":"Schulz, A. S., & Skutella, M. (2002). Scheduling unrelated machines by randomized rounding. SIAM Journal on Discrete Mathematics, 15, 450\u2013469.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1164_CR55","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M. Skutella","year":"2001","unstructured":"Skutella, M. (2001). Convex quadratic and semidefinite programming relaxations in scheduling. Journal of the ACM, 48, 206\u2013242.","journal-title":"Journal of the ACM"},{"issue":"2","key":"1164_CR56","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.14.2.175.119","volume":"14","author":"T. Vredeveld","year":"2002","unstructured":"Vredeveld, T., & Hurkens, C. (2002). Experimental comparison of approximation algorithms for scheduling unrelated parallel machines. INFORMS Journal on Computing, 14(2), 175\u2013189.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"1164_CR57","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.ejor.2007.11.009","volume":"193","author":"G. Waligora","year":"2009","unstructured":"Waligora, G. (2009). Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation. European Journal of Operational Research, 193(3), 849\u2013856.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1164_CR58","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0925-5273(00)00066-9","volume":"70","author":"M. Weng","year":"2001","unstructured":"Weng, M., Lu, J., & Ren, H. (2001). Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. International Journal of Production Economics, 70(3), 215\u2013226.","journal-title":"International Journal of Production Economics"},{"key":"1164_CR59","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F. Wilcoxon","year":"1945","unstructured":"Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics, 1, 80\u201383.","journal-title":"Biometrics"},{"key":"1164_CR60","volume-title":"Proc. of 8th international conference of modeling and simulation (MOSIM\u201910)","author":"M. Zaidi","year":"2010","unstructured":"Zaidi, M., Jarboui, B., Loukil, T., & Kacem, I. (2010). Hybrid meta-heuristics for uniform parallel machine to minimize total weighted completion time. In Proc. of 8th international conference of modeling and simulation (MOSIM\u201910)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1164-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1164-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1164-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:36Z","timestamp":1559153376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1164-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,2]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["1164"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1164-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,2]]}}}