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 35 papers between 1992 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the complexity of proportionate open shop and job shop problems.
Optim. Lett., January, 2024

2023
Ambiguity of the definition of permutation flow shops in the presence of missing operations.
Comput. Ind. Eng., August, 2023

2022
Linear time algorithms on mirror trees.
J. Comb. Optim., 2022

A two-machine no-wait flow shop problem with two competing agents.
J. Comb. Optim., 2022

2021
Two-machine open shop problem with a single server and set-up time considerations.
Theor. Comput. Sci., 2021

Detecting trend deviations with generic stream processing patterns.
Inf. Syst., 2021

2020
Scheduling job shop problems with operators with respect to the maximum lateness.
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
Scheduling flow shops with operators.
Int. J. Prod. Res., 2019

Predictive Analytics for Event Stream Processing.
Proceedings of the 23rd IEEE International Enterprise Distributed Object Computing Conference, 2019

2018
Lower and upper bounds for the linear arrangement problem on interval graphs.
RAIRO Oper. Res., 2018

Towards Mobile Collaborative Autonomous Networks Using Peer-to-Peer Communication.
Proceedings of the 7th International Conference on Software Engineering and New Technologies, 2018

Real-Time Data Mining for Event Streams.
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

Online heuristics for unloading boxes off a gravity conveyor.
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

Linear Arrangement Problems and Interval Graphs.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Exact and Approximation Algorithms for Linear Arrangement Problems.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2013
A polynomial time algorithm for unloading boxes off a gravity conveyor.
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

Scheduling flexible flowshops with unit-time operations and minimum time delays.
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
Analysis of heuristics for the UET two-machine flow shop problem with time delays.
Comput. Oper. Res., 2008

Polynomial time algorithms for the UET permutation flowshop problem with time delays.
Comput. Oper. Res., 2008

2005
Flow shop vs. permutation shop with time delays.
Comput. Ind. Eng., 2005

1999
Two-machine open shop scheduling with special transportation times.
J. Oper. Res. Soc., 1999

1996
Uet Flow Shop Scheduling with Delays.
RAIRO Theor. Informatics Appl., 1996

1992
Open shop scheduling with delays.
RAIRO Theor. Informatics Appl., 1992


  Loading...