Tarik Aouam

Prof. Dr. Tarik Aouam

Department of Business Informatics and Operations Management, Faculty of Economics and Business Administration, Ghent University, 9000 Gent, Belgium

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2021 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
KCKaoutar Chargui
Kaoutar Chargui
TZTarik Zouadi
Tarik Zouadi
AFAbdellah El Fallahi
Abdellah El Fallahi
MRMohamed Reghioui
Mohamed Reghioui
Tarik AouamTarik Aouam
Tarik Aouam

1 August 2013 in European Journal of Operational Research
Verified
Journal Article
Closed access
Tarik AouamTarik Aouam
Tarik Aouam
NBNadjib Brahimi
Nadjib Brahimi


1 December 2021 in European Journal of Operational Research
Verified
Journal Article
Closed access
TSTom Servranckx
Tom Servranckx
MVMario Vanhoucke
Mario Vanhoucke
Tarik AouamTarik Aouam
Tarik Aouam

1 August 2020 in Computers & Operations Research
Verified
Journal Article
Closed access
FGFoad Ghadimi
Foad Ghadimi
Tarik AouamTarik Aouam
Tarik Aouam
MVMario Vanhoucke
Mario Vanhoucke

17 November 2014 in International Journal of Production Research
Verified
Journal Article
Closed access
NBNadjib Brahimi
Nadjib Brahimi
Tarik AouamTarik Aouam
Tarik Aouam
EAEl-Houssaine Aghezzaf
El-Houssaine Aghezzaf
We consider a tactical planning problem, which integrates production planning decisions together with order acceptance decisions, while taking into account the dependency between workload and lead times. The proposed model determines which orders to accept and in which period they should be produced, so that they can be delivered to the customer within the acceptable flexible due dates. When the number of accepted orders increases, the workload and production lead time also increase, and this may result in the possibility of missing customer due dates. This problem is formulated as a mixed integer linear programme for which two relax-and-fix heuristic solution methods are proposed. The first one decomposes the problem based on time periods, while the second decomposes it based on orders. The performances of these heuristics are compared with that of a state-of-the-art commercial solver. Our results show that the time-based relax-and-fix heuristic outperforms the order-based relax-and-fix heuristic, and the solver solution as it yields better integrality gaps for much less CPU effort.