default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDjamal Rebaïne
Person information
- affiliation: University of Quebec at Chicoutimi (UQAC), Department of Computer Sciences and Mathematics, Saguenay, QC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Nadia Babou
, Djamal Rebaine, Mourad Boudhar:
Solving the two-machine open shop problem with a single server with respect to the makespan. Ann. Oper. Res. 338(2): 857-877 (2024)- [j28]Nadia Babou, Mourad Boudhar, Djamal Rebaine:
Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times. Discret. Optim. 53: 100845 (2024) - [j27]Abdennour Azerine, Mourad Boudhar, Djamal Rebaine:
On the complexity of proportionate open shop and job shop problems. Optim. Lett. 18(1): 365-375 (2024) - 2023
- [j26]Randa Ouchene, Djamal Rebaine, Pierre Baptiste:
Ambiguity of the definition of permutation flow shops in the presence of missing operations. Comput. Ind. Eng. 182: 109387 (2023) - 2022
- [j25]Abdennour Azerine, Mourad Boudhar, Djamal Rebaine:
A two-machine no-wait flow shop problem with two competing agents. J. Comb. Optim. 43(1): 168-199 (2022) - [j24]Alain Quilliot, Djamal Rebaine:
Linear time algorithms on mirror trees. J. Comb. Optim. 44(5): 3495-3519 (2022) - 2021
- [j23]Massiva Roudjane, Djamal Rebaïne, Raphaël Khoury, Sylvain Hallé:
Detecting trend deviations with generic stream processing patterns. Inf. Syst. 101: 101446 (2021) - [j22]Nadia Babou, Djamal Rebaine, Mourad Boudhar:
Two-machine open shop problem with a single server and set-up time considerations. Theor. Comput. Sci. 867: 13-29 (2021) - 2020
- [j21]Imène Benkalai, Djamal Rebaine, Pierre Baptiste:
Scheduling job shop problems with operators with respect to the maximum lateness. RAIRO Oper. Res. 54(2): 555-568 (2020) - [c7]Ghassan Fadlallah, Hamid Mcheick, Djamal Rebaine:
Internet-of-Things (IoT) Shortest Path Algorithms and Communication Case Studies for Maintaining Connectivity in Harsh Environements. ISNCC 2020: 1-8
2010 – 2019
- 2019
- [j20]Imène Benkalai, Djamal Rebaine, Pierre Baptiste:
Scheduling flow shops with operators. Int. J. Prod. Res. 57(2): 338-356 (2019) - [c6]Massiva Roudjane, Djamal Rebaine, Raphaël Khoury, Sylvain Hallé:
Predictive Analytics for Event Stream Processing. EDOC 2019: 171-182 - 2018
- [j19]Alain Quilliot, Djamal Rebaine, Hélène Toussaint:
Lower and upper bounds for the linear arrangement problem on interval graphs. RAIRO Oper. Res. 52(4): 1123-1145 (2018) - [c5]Massiva Roudjane, Djamal Rebaine, Raphaël Khoury, Sylvain Hallé:
Real-Time Data Mining for Event Streams. EDOC 2018: 123-134 - [c4]Ghassan Fadlallah, Hamid Mcheick, Djamal Rebaine, Mehdi Adda:
Towards Mobile Collaborative Autonomous Networks Using Peer-to-Peer Communication. ICSENT 2018: 11:1-11:8 - 2017
- [j18]Pierre Baptiste, Djamal Rebaine, Mohammed Zouba:
FPTAS for the two identical parallel machine problem with a single operator under the free changing mode. Eur. J. Oper. Res. 256(1): 55-61 (2017) - [j17]Pierre Baptiste, Reinhard Bürgy, Alain Hertz, Djamal Rebaine:
Online heuristics for unloading boxes off a gravity conveyor. Int. J. Prod. Res. 55(11): 3046-3057 (2017) - [j16]Imène Benkalai, Djamal Rebaine, Caroline Gagné, Pierre Baptiste:
Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times. Int. J. Prod. Res. 55(20): 6145-6157 (2017) - 2016
- [j15]Alain Quilliot, Djamal Rebaine:
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs. RAIRO Oper. Res. 50(2): 315-325 (2016) - [c3]Christophe Clavier, Djamal Rebaine:
A Heuristic Approach to Assist Side Channel Analysis of the Data Encryption Standard. The New Codebreakers 2016: 355-373 - 2014
- [j14]Alix Munier Kordon, Djamal Rebaine:
The coupled unit-time operations problem on identical parallel machines with respect to the makespan. Oper. Res. Lett. 42(1): 21-26 (2014) - [j13]Aziz Moukrim, Djamal Rebaine, Mehdi Serairi:
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays. RAIRO Oper. Res. 48(2): 235-254 (2014) - [c2]Alain Quilliot, Djamal Rebaine:
Exact and Approximation Algorithms for Linear Arrangement Problems. FedCSIS 2014: 493-500 - [c1]Alain Quilliot, Djamal Rebaine:
Linear Arrangement Problems and Interval Graphs. ISCO 2014: 359-370 - 2013
- [j12]Ammar Oulamara, Djamal Rebaine, Mehdi Serairi:
Scheduling the two-machine open shop problem under resource constraints for setting the jobs. Ann. Oper. Res. 211(1): 333-356 (2013) - [j11]Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine:
A polynomial time algorithm for unloading boxes off a gravity conveyor. Discret. Optim. 10(4): 251-262 (2013) - [i1]Alain Quilliot, Djamal Rebaine:
Approximation results for the linear ordering problem on interval graphs. CTW 2013: 197-200 - 2010
- [j10]Djamal Rebaine:
Scheduling flexible flowshops with unit-time operations and minimum time delays. Electron. Notes Discret. Math. 36: 1193-1200 (2010) - [j9]Alix Munier Kordon, Djamal Rebaine:
The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan. Eur. J. Oper. Res. 203(1): 42-49 (2010)
2000 – 2009
- 2009
- [j8]Mohammed Zouba, Pierre Baptiste, Djamal Rebaine:
Scheduling identical parallel machines and operators within a period based changing mode. Comput. Oper. Res. 36(12): 3231-3239 (2009) - [j7]Wieslaw Kubiak, Djamal Rebaine, Chris N. Potts:
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors. Discret. Optim. 6(1): 79-91 (2009) - 2008
- [j6]Alix Munier Kordon, Djamal Rebaine:
Polynomial time algorithms for the UET permutation flowshop problem with time delays. Comput. Oper. Res. 35(2): 525-537 (2008) - [j5]Victor J. Rayward-Smith, Djamal Rebaine:
Analysis of heuristics for the UET two-machine flow shop problem with time delays. Comput. Oper. Res. 35(10): 3298-3310 (2008) - 2005
- [j4]Djamal Rebaine:
Flow shop vs. permutation shop with time delays. Comput. Ind. Eng. 48(2): 357-362 (2005)
1990 – 1999
- 1999
- [j3]Djamal Rebaine, Vitaly A. Strusevich:
Two-machine open shop scheduling with special transportation times. J. Oper. Res. Soc. 50(7): 756-764 (1999) - 1996
- [j2]Victor J. Rayward-Smith, Djamal Rebaine:
Uet Flow Shop Scheduling with Delays. RAIRO Theor. Informatics Appl. 30(1): 23-30 (1996) - 1992
- [j1]Victor J. Rayward-Smith, Djamal Rebaine:
Open shop scheduling with delays. RAIRO Theor. Informatics Appl. 26: 439-447 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
