default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaïcir Loukil
Person information
- affiliation: University of Sfax
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c12]Fatma Ben Amor, Manel Kammoun, Taïcir Loukil:
Exact Method and Iterative Approach to Solve a Case Study of the National Social Security Fund. CoDIT 2022: 556-560- 2021
- [j21]Sonda Elloumi
, Taïcir Loukil, Philippe Fortemps:
Reactive heuristics for disrupted multi-mode resource-constrained project scheduling problem. Expert Syst. Appl. 167: 114132 (2021) - [c11]Salma Hadj Taieb, Taïcir Moalla Loukil, Abderrahman El Mhamedi, Yasmina Hani:
Two Variants of Bi-objective Vehicle Routing Problem in Home (Health)-Care Fields. APMS (5) 2021: 77-86 - 2020
- [j20]Fraj Naifar, Mariem Gzara, Taïcir Moalla Loukil:
A new leader guided optimization for the flexible job shop problem. J. Comb. Optim. 39(2): 602-617 (2020)
2010 – 2019
- 2018
- [j19]Emna Dhouib, Jacques Teghem, Taïcir Loukil:
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic. Ann. Oper. Res. 267(1-2): 101-134 (2018) - 2017
- [j18]Sonda Elloumi, Philippe Fortemps, Taïcir Loukil:
Multi-objective algorithms to multi-mode resource-constrained projects under mode change disruption. Comput. Ind. Eng. 106: 161-173 (2017) - 2016
- [j17]Faiza Walha, Abdelghani Bekrar, Sondes Chaabane, Taïcir Moalla Loukil:
A rail-road PI-hub allocation problem: Active and reactive approaches. Comput. Ind. 81: 138-151 (2016) - [c10]Faiza Walha, Abdelghani Bekrar, Sondès Chaabane, Taïcir Loukil:
A road rail PI hub allocation problem: Heuristic in static and dynamic case. AICCSA 2016: 1-8 - 2015
- [j16]Imen Hamdi, Taïcir Loukil:
Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags. Optim. Lett. 9(3): 465-482 (2015) - [j15]Imen Hamdi, Taïcir Loukil:
Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags. Oper. Res. 15(1): 95-114 (2015) - [c9]Soumaya Dhib, Sid-Ali Addouche, Abderrahman El Mhamedi, Taïcir Loukil:
Performance Study for a Sustainable Strategy: Case of Electrical and Electronic Equipments Waste. PLM 2015: 572-587 - [p1]Faiza Walha, Sondes Chaabane, Abdelghani Bekrar, Taïcir Moalla Loukil:
A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem. Service Orientation in Holonic and Multi-agent Manufacturing 2015: 307-314 - 2014
- [c8]Imen Hamdi, Taïcir Loukil:
Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags. CoDIT 2014: 42-47 - [c7]Soumaya Dhib, Diala Dhouib, Taïcir Loukil:
A configuration model for recovery product flows orientation in open loop network. ICALT 2014: 126-130 - [c6]Amira Kammoun, Taïcir Loukil, Wafik Hachicha:
The use of discrete event simulation in hospital supply chain management. ICALT 2014: 143-148 - [c5]Faiza Walha, Sondes Chaabane, Abdelghani Bekrar, Taïcir Loukil:
The cross docking under uncertainty: State of the art. ICALT 2014: 330-335 - 2013
- [j14]Sameh Chtourou, Marie-Ange Manier, Taïcir Loukil:
A hybrid algorithm for the cyclic hoist scheduling problem with two transportation resources. Comput. Ind. Eng. 65(3): 426-437 (2013) - [j13]Emna Dhouib, Jacques Teghem, Taïcir Loukil:
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints. Int. Trans. Oper. Res. 20(2): 213-232 (2013) - [j12]Emna Dhouib, Jacques Teghem, Taïcir Loukil:
Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints. J. Math. Model. Algorithms 12(1): 85-99 (2013) - [c4]Khaoula Besbes, Hamid Allaoui, Gilles Goncalves, Taïcir Loukil:
A supply chain design with product life cycle and green procurement considerations. ICNSC 2013: 855-860 - 2012
- [j11]Taïcir Loukil, João C. N. Clímaco:
Special issue on recent developments in multiple objective programming and goal programming. Int. Trans. Oper. Res. 19(4): 493-494 (2012) - [j10]Mouna Mezghani, Taïcir Loukil, Belaïd Aouni:
Aggregate planning through the imprecise goal programming model: integration of the manager's preferences. Int. Trans. Oper. Res. 19(4): 581-597 (2012) - [c3]Khaoula Besbes, Hamid Allaoui, Gilles Goncalves, Taïcir Loukil:
A multi-phase approach for supply chain design with product life cycle considerations. ICNSC 2012: 197-202 - 2011
- [j9]Tarek Chaari, Sondes Chaabane, Taïcir Loukil, Damien Trentesaux:
A genetic algorithm for robust hybrid flow shop scheduling. Int. J. Comput. Integr. Manuf. 24(9): 821-833 (2011) - 2010
- [j8]Makram Zaidi, Bassem Jarboui, Imed Kacem, Taïcir Loukil:
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. Electron. Notes Discret. Math. 36: 543-550 (2010) - [j7]Mohamed Cheikh, Bassem Jarboui, Taïcir Loukil:
A genetic algorithms to solve the bicriteria shortest path problem. Electron. Notes Discret. Math. 36: 851-858 (2010) - [j6]Samya Elaoud, Jacques Teghem, Taïcir Loukil:
Multiple crossover genetic algorithm for the multiobjective traveling salesman problem. Electron. Notes Discret. Math. 36: 939-946 (2010)
2000 – 2009
- 2009
- [j5]N. Damak, Bassem Jarboui, Patrick Siarry, Taïcir Loukil:
Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput. Oper. Res. 36(9): 2653-2659 (2009) - [j4]Mohamed Anis Allouche, Belaïd Aouni, Jean-Marc Martel, Taïcir Loukil, Abdelwaheb Rebaï:
Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions. Eur. J. Oper. Res. 192(2): 460-467 (2009) - 2008
- [c2]Souhail Dhouib, Sana Kouraïchi, Taïcir Loukil, Habib Chabchoub:
An Interactive Simulated Annealing Multi-agents Platform to Solve Hierarchical Scheduling Problems with Goals. NICSO 2008: 177-187 - 2007
- [j3]Samya Elaoud, Taïcir Loukil, Jacques Teghem:
The Pareto fitness genetic algorithm: Test function study. Eur. J. Oper. Res. 177(3): 1703-1719 (2007) - [j2]Taïcir Loukil, Jacques Teghem, Philippe Fortemps:
A multi-objective production scheduling case study solved by simulated annealing. Eur. J. Oper. Res. 179(3): 709-722 (2007) - 2006
- [c1]Abdelbasset Essabri, Mariem Gzara, Taïcir Loukil:
Parallel Multi-Objective Evolutionary Algorithm with Multi-Front Equitable Distribution. GCC 2006: 241-244 - 2005
- [j1]Taïcir Loukil, Jacques Teghem, Daniel Tuyttens:
Solving multi-objective production scheduling problems using metaheuristics. Eur. J. Oper. Res. 161(1): 42-61 (2005)
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-04-29 20:32 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:
