Taicir Loukil
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Taicir Loukil has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Emna Dhouib
Unité de recherche LOgistique Gestion Industrielle et de la Qualité (LOGIQ), Institut Supérieur de Gestion Industrielle de Sfax, Université de Sfax, Sfax, Tunisia
3 shared publications - Jacques Teghem
Polytechn. Mons
3 shared publications - Abdelghani Bekrar
Université Polytechnique Hauts-de-France
1 shared publication - Bassem Jarboui
Higher Colleges of Technology
1 shared publication - Belaïd Aouni
Decision Aid Research Group, School of Commerce and Administration, Faculty of Management, Laurentian University, Sudbury, Ontario, Canada
1 shared publication - Faiza Walha
Université de Sfax
1 shared publication
Latest Publications
- 12 February 2018
- Published by Springer Nature in Annals of Operations Research
- Vol. 267 (1-2) , 101-134
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- 12 February 2018
- Published by Springer Nature in Annals of Operations Research
- Vol. 267 (1-2) , 101-134
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- 18 February 2015
- Published by Springer Nature
- p. 307-314
A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem
- 18 February 2015
- Published by Springer Nature
- p. 307-314
A Simulated Annealing Metaheuristic for a Rail-Road PI-Hub Allocation Problem
- 9 December 2014
- Published by Springer Nature in Operational Research
- Vol. 15 (1) , 95-114
Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
- 9 December 2014
- Published by Springer Nature in Operational Research
- Vol. 15 (1) , 95-114
Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
- 18 June 2014
- Published by Springer Nature in Optimization Letters
- Vol. 9 (3) , 465-482
Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- 18 June 2014
- Published by Springer Nature in Optimization Letters
- Vol. 9 (3) , 465-482
Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- 17 January 2013
- Published by Wiley in International Transactions in Operational Research
- Vol. 20 (2) , 213-232
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- 17 January 2013
- Published by Wiley in International Transactions in Operational Research
- Vol. 20 (2) , 213-232
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- 19 March 2012
- Published by Wiley in International Transactions in Operational Research
- Vol. 19 (4) , 581-597
Aggregate planning through the imprecise goal programming model: integration of the manager's preferences
- 19 March 2012
- Published by Wiley in International Transactions in Operational Research
- Vol. 19 (4) , 581-597
Aggregate planning through the imprecise goal programming model: integration of the manager's preferences
- 17 July 2010
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 36, 543-550
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
- 17 July 2010
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 36, 543-550
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (21611890) , 1228-1233
Using Genetic Algorithm in the Multiprocessor Flow Shop to Minimize the Makespan
In this paper, we consider the k-stage multiprocessor flow shop scheduling problem. Our study aims to provide a good approximate solution to this specific problem with the makespan minimization (Cmax) as the objective function. Considering, the success of the genetic algorithms developed for scheduling problems, we apply this metaheuristic to tackle with this problem. We develop a genetic algorithm with a new crossover operator which is a combination between the SJOX crossover operator proposed by Ruiz and Maroto (2006) and the NXO crossover operator proposed by Oguz and Ercan (2005). The design of our genetic algorithm is different compared to the classical structure of the genetic algorithm especially in the encoding of solutions. For the calibration of our metaheuristic's parameters, we conduct several experimental designs. Our algorithm is tested with benchmark problems presented. The results show that the proposed genetic algorithm is an efficient approach for solving the multiprocessor flow shop problem
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (21611890) , 1228-1233
Using Genetic Algorithm in the Multiprocessor Flow Shop to Minimize the Makespan
In this paper, we consider the k-stage multiprocessor flow shop scheduling problem. Our study aims to provide a good approximate solution to this specific problem with the makespan minimization (Cmax) as the objective function. Considering, the success of the genetic algorithms developed for scheduling problems, we apply this metaheuristic to tackle with this problem. We develop a genetic algorithm with a new crossover operator which is a combination between the SJOX crossover operator proposed by Ruiz and Maroto (2006) and the NXO crossover operator proposed by Oguz and Ercan (2005). The design of our genetic algorithm is different compared to the classical structure of the genetic algorithm especially in the encoding of solutions. For the calibration of our metaheuristic's parameters, we conduct several experimental designs. Our algorithm is tested with benchmark problems presented. The results show that the proposed genetic algorithm is an efficient approach for solving the multiprocessor flow shop problem