Effect of skewing strategies on solving scheduling problems for multiprocessor tasks on two dedicated processors

CoDIT 2024-DO_TAP

Open Access

Issue		RAIRO-Oper. Res. Volume 60, Number 4, July-August 2026 CoDIT 2024-DO_TAP


Page(s)		1981 - 2019
DOI		https://doi.org/10.1051/ro/2026049
Published online		13 July 2026

M. Abbasi and R. Niknam, A combined genetic algorithm and simulated annealing approach for solving competitive hub location and pricing problem. Int. J. Appl. Manag. Sci. 9 (2017) 88–202. [Google Scholar]
M. Abbasi, N. Mokhtari, H. Shahvar and A. Mahmoudi, Application of variable neighborhood search for solving large-scale many to many hub location routing problems. J. Adv. Manag. Res. 16 (2019) 683–697. [Google Scholar]
M. Abbasi, F. Sadough and A. Mahmoudi, Solving the fuzzy p-hub center problem using imperialist competitive algorithm. Int. J. Mach. Learn. Cybern. 15 (2024) 6163–6183. [Google Scholar]
M. Aider, F-Z. Baatout and M. Hifi, A reactive search-based algorithm for scheduling multiprocessor tasks on two dedicated processors, in 15th FedCSIS: Conference on Computer Science and Information Systems (2020) 257–261. [Google Scholar]
M. Aider, F.Z. Baatout and M. Hifi, A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors. Comput. Ind. Eng. 158 (2021) 107388. [Google Scholar]
F.Z. Baatout and M. Hifi, A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors. J. Heuristics 29 (2023) 229–267. [Google Scholar]
F.Z. Baatout, N. Doumbouya and M. Hifi, A hybrid population-based method for scheduling multiprocessor tasks on two dedicated processors, in IEEE, 10th International Conference on Control, Decision and Information Technologies (CoDIT) (2024) 2492–2497. [Google Scholar]
L. Bianco, J. Blazewicz, P. Dell’Olmo and M. Drozdowski, Preemptive multiprocessor task scheduling with release times and time windows. Ann. Oper. Res. 70 (1997) 43–55. [Google Scholar]
J. Blazewicz, P. Dell’Olmo, M. Drozdowski and M.G. Speranza, Scheduling multiprocessor tasks on three dedicated processors. Inf. Process. Lett. 41 (1992) 275–280. [Google Scholar]
J. Blazewicz, P. Dell’Olmo and J. Drozdowski, Scheduling multiprocessor tasks on two parallel processors. RAIRO Oper. Res. 36 (2002) 37–51. [Google Scholar]
O. Buffet, L. Cucu, L. Idoumghar and R. Schott, Tabu search type algorithms for the multiprocessor scheduling problem, in 10th International Conference on Artificial Intelligence and Applications (2010). [Google Scholar]
Y. Bukchin, T. Raviv and I. Zaides, The consecutive multiprocessor job scheduling problem. Eur. J. Oper. Res. 284 (2000) 427–438. [Google Scholar]
M. Drozdowski, Scheduling multiprocessor tasks: an overview. Eur. J. Oper. Res. 94 (1996) 215–230. [Google Scholar]
F. Glover, A template for scatter search and path relinking, in European Conference on Artificial Evolution. Springer, Berlin (1997) 1–51. [Google Scholar]
R.L. Graham, E.L. Lower and J.K. Lenstra, Optimization and approximation in deterministic sequencing and scheduling theory’ a survey. Ann. Discrete Math. 5 (1979) 287–326. [Google Scholar]
S. Hartmann and D. Briskorn, An updated survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 297 (2022) 1–14. [CrossRef] [Google Scholar]
M. Hifi, The tested instances are openly accessible to researchers in this field via. Benchmark Instances (2025). https://www.u-picardie.fr/eproad/?page_id=485. [Google Scholar]
J.A. Hoogeveen, S.L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl. Math. 55 (1994) 259–272. [Google Scholar]
A. Hosseini, A. Otto and E. Pesch, Scheduling in manufacturing with transportation: Classification and solution techniques. Eur. J. Oper. Res. 315 (2024) 821–843. [Google Scholar]
A. Kacem and A. Dammak, A genetic algorithm to minimize the makespan on two dedicated processors, in International Conference in Control, Decision and Information Technologies (CoDIT) (2014) 400–404. [Google Scholar]
A. Kononova, P. Kononovaa and A. Gordeevn, Branch-and-bound approach for optima localization in scheduling multiprocessor jobs. Int. Trans. Oper. Res. 27 (2020) 381–393. [Google Scholar]
M. Kubale, The complexity of scheduling independent two-processor tasks on dedicated processors. Inf. Process. Lett. 24 (1987) 141–147. [Google Scholar]
D. Lei and J. Cai, Multi-population meta-heuristics for production scheduling: a survey. Swarm Evol. Comput. 58 (2020) 100739. [Google Scholar]
A. Manaa and C. Chu, Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors. Eur. J. Ind. Eng. 4 (2010) 265–279. [Google Scholar]
S. Mirjalili, S.M. Mirjalili and A. Lewis, Grey wolf optimizer. Adv. Eng. Softw. 69 (2014) 46–61. [CrossRef] [Google Scholar]
N. Mladenović and P. Hansen, Variable neighborhood search. Comput. Oper. Res. 24 (1997) 1097–1100. [Google Scholar]
N. Mladenović, R. Todosijević, D. Urošević and M. Ratli, Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS. Comput. Oper. Res. 139 (2022) 105622. [Google Scholar]
J. Mou, K. Gao, P. Duan, J. Li, A. Garg and R. Sharma, A machine learning approach for energy-efficient intelligent transportation scheduling problem in a real-world dynamic circumstances. IEEE Trans. Intell. Transp. Syst. 24 (2023) 15527–15539. [Google Scholar]
C. Muro, R. Escobedo, L. Spector and R.P. Coppinger, Wolf-pack (canis lupus) hunting strategies emerge from simple rules in computational simulations. Behav. Process. 88 (2011) 192–197. [Google Scholar]
A. Priya and S. K. Sahana, A survey on multiprocessor scheduling using evolutionary technique. Nanoelectronics, Circuits and Communication Systems. Lecture Notes in Electrical Engineering, Vol. 511. Springer, Singapore (2019) 149–160. [Google Scholar]
Y. Song, L. Xing, M. Wang, Y. Yi, W. Xiang and Z. Zhang, A knowledge-based evolutionary algorithm for relay satellite system mission scheduling problem. Comput. Ind. Eng. 150 (2020) 106830. [Google Scholar]
A. Thesen, Design and evaluation of tabu search algorithms for multiprocessor scheduling. J. Heuristics 4 (1998) 141–160. [Google Scholar]
C. Wang, D. Deng, L. Xu and W. Wang, Resource scheduling based on deep reinforcement learning in UAV assisted emergency communication networks. IEEE Trans. Commun. 70 (2022) 3834–3848. [Google Scholar]
A. Zahraa, A. Amiza, Al-B.M. Azmi, E. Phaklen and A.I. Hammouri, Healthcare scheduling in optimization context: a review. Eur. J. Oper. Res. 11 (2021) 445–469. [Google Scholar]
X. Zhang, X. Li and J. Wang, Local search algorithm with path relinking for single batch-processing machine scheduling problem. Neural Comput. Appl. 28 (2016) 313–326. [Google Scholar]
F. Zhao, L. Zhang, J. Cao and J. Tang, A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Comput. Ind. Eng. 153 (2021) 107082. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.