default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaha Arbaoui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Hajar Nouinou
, Taha Arbaoui, Alice Yalaoui:
Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times. Int. J. Prod. Res. 62(6): 2272-2285 (2024)- [c13]Ilhem Slama, Taha Arbaoui, Faicel Hnaien, Oussama Ben-Ammar, Belgacem Bettayeb, Alexandre Dolgui:
Simultaneous Backward Reduction algorithm for disassembly lot-sizing under random ordering lead time. CoDIT 2024: 2114-2119 - [c12]Yousra Farhani, Malak Saiem, Taha Arbaoui, Faicel Hnaien:
Enhanced QUBO Formulations for The Flow Shop Scheduling Problem. GECCO Companion 2024: 1942-1949 - [c11]Gaia Sassone, Taha Arbaoui, Valerie Botta-Genoulaz:
How Best Practices of SCOR DS Model Support Short Supply Chains Management: A Bibliometric Analysis. PRO-VE (1) 2024: 259-273 - 2023
- [j6]Faicel Hnaien, Taha Arbaoui:
Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown. Ann. Oper. Res. 328(2): 1437-1460 (2023) - [c10]Ilhem Slama, Taha Arbaoui, Amir Nourmohammadi, Masood Fathi:
Assembly Line Balancing with Collaborative Robots Under Uncertainty of Human Processing Times. CoDIT 2023: 2649-2653 - [c9]Taha Arbaoui, Mohamed Elamine Athmani, Mohammed Henni, Akram Badreddine Laissaoui, Mourad Terzi:
PyScheduling: an Extensible and User-Friendly Python Framework for Scheduling Problems. GECCO Companion 2023: 1855-1863 - [c8]Malak Saiem, Taha Arbaoui, Faicel Hnaien:
Solving the Flow-Shop Scheduling problem using Grover's Algorithm. GECCO Companion 2023: 2250-2253 - 2022
- [j5]Cyril Koch, Taha Arbaoui, Yassine Ouazene, Farouk Yalaoui, Humbert De Brunier, Nicolas Jaunet, Antoine De Wulf:
A matheuristic approach for solving a simultaneous lot sizing and scheduling problem with client prioritization in tire industry. Comput. Ind. Eng. 165: 107932 (2022) - [c7]Mohamed Elamine Athmani, Taha Arbaoui, Younes Mimene, Farouk Yalaoui:
Efficient heuristics and metaheuristics for the unrelated parallel machine scheduling problem with release dates and setup times. GECCO 2022: 177-185 - [i3]Cyril Koch, Taha Arbaoui, Yassine Ouazene, Farouk Yalaoui, Humbert De Brunier, Nicolas Jaunet, Antoine De Wulf:
A Matheuristic Approach for Solving a Simultaneous Lot Sizing and Scheduling Problem with Client Prioritization in Tire Industry. CoRR abs/2201.08836 (2022) - 2021
- [j4]Jean-Paul Boufflet, Taha Arbaoui, Aziz Moukrim:
The student scheduling problem at Université de Technologie de Compiègne. Expert Syst. Appl. 175: 114735 (2021) - [c6]Ibtissem Chouba, Lionel Amodeo, Farouk Yalaoui, Taha Arbaoui, David Laplanche:
Simulating Emergency Departments Using Generalized Petri Nets. ACIIDS 2021: 224-234 - [c5]Riyadh Baghdadi, Massinissa Merouani, Mohamed-Hicham Leghettas, Kamel Abdous, Taha Arbaoui, Karima Benatchba, Saman P. Amarasinghe:
A Deep Learning Based Cost Model for Automatic Code Optimization. MLSys 2021 - [i2]Riyadh Baghdadi, Massinissa Merouani, Mohamed-Hicham Leghettas, Kamel Abdous, Taha Arbaoui, Karima Benatchba, Saman P. Amarasinghe:
A Deep Learning Based Cost Model for Automatic Code Optimization. CoRR abs/2104.04955 (2021) - 2020
- [j3]Melek Rodoplu, Taha Arbaoui, Alice Yalaoui:
A fix-and-relax heuristic for the single-item lot-sizing problem with a flow-shop system and energy constraints. Int. J. Prod. Res. 58(21): 6532-6552 (2020) - [c4]Mourad Terzi, Taha Arbaoui, Farouk Yalaoui, Karima Benatchba:
Solving the Unrelated Parallel Machine Scheduling Problem with Setups Using Late Acceptance Hill Climbing. ACIIDS (1) 2020: 249-258 - [i1]Ibtissem Chouba, Lionel Amodeo, Farouk Yalaoui, Taha Arbaoui, David Laplanche:
A Mixed Integer Linear Program For Human And Material Resources Optimization In Emergency Department. CoRR abs/2011.13596 (2020)
2010 – 2019
- 2019
- [j2]Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim:
Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems. Comput. Oper. Res. 106: 133-142 (2019) - [c3]Ibtissem Chouba, Farouk Yalaoui, Lionel Amodeo, Taha Arbaoui, Philippe Blua, David Laplanche, Stéphane Sanchez:
An Efficient Simulation-Based Optimization Approach for Improving Emergency Department Performance. MedInfo 2019: 1939-1940 - 2018
- [c2]Taha Arbaoui, Farouk Yalaoui:
Solving the Unrelated Parallel Machine Scheduling Problem with Additional Resources Using Constraint Programming. ACIIDS (2) 2018: 716-725 - 2015
- [j1]Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim:
Preprocessing and an improved MIP model for examination timetabling. Ann. Oper. Res. 229(1): 19-40 (2015) - 2013
- [c1]Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim:
An Analysis Framework for Examination Timetabling. SOCS 2013: 11-19
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-11-13 23:52 CET 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:
