Djamal Rebaïne
Affiliations:- University of Quebec at Chicoutimi (UQAC), Department of Computer Sciences and Mathematics, Saguenay, QC, Canada
According to our database1,
Djamal Rebaïne
authored at least 37 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on linkedin.com
-
on gerad.ca
On csauthors.net:
Bibliography
2024
Solving the two-machine open shop problem with a single server with respect to the makespan.
Ann. Oper. Res., July, 2024
Optim. Lett., January, 2024
Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times.
Discret. Optim., 2024
2023
Ambiguity of the definition of permutation flow shops in the presence of missing operations.
Comput. Ind. Eng., August, 2023
2022
J. Comb. Optim., 2022
2021
Theor. Comput. Sci., 2021
2020
RAIRO Oper. Res., 2020
Internet-of-Things (IoT) Shortest Path Algorithms and Communication Case Studies for Maintaining Connectivity in Harsh Environements.
Proceedings of the 2020 International Symposium on Networks, Computers and Communications, 2020
2019
Proceedings of the 23rd IEEE International Enterprise Distributed Object Computing Conference, 2019
2018
RAIRO Oper. Res., 2018
Proceedings of the 7th International Conference on Software Engineering and New Technologies, 2018
Proceedings of the 22nd IEEE International Enterprise Distributed Object Computing Conference, 2018
2017
Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times.
Int. J. Prod. Res., 2017
Int. J. Prod. Res., 2017
FPTAS for the two identical parallel machine problem with a single operator under the free changing mode.
Eur. J. Oper. Res., 2017
2016
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs.
RAIRO Oper. Res., 2016
A Heuristic Approach to Assist Side Channel Analysis of the Data Encryption Standard.
Proceedings of the New Codebreakers, 2016
2014
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays.
RAIRO Oper. Res., 2014
The coupled unit-time operations problem on identical parallel machines with respect to the makespan.
Oper. Res. Lett., 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014
2013
Discret. Optim., 2013
Scheduling the two-machine open shop problem under resource constraints for setting the jobs.
Ann. Oper. Res., 2013
Approximation results for the linear ordering problem on interval graphs.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2010
The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan.
Eur. J. Oper. Res., 2010
Electron. Notes Discret. Math., 2010
2009
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors.
Discret. Optim., 2009
Scheduling identical parallel machines and operators within a period based changing mode.
Comput. Oper. Res., 2009
2008
Comput. Oper. Res., 2008
Polynomial time algorithms for the UET permutation flowshop problem with time delays.
Comput. Oper. Res., 2008
2005
1999
J. Oper. Res. Soc., 1999
1996
1992