{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T10:58:07Z","timestamp":1753181887904},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10732-023-09511-0","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T18:03:13Z","timestamp":1682532193000},"page":"229-267","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors"],"prefix":"10.1007","volume":"29","author":[{"given":"Fatma-Zohra","family":"Baatout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"key":"9511_CR1","doi-asserted-by":"crossref","unstructured":"Aider, M., Baatout, F., Hifi, M. A reactive search-based algorithm for scheduling multiprocessor tasks on two dedicated processors. In: 15th Conference on Computer Science and Information Systems (FedCSIS), pp. 257\u2013261 (2020)","DOI":"10.15439\/2020F134"},{"key":"9511_CR2","doi-asserted-by":"crossref","unstructured":"Aider, M., Baatout, F., Hifi, M. A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors, pp. 107388. Computers and Industrial Engineering (2021)","DOI":"10.1016\/j.cie.2021.107388"},{"key":"9511_CR3","doi-asserted-by":"crossref","unstructured":"A\u00efder, M., Baatout, F.-Z., Hifi, M. A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors, pp. 157\u2013178. Springer International Publishing, Cham, (2022)","DOI":"10.1007\/978-3-030-82397-9_8"},{"issue":"1","key":"9511_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1018994726051","volume":"70","author":"L Bianco","year":"1997","unstructured":"Bianco, L., Blazewicz, J., Dell\u2019Olmo, P., Drozdowski, M.: Preemptive multiprocessor task scheduling with release times and time windows. Ann. Oper. Res. 70(1), 43\u201355 (1997)","journal-title":"Ann. Oper. Res."},{"key":"9511_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1051\/ro:2002004","volume":"36","author":"J Blazewicz","year":"2002","unstructured":"Blazewicz, J., Dell\u2019Olmo, P., Drozdowski, J.: Scheduling multiprocessor tasks on two parallel processors. RAIRO Oper. Res. 36, 37\u201351 (2002)","journal-title":"RAIRO Oper. Res."},{"issue":"2","key":"9511_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2019.12.043","volume":"284","author":"Y Bukchin","year":"2000","unstructured":"Bukchin, Y., Raviv, T., Zaides, I.: The consecutive multiprocessor job scheduling problem. Eur. J. Oper. Res. 284(2), 427\u2013438 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9511_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jspi.2014.12.004","volume":"160","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Smucker, B., Robinson, T.: On using the hypervolume indicator to compare pareto fronts: applications to multi-criteria optimal experimental design. J. Stat. Plan. Inference 160, 60\u201374 (2015)","journal-title":"J. Stat. Plan. Inference"},{"issue":"2","key":"9511_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M Drozdowski","year":"1996","unstructured":"Drozdowski, M.: Scheduling multiprocessor tasks: an overview. Eur. J. Oper. Res. 94(2), 215\u2013230 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9511_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/03052150512331303436","volume":"37","author":"R Farmani","year":"2002","unstructured":"Farmani, R., Savic, D., Walters, G.: Evolutionary multi-objective optimization in water distribution network design. Eng. Optim. 37(2), 167\u2013183 (2002)","journal-title":"Eng. Optim."},{"key":"9511_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cor.2019.04.012","volume":"108","author":"A Garc\u00eda-Le\u00f3n","year":"2019","unstructured":"Garc\u00eda-Le\u00f3n, A., Dauz\u00e8re-P\u00e9r\u00e8s, S., Marti, Y.: An efficient pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 108, 187\u2013200 (2019)","journal-title":"Comput. Oper. Res."},{"key":"9511_CR11","doi-asserted-by":"crossref","unstructured":"Glover, F. A template for scatter search and path relinking. In: European Conference on Artificial Evolution, pp. 1\u201351. Springer (1997)","DOI":"10.1007\/BFb0026589"},{"key":"9511_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawelr, E.L., Lenstra, J.K.: Optimization and approximation in deterministic sequencing and scheduling theory\u2019 a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"2","key":"9511_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.3390\/axioms11020061","volume":"11","author":"L Hern\u00e1ndez-Ram\u00edrez","year":"2022","unstructured":"Hern\u00e1ndez-Ram\u00edrez, L., Frausto-Sol\u00eds, J., Castilla-Valdez, G., Gonz\u00e1lez-Barbosa, J., S\u00e1nchez Hern\u00e1ndez, J.-P.: Three hybrid scatter search algorithms for multi-objective job shop scheduling problem. Axioms 11(2), 61 (2022)","journal-title":"Axioms"},{"issue":"6","key":"9511_CR14","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1057\/palgrave.jors.2602046","volume":"57","author":"M Hifi","year":"2006","unstructured":"Hifi, M., Michrafy, M.: A reactive local search-based algorithm for the disjunctively constrained knapsack problem. J. Oper. Res. Soc. 57(6), 718\u2013726 (2006)","journal-title":"J. Oper. Res. Soc."},{"key":"9511_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"5","author":"J Hoogeveen","year":"1994","unstructured":"Hoogeveen, J., van de Velde, S., Veltman, B.: Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discret. Appl. Math. 5, 259\u2013272 (1994)","journal-title":"Discret. Appl. Math."},{"key":"9511_CR16","doi-asserted-by":"crossref","unstructured":"Kacem, A., Dammak, A. A genetic algorithm to minimize the makespan on two dedicated processors. In: International Conference in Control, Decision and Information Technologies (CoDIT), pp. 400\u2013404 (2014)","DOI":"10.1109\/CoDIT.2014.6996927"},{"key":"9511_CR17","doi-asserted-by":"crossref","unstructured":"Kacem, A., Dammak, A. A genetic algorithm to minimize the total of tardiness multiprocessing tasks on two dedicated processors. In: 4th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 0085\u20130090 (2017)","DOI":"10.1109\/CoDIT.2017.8102571"},{"issue":"5","key":"9511_CR18","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1504\/EJIE.2019.102165","volume":"13","author":"A Kacem","year":"2019","unstructured":"Kacem, A., Dammak, A.: Bi-objective scheduling on two dedicated processors. Eur. J. Ind. Eng. 13(5), 681\u2013700 (2019)","journal-title":"Eur. J. Ind. Eng."},{"key":"9511_CR19","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M Laguna","year":"1999","unstructured":"Laguna, M., Marti, R.: Grasp and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 44\u201352 (1999)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9511_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1504\/EJIE.2010.033331","volume":"4","author":"A Manaa","year":"2010","unstructured":"Manaa, A., Chu, C.: Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors. Eur. J. Ind. Eng. 4(3), 265\u2013279 (2010)","journal-title":"Eur. J. Ind. Eng."},{"key":"9511_CR21","doi-asserted-by":"crossref","unstructured":"Paquete, L., Chiarandini, M., St\u00fctzle, T. Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In: Metaheuristics for Multiobjective Optimisation, pp. 177\u2013199 (2004)","DOI":"10.1007\/978-3-642-17144-4_7"},{"key":"9511_CR22","doi-asserted-by":"crossref","unstructured":"Priya, A., Sahana, S. A survey on multiprocessor scheduling using evolutionary technique. Nanoelectronics, Circuits and Communication Systems. Lecture Notes in Electrical Engineering, vol. 511, pp. 149\u2013160. Springer, Singapore (2019)","DOI":"10.1007\/978-981-13-0776-8_14"},{"issue":"3","key":"9511_CR23","doi-asserted-by":"publisher","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.: Grasp and path relinking for the max-min diversity problem. Comput. Oper. Res. 37(3), 498\u2013508 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9511_CR24","unstructured":"Zhao, F., Asmus, T., Assanis, D., Dec, J., Eng, J., Najt, P. Homogeneous charge compression ignition (hcci) engines. SAE Technical Paper (2003)"},{"issue":"4","key":"9511_CR25","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09511-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-023-09511-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09511-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T11:32:15Z","timestamp":1686569535000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-023-09511-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9511"],"URL":"https:\/\/doi.org\/10.1007\/s10732-023-09511-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"21 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}