This page has only limited features, please log in for full access.

Unclaimed
Abdessamad Ait El Cadi
Laboratory of Industrial and Human Automation Control, Mechanical Engineering and Computer Science (LAMIH UMR CNRS 8201), Université Polytechnique Haut-de-France (UPHF), Valenciennes, France

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 23 April 2021 in International Journal of Production Economics
Reads 0
Downloads 0

This paper proposes a new joint production, maintenance, and dynamic sampling inspection control policy, for failure-prone manufacturing systems. The integrated policy help decision-makers to find both production rate and maintenance frequency, as well as the size of the sample to be inspected. The inspection policy is based on a dynamic sampling plan, which adapts the sample size according to the system degradation and takes into account the interactions between production, maintenance, and quality control. To optimize jointly the integrated policy's control settings, a comprehensive and thorough mathematical model is developed to capture the complex dynamic and stochastic behavior of the manufacturing system. The proposed model relaxes several simplifying assumptions so that reliability and quality degradations are operation-dependent, duration and cost of inspection are non-negligible, no restriction on random distributions and failures occur at any time, as in the real manufacturing world. Besides, a new signal-based simulation model is developed and a detailed sensitivity analysis is carried out to validate analytical results. The results show the relevance of the analytical approach and help us to prove the importance of adapting the inspection effort to the inner quality in the production. An extended comparative study is provided and shows that the proposed integrated policy, based on dynamic inspection, outperforms those based on classical inspection strategies considered in the literature and practice.

ACS Style

Abdessamad Ait-El-Cadi; Ali Gharbi; Karem Dhouib; Abdelhakim Artiba. Integrated production, maintenance and quality control policy for unreliable manufacturing systems under dynamic inspection. International Journal of Production Economics 2021, 236, 108140 .

AMA Style

Abdessamad Ait-El-Cadi, Ali Gharbi, Karem Dhouib, Abdelhakim Artiba. Integrated production, maintenance and quality control policy for unreliable manufacturing systems under dynamic inspection. International Journal of Production Economics. 2021; 236 ():108140.

Chicago/Turabian Style

Abdessamad Ait-El-Cadi; Ali Gharbi; Karem Dhouib; Abdelhakim Artiba. 2021. "Integrated production, maintenance and quality control policy for unreliable manufacturing systems under dynamic inspection." International Journal of Production Economics 236, no. : 108140.

Journal article
Published: 08 March 2021 in Sustainability
Reads 0
Downloads 0

The circular economy is gaining in importance globally and locally. The COVID-19 crisis, as an exceptional event, showed the limits and the fragility of supply chains, with circular economy practices as a potential solution during and post-COVID. Reverse logistics (RL) is an important dimension of the circular economy which allows management of economic, social, and environmental challenges. Transportation is needed for RL to effectively operate, but research study on this topic has been relatively limited. New digitalization opportunities can enhance transportation and RL, and therefore further enhance the circular economy. This paper proposes to review practical research and concerns at the nexus of transportation, RL, and blockchain as a digitalizing technology. The potential benefits of blockchain technology through example use cases on various aspects of RL and transportation activities are presented. This integration and applications are evaluated using various capability facets of blockchain technology, particularly as an immutable and reliable ledger, a tracking service, a smart contract utility, as marketplace support, and as tokenization and incentivization. We also briefly introduce the physical internet concept within this context. The physical internet paradigm proposed last decade, promises to also disrupt the blockchain, transportation, and RL nexus. We include potential research directions and managerial implications across the blockchain, transportation, and RL nexus.

ACS Style

Abdelghani Bekrar; Abdessamad Ait El Cadi; Raca Todosijevic; Joseph Sarkis. Digitalizing the Closing-of-the-Loop for Supply Chains: A Transportation and Blockchain Perspective. Sustainability 2021, 13, 2895 .

AMA Style

Abdelghani Bekrar, Abdessamad Ait El Cadi, Raca Todosijevic, Joseph Sarkis. Digitalizing the Closing-of-the-Loop for Supply Chains: A Transportation and Blockchain Perspective. Sustainability. 2021; 13 (5):2895.

Chicago/Turabian Style

Abdelghani Bekrar; Abdessamad Ait El Cadi; Raca Todosijevic; Joseph Sarkis. 2021. "Digitalizing the Closing-of-the-Loop for Supply Chains: A Transportation and Blockchain Perspective." Sustainability 13, no. 5: 2895.

Journal article
Published: 19 December 2020 in Journal of Manufacturing Systems
Reads 0
Downloads 0

Joint production system control is a challenge for researchers and a daily defy for managers and practitioners. The large concern comes from the interdependence between the system states and the control actions. Several analytical models have addressed these issues but remain inefficient because they are based on many simplifying assumptions for mathematical tractability (mainly concerning the system degradation mode). This is critical because degradation modeling impacts the overall manufacturing system and leads to an over or an under estimation of its performance. In this paper, we propose an efficient stochastic analytical model of integrated production and preventive maintenance control for manufacturing systems subject to operation-dependent degradations of both reliability and quality. A make-to-stock production strategy and an age-based preventive maintenance policy are employed to cope with uncertainty. The main objective is to jointly optimize the production and maintenance control settings by minimizing the total incurred cost. A simulation model is also developed to validate the mathematical model. Numerical examples and a detailed sensitivity analysis are provided to assess the quality of our model and to derive relevant insight and issues regarding the interaction between production, maintenance, and quality.

ACS Style

Abdessamad Ait El Cadi; Ali Gharbi; Karem Dhouib; Abdelhakim Artiba. Joint production and preventive maintenance controls for unreliable and imperfect manufacturing systems. Journal of Manufacturing Systems 2020, 58, 263 -279.

AMA Style

Abdessamad Ait El Cadi, Ali Gharbi, Karem Dhouib, Abdelhakim Artiba. Joint production and preventive maintenance controls for unreliable and imperfect manufacturing systems. Journal of Manufacturing Systems. 2020; 58 ():263-279.

Chicago/Turabian Style

Abdessamad Ait El Cadi; Ali Gharbi; Karem Dhouib; Abdelhakim Artiba. 2020. "Joint production and preventive maintenance controls for unreliable and imperfect manufacturing systems." Journal of Manufacturing Systems 58, no. : 263-279.

Conference paper
Published: 03 December 2020 in Transactions on Petri Nets and Other Models of Concurrency XV
Reads 0
Downloads 0

In recent decades, the helicopter has become a safe and suitable solution for future traffic, both in congested megacities and in isolated places as well as in mountainous environment where the terrain can be dangerous. Adding the third dimension to multimodal urban transport networks will improve the way we live. In order to solve the challenge of navigation towards more autonomy, it is necessary, during mission planning and flight execution, to generate effective, accurate and feasible paths. However, the major works in the literature do not address the effectiveness - flyability and controllability - of the generated trajectories for helicopters. This paper proposes an approach with continuous-curvature trajectory generation into inclined planes and proves the controllability by a simulated autopilot system designed for an Airbus Helicopters model in Matlab Simulink environment. We found that this type of trajectories is effective and controllable by an autopilot with only 3% of deviation error. The results are promising and the approach will be integrated in our works on a 4-dimensional flight management system for helicopters.

ACS Style

Hortense Ollivier-Legeay; Abdessamad Ait El Cadi; Nicolas Belanger; David Duvivier. A 4D Augmented Flight Management System Based on Flight Planning and Trajectory Generation Merging. Transactions on Petri Nets and Other Models of Concurrency XV 2020, 184 -195.

AMA Style

Hortense Ollivier-Legeay, Abdessamad Ait El Cadi, Nicolas Belanger, David Duvivier. A 4D Augmented Flight Management System Based on Flight Planning and Trajectory Generation Merging. Transactions on Petri Nets and Other Models of Concurrency XV. 2020; ():184-195.

Chicago/Turabian Style

Hortense Ollivier-Legeay; Abdessamad Ait El Cadi; Nicolas Belanger; David Duvivier. 2020. "A 4D Augmented Flight Management System Based on Flight Planning and Trajectory Generation Merging." Transactions on Petri Nets and Other Models of Concurrency XV , no. : 184-195.

Original paper
Published: 28 November 2020 in Optimization Letters
Reads 0
Downloads 0

This paper examines a new model for hub location known as the hub location routing problem. The problem shares similarities with the well studied uncapacitated single allocation p-hub median problem except that the hubs are now connected to each other by a cyclical path (or tour) known as the global route, each cluster of non-hub nodes and assigned hub is also connected by a single tour known as a local route, and the length of the local routes is constrained to a maximum number of nodes. Thus, aside from the normal tasks of hub selection and allocation of non-hub nodes, up to p + 1 travelling salesman problems need to be solved. A heuristic based on the general variable neighborhood search framework is proposed here to solve this very complicated problem. The improvement phase of the algorithm uses a sequential variable neighborhood descent with multiple neighborhoods required to suit the complex nature of the problem. A best sequencing of the neighborhoods is established through empirical testing. The perturbation phase known as the shaking procedure also uses a well-structured selection of neighborhoods in order to effectively diversify the search to different regions of the solution space. Extensive computational testing shows that the new heuristic significantly outperforms the state-of-the-art. Out of 912 test instances from the literature, we are able to obtain 691 new best known solutions. Not only are the improvements in objective values quite impressive, but also these new solutions are obtained in a small fraction of the time required by the competing algorithms.

ACS Style

Mustapha Ratli; Dragan Urošević; Abdessamad Ait El Cadi; Jack Brimberg; Nenad MladenoviĆ; Raca Todosijević. An efficient heuristic for a hub location routing problem. Optimization Letters 2020, 1 -20.

AMA Style

Mustapha Ratli, Dragan Urošević, Abdessamad Ait El Cadi, Jack Brimberg, Nenad MladenoviĆ, Raca Todosijević. An efficient heuristic for a hub location routing problem. Optimization Letters. 2020; ():1-20.

Chicago/Turabian Style

Mustapha Ratli; Dragan Urošević; Abdessamad Ait El Cadi; Jack Brimberg; Nenad MladenoviĆ; Raca Todosijević. 2020. "An efficient heuristic for a hub location routing problem." Optimization Letters , no. : 1-20.

Articles
Published: 18 November 2020 in International Journal of Production Research
Reads 0
Downloads 0
ACS Style

Anirut Kantasa-Ard; Maroua Nouiri; Abdelghani Bekrar; Abdessamad Ait El Cadi; Yves Sallez. Machine learning for demand forecasting in the physical internet: a case study of agricultural products in Thailand. International Journal of Production Research 2020, 1 -25.

AMA Style

Anirut Kantasa-Ard, Maroua Nouiri, Abdelghani Bekrar, Abdessamad Ait El Cadi, Yves Sallez. Machine learning for demand forecasting in the physical internet: a case study of agricultural products in Thailand. International Journal of Production Research. 2020; ():1-25.

Chicago/Turabian Style

Anirut Kantasa-Ard; Maroua Nouiri; Abdelghani Bekrar; Abdessamad Ait El Cadi; Yves Sallez. 2020. "Machine learning for demand forecasting in the physical internet: a case study of agricultural products in Thailand." International Journal of Production Research , no. : 1-25.

Conference paper
Published: 25 March 2020 in Transactions on Petri Nets and Other Models of Concurrency XV
Reads 0
Downloads 0

Convolution Neural Networks (CNNs) are widely used for image classification and object detection applications. The deployment of these architectures in embedded applications is a great challenge. This challenge arises from CNNs’ high computation complexity that is required to be implemented on platforms with limited hardware resources like FPGA. Since these applications are inherently error-resilient, approximate computing (AC) offers an interesting trade-off between resource utilization and accuracy. In this paper, we study the impact on CNN performances when several approximation techniques are applied simultaneously. We focus on two of the widely used approximation techniques, namely quantization and pruning. Our experimental results showed that for CNN networks of different parameter sizes and 3% loss in accuracy, we can obtain up to 27.9%–47.2% reduction in computation complexity in terms of FLOPs for CIFAR-10 and MNIST datasets.

ACS Style

Karim M. A. Ali; Ihsen Alouani; Abdessamad Ait El Cadi; Hamza Ouarnoughi; Smail Niar. Cross-layer CNN Approximations for Hardware Implementation. Transactions on Petri Nets and Other Models of Concurrency XV 2020, 151 -165.

AMA Style

Karim M. A. Ali, Ihsen Alouani, Abdessamad Ait El Cadi, Hamza Ouarnoughi, Smail Niar. Cross-layer CNN Approximations for Hardware Implementation. Transactions on Petri Nets and Other Models of Concurrency XV. 2020; ():151-165.

Chicago/Turabian Style

Karim M. A. Ali; Ihsen Alouani; Abdessamad Ait El Cadi; Hamza Ouarnoughi; Smail Niar. 2020. "Cross-layer CNN Approximations for Hardware Implementation." Transactions on Petri Nets and Other Models of Concurrency XV , no. : 151-165.

Article
Published: 03 February 2020 in Journal of Global Optimization
Reads 0
Downloads 0

In this work, we are interested in the multi-quays berth allocation and crane assignment problem under availability restrictions. Availability restrictions may arise due weather conditions, or when, for example, cranes must undergo planned maintenance in order to stay in good performance. This problem was inspired by a real-case of a bulk port in Morocco. To solve the problem we propose at first a mixed-integer programming model. Then, in view of the limitations of the proposed model, we investigate a set of heuristics based on general variable neighborhood search with three variants of variable neighborhood descent as a local search. To validate the proposed model and the proposed heuristic approach, real-world instances are used. The computational results reveal that CPLEX MIP solver consumes a lot of CPU time to solve this model, even sometimes failing to guarantee the optimality of the provided solution. On the other hand, the proposed GVNS heuristic turns out to be very efficient in solving the considered problem.

ACS Style

Issam Krimi; Raca Todosijević; Rachid Benmansour; Mustapha Ratli; Abdessamad Ait El Cadi; Afaf Aloullal. Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints. Journal of Global Optimization 2020, 78, 349 -373.

AMA Style

Issam Krimi, Raca Todosijević, Rachid Benmansour, Mustapha Ratli, Abdessamad Ait El Cadi, Afaf Aloullal. Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints. Journal of Global Optimization. 2020; 78 (2):349-373.

Chicago/Turabian Style

Issam Krimi; Raca Todosijević; Rachid Benmansour; Mustapha Ratli; Abdessamad Ait El Cadi; Afaf Aloullal. 2020. "Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints." Journal of Global Optimization 78, no. 2: 349-373.

Journal article
Published: 25 December 2019 in IFAC-PapersOnLine
Reads 0
Downloads 0

This paper proposes an appropriate model to forecast the trend of white sugar consumption rate in Thailand due to the fluctuation of consumption rate nowadays. This paper will focus on two main forecasting model types, which are the regression models and neural network models. Moreover, the performance is evaluated by using Root Mean Square Error (RMSE) and Theil’U statistic value. After processing the experiments, the results demonstrate that Long Short-Term Memory (LSTM) recurrent neural network provides the best performance for the forecasting, with the condition of combination between the existing consumption rate and other relevant factors like production supply, import rate, export rate, and inventory stock. Also tuning the model’s parameters is an important issue.

ACS Style

Anirut Kantasa-Ard; Abdelghani Bekrar; Abdessamad Ait El Cadi; Yves Sallez. Artificial intelligence for forecasting in supply chain management: a case study of White Sugar consumption rate in Thailand. IFAC-PapersOnLine 2019, 52, 725 -730.

AMA Style

Anirut Kantasa-Ard, Abdelghani Bekrar, Abdessamad Ait El Cadi, Yves Sallez. Artificial intelligence for forecasting in supply chain management: a case study of White Sugar consumption rate in Thailand. IFAC-PapersOnLine. 2019; 52 (13):725-730.

Chicago/Turabian Style

Anirut Kantasa-Ard; Abdelghani Bekrar; Abdessamad Ait El Cadi; Yves Sallez. 2019. "Artificial intelligence for forecasting in supply chain management: a case study of White Sugar consumption rate in Thailand." IFAC-PapersOnLine 52, no. 13: 725-730.

Research article
Published: 14 November 2019 in International Journal of Reconfigurable Computing
Reads 0
Downloads 0

Embedded video applications are now involved in sophisticated transportation systems like autonomous vehicles and driver assistance systems. As silicon capacity increases, the design productivity gap grows up for the current available design tools. Hence, high-level synthesis (HLS) tools emerged in order to reduce that gap by shifting the design efforts to higher abstraction levels. In this paper, we present ViPar as a tool for exploring different video processing architectures at higher design level. First, we proposed a parametrizable parallel architectural model dedicated for video applications. Second, targeting this architectural model, we developed ViPar tool with two main features: (1) An empirical model was introduced to estimate the power consumption based on hardware utilization and operating frequency. In addition to that, we derived the equations for estimating the hardware utilization and execution time for each design point during the space exploration process. (2) By defining the main characteristics of the parallel video architecture like parallelism level, the number of input/output ports, the pixel distribution pattern, and so on, ViPar tool can automatically generate the dedicated architecture for hardware implementation. In the experimental validation, we used ViPar tool to generate automatically an efficient hardware implementation for a Multiwindow Sum of Absolute Difference stereo matching algorithm on Xilinx Zynq ZC706 board. We succeeded to increase the design productivity by converging rapidly to the appropriate designs that fit with our system constraints in terms of power consumption, hardware utilization, and frame execution time.

ACS Style

Karim M. A. Ali; Rabie Ben Atitallah; Abdessamad Ait El Cadi; Nizar Fakhfakh; Jean-Luc DeKeyser. ViPar: High-Level Design Space Exploration for Parallel Video Processing Architectures. International Journal of Reconfigurable Computing 2019, 2019, 1 -19.

AMA Style

Karim M. A. Ali, Rabie Ben Atitallah, Abdessamad Ait El Cadi, Nizar Fakhfakh, Jean-Luc DeKeyser. ViPar: High-Level Design Space Exploration for Parallel Video Processing Architectures. International Journal of Reconfigurable Computing. 2019; 2019 ():1-19.

Chicago/Turabian Style

Karim M. A. Ali; Rabie Ben Atitallah; Abdessamad Ait El Cadi; Nizar Fakhfakh; Jean-Luc DeKeyser. 2019. "ViPar: High-Level Design Space Exploration for Parallel Video Processing Architectures." International Journal of Reconfigurable Computing 2019, no. : 1-19.

Conference paper
Published: 03 August 2019 in Econometrics for Financial Applications
Reads 0
Downloads 0

This paper proposes an approach to reduce the complexity of hub’s connection. The approach is based on the concept of dynamic clustering for the retailers’ demand, solving retailers to PI-hubs’ clusters assignment problem, and then tackling a routing problem for each cluster. The dynamic clustering is based on a forecasted demand calculated from learning algorithm, Long Short-Term Memory (LSTM) Recurrent Neural Network. After implementing the clustering method, a Mixed Integer Linear Programming model is used to solve the problem of assigning retailers to clusters. Besides, this paper evaluates the clustering performance using Hopkins statistic and Silhouette width scores. The experiments and the results show that the dynamic clustering by using K-Medoid models provide a better performance and reduce the complexity of the transportation problem between PI-Hubs and retailers in the context of the Physical Internet.

ACS Style

Anirut Kantasa-Ard; Maroua Nouiri; Abdelghani Bekrar; Abdessamad Ait El Cadi; Yves Sallez. Dynamic Clustering of PI-Hubs Based on Forecasting Demand in Physical Internet Context. Econometrics for Financial Applications 2019, 27 -39.

AMA Style

Anirut Kantasa-Ard, Maroua Nouiri, Abdelghani Bekrar, Abdessamad Ait El Cadi, Yves Sallez. Dynamic Clustering of PI-Hubs Based on Forecasting Demand in Physical Internet Context. Econometrics for Financial Applications. 2019; ():27-39.

Chicago/Turabian Style

Anirut Kantasa-Ard; Maroua Nouiri; Abdelghani Bekrar; Abdessamad Ait El Cadi; Yves Sallez. 2019. "Dynamic Clustering of PI-Hubs Based on Forecasting Demand in Physical Internet Context." Econometrics for Financial Applications , no. : 27-39.

Conference paper
Published: 14 March 2019 in Computer Vision
Reads 0
Downloads 0

In this paper, we consider the integrated Berth Allocation and Crane Assignment problem, with availability constraints and high tides restrictions, in bulk port context. We were inspired by a real case study of a port owned by our industrial partner. The objective is to minimize the total penalty of tardiness. First, we implemented a greedy heuristic to compute an initial solution. Then, we proposed a sequential Variable Neighborhood Descent (seq-VND) for the problem. In addition, we compared the efficiency of different scenarios for the seq-VND against results given by a mathematical model for the problem.

ACS Style

Issam Krimi; Afaf Aloullal; Rachid Benmansour; Abdessamad Ait El Cadi; Laurent Deshayes; David Duvivier. A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints. Computer Vision 2019, 232 -242.

AMA Style

Issam Krimi, Afaf Aloullal, Rachid Benmansour, Abdessamad Ait El Cadi, Laurent Deshayes, David Duvivier. A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints. Computer Vision. 2019; ():232-242.

Chicago/Turabian Style

Issam Krimi; Afaf Aloullal; Rachid Benmansour; Abdessamad Ait El Cadi; Laurent Deshayes; David Duvivier. 2019. "A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints." Computer Vision , no. : 232-242.

Journal article
Published: 01 January 2019 in International Journal of Industrial Engineering Computations
Reads 0
Downloads 0
ACS Style

Issam Krimi; Rachid Benmansour; Abdessamad Ait El Cadi; Laurent Deshayes; David Duvivier; Nizar Elhachemi. A rolling horizon approach for the integrated multi-quays berth allocation and crane assignment problem for bulk ports. International Journal of Industrial Engineering Computations 2019, 577 -591.

AMA Style

Issam Krimi, Rachid Benmansour, Abdessamad Ait El Cadi, Laurent Deshayes, David Duvivier, Nizar Elhachemi. A rolling horizon approach for the integrated multi-quays berth allocation and crane assignment problem for bulk ports. International Journal of Industrial Engineering Computations. 2019; ():577-591.

Chicago/Turabian Style

Issam Krimi; Rachid Benmansour; Abdessamad Ait El Cadi; Laurent Deshayes; David Duvivier; Nizar Elhachemi. 2019. "A rolling horizon approach for the integrated multi-quays berth allocation and crane assignment problem for bulk ports." International Journal of Industrial Engineering Computations , no. : 577-591.

Chapter
Published: 04 December 2018 in Dynamics of Disasters
Reads 0
Downloads 0

In this chapter, we consider The Multiprocessor Scheduling Problem with Communication Delays. We propose a new Mixed Integer Program (MIP) formulation for this problem taking into account the precedence constraints and the communication delays—delays that depend on the network and the tasks. The new proposed formulation reduces both the number of variables and the number of constraints, when compared to the best mathematical programming formulations from the literature. We summarize the mathematical formulation in a previous work and, in the present chapter; we added extra results to show the quality of the new model. The aim of the extended tests is to assess the quality of this model from one side and from the other side to show which parameters affect the performance of our model, especially the network architecture, the communication, and the number of task impacts. The results are significant but there are still some open problems to solve.

ACS Style

Abdessamad Ait El Cadi; Mustapha Ratli; Nenad MladenoviĆ. New MIP model for Multiprocessor Scheduling Problem with Communication Delays. Dynamics of Disasters 2018, 129 -149.

AMA Style

Abdessamad Ait El Cadi, Mustapha Ratli, Nenad MladenoviĆ. New MIP model for Multiprocessor Scheduling Problem with Communication Delays. Dynamics of Disasters. 2018; ():129-149.

Chicago/Turabian Style

Abdessamad Ait El Cadi; Mustapha Ratli; Nenad MladenoviĆ. 2018. "New MIP model for Multiprocessor Scheduling Problem with Communication Delays." Dynamics of Disasters , no. : 129-149.

Conference paper
Published: 01 March 2018 in 2018 7th International Conference on Industrial Technology and Management (ICITM)
Reads 0
Downloads 0

In the literature, some works deal with the integrated Berth Allocation and Crane Assignment Problem (BACAP) in container and bulk port context. Most of them consider that equipment are always available and high tide periods restriction is not imposed. In this work, we were interested by the BACAP under availability and high tide time windows restrictions in bulk port terminal. We proposed a mixed integer programming model for the problem and then, validated it by studying the real-case of Jorf lasfar Phosphate Hub (JPH). Preliminary computational experiments show some promising research opportunities.

ACS Style

Issam Krimi; Rachid Benmansour; Abdessamad Ait El Cadi; David Duvivier; Nizar Elhachemi; Laurent Deshayes; Amine Ait Ouarrasse. The integrated multi-quay Berth Allocation and Crane Assignment Problem: Formulation and case study. 2018 7th International Conference on Industrial Technology and Management (ICITM) 2018, 157 -161.

AMA Style

Issam Krimi, Rachid Benmansour, Abdessamad Ait El Cadi, David Duvivier, Nizar Elhachemi, Laurent Deshayes, Amine Ait Ouarrasse. The integrated multi-quay Berth Allocation and Crane Assignment Problem: Formulation and case study. 2018 7th International Conference on Industrial Technology and Management (ICITM). 2018; ():157-161.

Chicago/Turabian Style

Issam Krimi; Rachid Benmansour; Abdessamad Ait El Cadi; David Duvivier; Nizar Elhachemi; Laurent Deshayes; Amine Ait Ouarrasse. 2018. "The integrated multi-quay Berth Allocation and Crane Assignment Problem: Formulation and case study." 2018 7th International Conference on Industrial Technology and Management (ICITM) , no. : 157-161.

Journal article
Published: 01 April 2017 in Electronic Notes in Discrete Mathematics
Reads 0
Downloads 0
ACS Style

Danijela Đorić; Abdessamad Ait El Cadi; Saïd Hanafi; Nenad MladenoviĆ; Abdelhakim Artiba. Clustering approach in maintenance of capillary railway network. Electronic Notes in Discrete Mathematics 2017, 58, 239 -246.

AMA Style

Danijela Đorić, Abdessamad Ait El Cadi, Saïd Hanafi, Nenad MladenoviĆ, Abdelhakim Artiba. Clustering approach in maintenance of capillary railway network. Electronic Notes in Discrete Mathematics. 2017; 58 ():239-246.

Chicago/Turabian Style

Danijela Đorić; Abdessamad Ait El Cadi; Saïd Hanafi; Nenad MladenoviĆ; Abdelhakim Artiba. 2017. "Clustering approach in maintenance of capillary railway network." Electronic Notes in Discrete Mathematics 58, no. : 239-246.

Journal article
Published: 01 January 2016 in IFAC-PapersOnLine
Reads 0
Downloads 0
ACS Style

Abdelahad Chraibi; Abdessamad Ait El Cadi; Said Kharraja; Abdelhakim Artiba. Using Discrete Event Simulation to evaluate Operating Theater Layout. IFAC-PapersOnLine 2016, 49, 95 -98.

AMA Style

Abdelahad Chraibi, Abdessamad Ait El Cadi, Said Kharraja, Abdelhakim Artiba. Using Discrete Event Simulation to evaluate Operating Theater Layout. IFAC-PapersOnLine. 2016; 49 (12):95-98.

Chicago/Turabian Style

Abdelahad Chraibi; Abdessamad Ait El Cadi; Said Kharraja; Abdelhakim Artiba. 2016. "Using Discrete Event Simulation to evaluate Operating Theater Layout." IFAC-PapersOnLine 49, no. 12: 95-98.

Conference paper
Published: 01 October 2015 in 2015 International Conference on Industrial Engineering and Systems Management (IESM)
Reads 0
Downloads 0

In this paper, we propose to generalize the model of the integration of noncyclical preventive maintenance scheduling and production planning from a single machine to a series-parallel production line. As in the case of a single machine, we consider, a set of products that must be produced in lots during a given horizon. As maintenance strategy, we consider the possibility of preventive remplacements at the beginning of each period (maintenance period), and minimal repair at machine failure. The model addressed determines the optimal production plan and preventive remplacement for each component of the series-parallel production line. The objective is to minimize the total cost consisting of preventive and corrective maintenance costs, setup costs, holding costs, backorder and production costs, while meeting the demand of each product over the entire horizon.

ACS Style

Abdessamad Ait El Cadi; Nizar El Hachemi; Abdelhakim Artiba; Mohamed Anouar Jamali. Generalizing of the integration of noncyclical preventive maintenance scheduling and production planning for a series-parallel production line. 2015 International Conference on Industrial Engineering and Systems Management (IESM) 2015, 216 -219.

AMA Style

Abdessamad Ait El Cadi, Nizar El Hachemi, Abdelhakim Artiba, Mohamed Anouar Jamali. Generalizing of the integration of noncyclical preventive maintenance scheduling and production planning for a series-parallel production line. 2015 International Conference on Industrial Engineering and Systems Management (IESM). 2015; ():216-219.

Chicago/Turabian Style

Abdessamad Ait El Cadi; Nizar El Hachemi; Abdelhakim Artiba; Mohamed Anouar Jamali. 2015. "Generalizing of the integration of noncyclical preventive maintenance scheduling and production planning for a series-parallel production line." 2015 International Conference on Industrial Engineering and Systems Management (IESM) , no. : 216-219.

Conference paper
Published: 01 October 2015 in 2015 International Conference on Industrial Engineering and Systems Management (IESM)
Reads 0
Downloads 0

We consider the problem of scheduling a set of jobs on a single machine subject to stochastic failures. The objective is to minimizing the makespan. The machine could be stopped for preventive maintenance occasionally to reduce the risk of failure and to improve its reliability. Furthermore, in the case of a breakdown, the machine undergoes a corrective maintenance which brings the age of the machine to zero (That is to say the machine is considered as good as new) and the current processed job is reprocessed from the beginning. Despite the fact that the scheduling problem with single or periodic maintenance has been well studied, most of the studies considered only deterministic cases. In other words the machine never fails. In this paper we take into account the stochastic failures while minimizing the makespan and determining the corresponding optimal sequence of jobs and optimal preventive maintenance policy. Both the exponential and the Weibull distribution are considered to model the probability density function associated with the lifetime of the machine. We use Arena and Optquest to optimize the performance criterion which allows us choosing the best sequence of jobs and the best amount of preventive maintenance.

ACS Style

Abdessamad Ait El Cadi; Rachid Benmansour; Faiza Serraj; Abdelhakim Artiba. A joint optimization-simulation model to minimize the makespan on a repairable machine. 2015 International Conference on Industrial Engineering and Systems Management (IESM) 2015, 489 -495.

AMA Style

Abdessamad Ait El Cadi, Rachid Benmansour, Faiza Serraj, Abdelhakim Artiba. A joint optimization-simulation model to minimize the makespan on a repairable machine. 2015 International Conference on Industrial Engineering and Systems Management (IESM). 2015; ():489-495.

Chicago/Turabian Style

Abdessamad Ait El Cadi; Rachid Benmansour; Faiza Serraj; Abdelhakim Artiba. 2015. "A joint optimization-simulation model to minimize the makespan on a repairable machine." 2015 International Conference on Industrial Engineering and Systems Management (IESM) , no. : 489-495.

Conference paper
Published: 01 October 2015 in 2015 International Conference on Industrial Engineering and Systems Management (IESM)
Reads 0
Downloads 0

The purpose of this paper is to present a Variable Neighborhood Search (VNS) metaheuristic for solving the Multiprocessor Scheduling Problem with Communication Delays (MSPCD). The MSPCD problem considers scheduling task graph on a multiprocessor system, taking into account communication delays. The task graph contains precedence relations as well as the amount of exchanged data between tasks. The multiprocessor architecture is composed by a set of identical processors connected in an arbitrary way. The communication is defined throw two symmetric matrices containing, respectively, the communication rate and the access cost between each two processors. Unlike the proposed VNS in the literature, we use a different representation of the solutions that leads to the definition of two natural neigh-borhoods structures. Computational experience shows advantages of our approach.

ACS Style

Abdessamad Ait El Cadi; Rabie Ben Atitallah; Nenad Mladenovic; Abdelhakim Artiba. A Variable Neighborhood Search (VNS) metaheuristic for Multiprocessor Scheduling Problem with Communication Delays. 2015 International Conference on Industrial Engineering and Systems Management (IESM) 2015, 1091 -1095.

AMA Style

Abdessamad Ait El Cadi, Rabie Ben Atitallah, Nenad Mladenovic, Abdelhakim Artiba. A Variable Neighborhood Search (VNS) metaheuristic for Multiprocessor Scheduling Problem with Communication Delays. 2015 International Conference on Industrial Engineering and Systems Management (IESM). 2015; ():1091-1095.

Chicago/Turabian Style

Abdessamad Ait El Cadi; Rabie Ben Atitallah; Nenad Mladenovic; Abdelhakim Artiba. 2015. "A Variable Neighborhood Search (VNS) metaheuristic for Multiprocessor Scheduling Problem with Communication Delays." 2015 International Conference on Industrial Engineering and Systems Management (IESM) , no. : 1091-1095.