Entity

Time filter

Source Type

Sfax, Tunisia

Mohamed Ali B.,FSEGN | Younes B.,FSEGS
Journal of Theoretical and Applied Information Technology | Year: 2013

ERP systems play an important supportive role in most sectors of the economy. This study was developed to answer the question related to the impact of ERP systems on user performance in Tunisian companies. This article proposes a model combining the Task Technology Fit (TTF), the Technology Acceptance Model (TAM) and Delone & McLean model to evaluate the user performance of ERP system. The model was tested using survey data collected from 269 users of the ERP system. The results of structural equation analyzes supported the proposed model and highlighted the important role of perceived ease of use and perceived usefulness in mediating effects between TTF, system quality and information quality and performance users. The results show that TTF, system quality and information quality directly influences the user performance of ERP and indirectly through perceived usefulness and perceived ease of use of ERP. © 2005 - 2013 JATIT & LLS. All rights reserved. Source


Jarboui B.,FSEGS | Eddaly M.,FSEGS | Siarry P.,University Paris Est Creteil
International Journal of Advanced Manufacturing Technology | Year: 2011

A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are representative of the previous works in the area. Then, we compare the results given by three proposed algorithms. For the makespan criterion as well as for the total flowtime, the computational results show that our algorithms are able to provide competitive results and new best upper bounds. © Springer-Verlag London Limited 2010. Source


Jarboui B.,FSEGS | Derbel H.,FSEGS | Hanafi S.,University of Valenciennes and HainautCambresis | Mladenovic N.,Brunel University | Mladenovic N.,Mathematical Institute
Computers and Operations Research | Year: 2013

In this paper we propose various neighborhood search heuristics (VNS) for solving the location routing problem with multiple capacitated depots and one uncapacitated vehicle per depot. The objective is to find depot locations and to design least cost routes for vehicles. We integrate a variable neighborhood descent as the local search in the general variable neighborhood heuristic framework to solve this problem. We propose five neighborhood structures which are either of routing or location type and use them in both shaking and local search steps. The proposed three VNS methods are tested on benchmark instances and successfully compared with other two state-of-the-art heuristics. © 2012 Elsevier Ltd. All rights reserved. Source


Chaabouni F.,FSEGS | Dhiaf M.M.,FSEGS
2011 4th International Conference on Logistics, LOGISTIQUA'2011 | Year: 2011

Outsourcing has become an increasingly popular option for many organisations. In order to clarify the motivation for logistics outsourcing, this paper analyses the perceived advantages and limitations. This article presents an empirical research on thirty Textile-Clothing companies operating in Tunisia. It was carried out to compare between the enterprises which outsource production and distribution functions in terms of benefits and decision-making for choosing third-party logistics. We develop and validate a survey instrument used to collect data for this study. Results based on the analysis of data indicate that most of these users are satisfied with the services providers. © 2011 IEEE. Source


Bouabda R.,FSEGS | Jarboui B.,Institute Superieur Of Commerce Et Of Comptabilite Of Bizerte | Rebai A.,FSEGS
2011 4th International Conference on Logistics, LOGISTIQUA'2011 | Year: 2011

This paper addresses the permutation flowline manufacturing cell with sequence dependent family setup times problem with the objective to minimize the makespan criterion. We propose a new way of hybridizing iterated local search. It consists in using Branch and Bound algorithm as the embedded local search algorithm inside an iterated local search algorithm. Moreover, the application of the branch and bound algorithm is based upon the decomposition of the problem into subproblems. The performance of the proposed method is tested by numerical experiments on a large number of representative problems. © 2011 IEEE. Source

Discover hidden collaborations