The paper aims to analyze the Technical Efficiency of 70 Commercial banks from 19 African countries from 2009-2020. Using the Data Envelopment Analysis (DEA) method of the two main approaches, Variable Return to Scale (VRS) and Constant Return to Scale (CRS) technique on a Panel Data. We find that African banks have a higher efficacy assessment with the VRS than the CRS technique, thus, with a Pure Technical Efficiency (PTE) score than Technical Efficiency (TE) . Our findings show that the majority of the banks are operating at very low levels of efficiency (not technically efficient), and inability to optimize the conversion of bank assets and liabilities into loan production for customers. Furthermore, the banks are operating inefficiently in scale, economic, and allocative manner due to mismatches in scale of production. Considering these findings, the implications of these inefficiencies extend to the overall economic development and financial stability of the region.

The purpose of this study is to propose a bundle of HRM practices. Specifically, this study segments HRM practices in non-overlapping practices to examine their role in organizational innovation. The methodological approach is a quantitative approach using a convenient sampling technique to collect valid data of 126 service sector employees across five sales and service centers. The findings of this study reveal that both commitment and innovation driven HRM practices positively impact organizational innovation. Meanwhile, the results have shown that the High Performance Work System does not impact organizational innovation. Thus, this study argues that to confront the challenges associated with an ever-evolving nature of organizations, top management must use integrative HRM strategies that can yield a cumulative effect in driving organizational innovation.

All projects require a structure to meet project requirements and achieve established goals. This framework is called project management. Therefore, project management plays an important role in national development and economic growth. Project management includes various knowledge areas such as project integration management, project scope management, project schedule management, etc. The article focuses on the resource-constrained project scheduling known as problem so- called the resource-constrained project scheduling problem (RCPSP). The RCPSP is a part of schedule management. The standard RCPSP has two important constraints, resource constraints and precedence relationships of activities during project scheduling. The objective of the problem is to optimize and minimize the project duration, subject to the above constraints. In this paper, we develop a convolutional neural network approach to solve the standard single mode RCPSP. The advantage of this algorithm over conventional methods such as metaheuristics is that it does not need to generate many solutions or populations. In this paper, the serial schedule generation scheme (SSGS) is used to schedule the project activities using an evolved convolutional neural network (CNN) as a tool to select an appropriate priority rule to filter out a candidate activity. The evolved CNN learns according to the eight project parameters, namely network complexity, resource factor, resource strength, average work per activity, etc. The above parameters are the inputs of the network and are recalculated at each step of the project planning. Moreover, the developed network has priority rules which are the outputs of the developed neural network. Therefore, after the learning process, the network can automatically select an appropriate priority rule to filter an activity from the eligible activities. In this way, the algorithm is able to schedule all project activities according to the given project constraints. Finally, the performance of the Convolutional Neural Network (CNN) approach is investigated using standard benchmark problems from PSPLIB in comparison to the MLFNN approach and standard metaheuristics.

Project management has a fundamental role in national development, industrial development, and economic growth. Schedule management is also one of the knowledge areas of project management, which includes the processes employed to manage the timely completion of the project. This paper deals with the Resource-Constrained Project Scheduling Problem (RCPSP), which is a part of schedule management. The objective of the problem is to optimize and minimize the project duration while constraining the resource quantities during project scheduling. There are two important constraints in this problem, namely resource constraints and precedence relationships of activities during project scheduling. Many methods such as exact, heuristic, and meta-heuristic have been developed by researchers to solve the problem, but there is a lack of investigation of the problem using methods such as neural networks and machine learning. In this article, we develop a multi-layer feed-forward neural network (MLFNN) to solve the standard single- mode RCPSP. The advantage of this method over evolutionary methods or metaheuristics is that it is not necessary to generate numerous solutions or populations. The developed MLFNN learns based on eight project parameters, namely network complexity, resource factor, resource strength, average work per activity, percentage of remaining work, etc., which are calculated at each step of project scheduling, and identified priority rules, which are the outputs of the developed neural network. Therefore, after the learning process, the network can automatically select an appropriate priority rule to filter out an unscheduled activity from the list of eligible activities and schedule all activities of the project according to the given project constraints. Finally, we investigate the performance of the presented approach using the standard benchmark problems from PSPLIB.

Smart farming is a feasible solution to help farmers effectively and sustainably manage the potential threats and risks those traditional farmers face, such as product quality, increased production costs, the environment, climate change, natural catastrophes, pests, and inferior goods. Using a survey research design, this research examined smart farming adoption and risk management models by combining the Technology Acceptance Model (TAM) and the Innovation Diffusion Theory (IDT). The research sampled 400 farmers who are members of community enterprises in the northeastern region of Thailand. Data was collected using a questionnaire and analyzed using a statistical package program in four steps: confirmatory factor analysis, path analysis, structural equation model analysis (SEM), and Sobel's test. The findings revealed that government support variables had the most significant influence by adopting smart farming to risk management. Based on the research results, the government can apply this model to create strategies to encourage farmers to adopt smart farming and increase the production efficiency of agricultural products. The farmer can manage the risks of smart farming, which leads to sustainable smart farming and is useful for further academic acceptance and risk management studies. Furthermore, this study contributes to the existing literature on combining TAM and IDT in model adoption and risk management. The limitations include the small sample size adopted and the limited coverage area for the study, which restricts the generalization of the findings. However, the findings offer a glimpse into the benefits of smart farming.

This article presents a new approach to address the problem of joint planning of physical and financial flows. The main contribution of this work is that it integrates supply chain contracts and also focuses on supply chain tactical planning in an uncertain and disrupted environment, taking into account budgetary and contractual constraints. In order to minimize the effect of disturbances due to existing uncertainties, a planning model is developed and implemented on a rolling horizon basis. The goal is to seek the best compromise between the available decision-making levers linked with physical and financial flows by adopting a dynamic process that allows for data update at each planning stage. The results of the implemented approach are analysed to highlight the benefits incurred by the inter-firm collaboration in terms of operational performance and working capital (WC) of the supply chain. Our approach represents a basis for negotiation with the suppliers in order to yield a possibly shared profit.

In this paper, an efficient rolling horizon-based heuristic is presented to solve the integrated berth allocation and crane assignment problem in bulk ports. We were guided by a real case study of a multi-terminal port, owned by our Moroccan industrial partner, under several restrictions as high tides and installation’s availability. First, we proposed a mixed integer programming model for the problem. Then, we investigated a strategy to dissipate the congestion within the presented rolling horizon. A variety of experiments were conducted, and the obtained results show that the proposed methods were efficient from a practical point of view.

Lots of work has been conducted to explore and explain inter-organizational relations between supply chain partners. However, we have noticed that there is no accurate agreement between authors. Therefore, to better understand this disparity, the authors have studied supply chain inter-organizational relationship dynamics in different industries to bring out an analytical framework that allows a better understanding of such an issue. Further, the framework is subjected to expert’s opinion and ranked using the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) approach. These case studies instruct professionals and researchers so that they bring up their level of abstraction that remains appropriate to catch this dynamic in order to guide decision-making and future research and studies.

This work is devoted to the study of the Uncertain Quay Crane Scheduling Problem (QCSP), where the loading /unloading times of containers and travel time of quay cranes are considered uncertain. The problem is solved with a Simulation Optimization approach which takes advantage of the great possibilities offered by the simulation to model the real details of the problem and the capacity of the optimization to find solutions with good quality. An Ant Colony Optimization (ACO) meta-heuristic hybridized with a Variable Neighborhood Descent (VND) local search is proposed to determine the assignments of tasks to quay cranes and the sequences of executions of tasks on each crane. Simulation is used inside the optimization algorithm to generate scenarios in agreement with the probabilities of the distributions of the uncertain parameters, thus, we carry out stochastic evaluations of the solutions found by each ant. The proposed optimization algorithm is tested first for the deterministic case on several well-known benchmark instances. Then, in the stochastic case, since no other work studied exactly the same problem with the same assumptions, the Simulation Optimization approach is compared with the deterministic version. The experimental results show that the optimization algorithm is competitive as compared to the existing methods and that the solutions found by the Simulation Optimization approach are more robust than those found by the optimization algorithm.

During the past few years, transportation of agricultural products is increasingly becoming a crucial problem in supply chain logistics. In this paper, we present a new mathematical formulation and two solution approaches for an intermodal transportation problem. The proposed bi-objective model is applied to the transportation of agricultural products from Morocco to Europe to minimise both the transportation cost either in the form of uni-modal or intermodal, as well as the maximal overtime to delivery products. The first solution approach is based on a non-dominated sorting genetic algorithm improved by a local search heuristic and the second one is the GRASP algorithm (Greedy Randomised Adaptive Search Procedure) with iterated local search heuristics. They are tested on theoretical and real case benchmark instances and compared with the standard NSGA-II. Results are analysed and the efficiency of algorithms is discussed using some performance metrics.