E-Learning during COVID-19 outbreak : cloud computing adoption in Indian public universities

In the COVID-19 pandemic situation, the need to adopt cloud computing (CC) applications by education institutions, in general, and higher education (HE) institutions, in particular, has especially increased to engage students in an online mode and remotely carrying out research. The adoption of CC across various sectors, including HE, has been picking momentum in the developing countries in the last few years. In the Indian context, the CC adaptation in the HE sector (HES) remains a less thoroughly explored sector, and no comprehensive study is reported in the literature. Therefore, the aim of the present study is to overcome this research vacuum and examine the factors that impact the CC adoption (CCA) by HE institutions (HEIs) in India. The scope of the study is limited to public universities (PUs) in India. There are, in total, 465 Indian PUs and among these 304 PUs, (i.e., 65% PUs) are surveyed using questionnaire-based research. The study has put forth a novel integrated technology adoption framework consisting of the Technology Acceptance Model (TAM), Technology-Organization- Environment (TOE), and Diffusion of Innovation (DOI) in the context of the HES. This integrated TAM-TOE-DOI framework is utilized in the study to analyze eleven hypotheses concerning factors of CCA that have been tested using structural equation modelling (SEM) and confirmatory factor analysis (CFA). The findings reveal that competitive advantage (CA), technology compatibility (TC), technology readiness (TR), senior leadership support, security concerns, government support, and vendor support are the significant contributing factors of CCA by Indian PUs. The study contends that whereas the rest of the factors positively affect the PUs’ intention towards CCA, security concerns are a significant reason for the reluctance of these universities against adopting CC. The findings demonstrated the application of an integrated TAM-TOE-DOI framework to assess determining factors of CCA in Indian PUs. Further, the study has given useful insights into the successful CCA by Indian PUs, which will facilitate eLearning and remote working during COVID-19 or similar outbreak.peer-reviewe

Vehicle routing for a mid-day meal delivery distribution system

This paper considers the distribution system of a school feeding program (mid-day meals), wherein a set of delivery vehicles transfer cooked food from a kitchen facility to various schools within a specified delivery deadline. The food is required to be delivered before the lunch period, which is consistent across all the schools. A delay in food delivery can deprive students of their lunch, and, therefore, designing the vehicle routes for such distribution systems and maintaining a strict delivery deadline becomes critical. The resultant problem is identified as a vehicle routing problem with a common due date (VRPCDD). We provide a formulation for the VRPCDD and thereby focus on suggesting solution methods. In addition, we also demonstrate the practical application of VRPCDD by focusing on a real-life problem of a mid-day meal provider operating in the Chhattisgarh province of India

Multiple operation theatre scheduling for mitigating the disturbance caused by emergency patients

Scheduling emergency patients is a problem that most hospitals struggle to solve without disturbing elective surgery patients' schedules. The present work undertakes this problem and considers scheduling elective patients surgeries in multiple operation theatres to mitigate the possible disturbance caused by emergency patient arrivals. The resultant problem has been termed as multiple operation theatre problems with total expected disturbance (MOTED). The number of elective surgeries and their corresponding surgery times are known and given in advance. However, emergency patient arrivals are stochastic in nature, which is tackled through scenario-generation techniques. The model assumes that emergency case scenarios can be predicted from historical data, and determines the sequence of elective patients in a multiple operation theatre such that the sum of the total expected disturbance (TED) caused by emergency patients and the total completion time of elective surgeries is minimized. The disturbance minimization increases the satisfaction level of patients, physicians and other medical staff, and indirectly reduces the overtime costs. The work provides an optimal algorithm for the MOTED problem with a single-operation theatre. Three heuristics and two metaheuristics have been proposed to solve the complete MOTED problem. The metaheuristic involves particle swarm optimization (PSO) and ant colony optimization (ACO). An extensive numerical experiment is performed using 48 randomly generated problem instances

Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions

A Multi-Depot Green Vehicle Routing Problem (MDGVRP) is considered in this paper. In MDGVRP, Alternative Fuel-powered Vehicles (AFVs) start from different depots, serve customers, and, at the end, return to the original depots. The limited fuel tank capacity of AFVs forces them to visit Alternative Fuel Stations (AFS) for refueling. The objective is to minimize the total carbon emissions. A Two-stage Ant Colony System (TSACS) is proposed to find a feasible and acceptable solution for this NP-hard (Non-deterministic polynomial-time) optimization problem. The distinct characteristic of the proposed TSACS is the use of two distinct types of ants for two different purposes. The first type of ant is used to assign customers to depots, while the second type of ant is used to find the routes. The solution for the MDGVRP is useful and beneficial for companies that employ AFVs to deal with the various inconveniences brought by the limited number of AFSs. The numerical experiments confirm the effectiveness of the proposed algorithms in this research

The Impact of Lead Time Uncertainty on Supply Chain Performance Considering Carbon Cost

In supply chain operation practices, lead time uncertainty is a common management issue. Uncertain lead time can lead to increased inventory costs and unstable service levels, which will directly affect the overall operation performance of the supply chain. While considering environmental performance in supply chain, it is important to understand how an uncertain lead time will affect sustainable performance. In this paper, we constructed a supply chain model with stochastic lead time and explored the relationship between uncertain lead time and supply chain performance. We considered carbon cost, inventory cost, and service level as a supply chain performance. System dynamics methodology was employed to observe and explore the dynamic change trend of the overall performance in the complicated supply chain model. This was done under both different levels of lead time standard deviation and different order policies. The results demonstrate how stochastic lead times can significantly increase inventory costs and carbon costs. Therefore, we propose appropriate ordering policies which mitigate the negative impacts of stochastic lead times

Two-Agent Single Machine Order Acceptance Scheduling Problem to Maximize Net Revenue

The paper considers two-agent order acceptance scheduling problems with different scheduling criteria. Two agents have a set of jobs to be processed by a single machine. The processing time and due date of each job are known in advance. In the order accepting scheduling problem, jobs are allowed to be rejected. The objective of the problem is to maximize the net revenue while keeping the weighted number of tardy jobs for the second agent within a predetermined value. A mixed-integer linear programming (MILP) formulation is provided to obtain the optimal solution. The problem is considered as an NP-hard problem. Therefore, MILP can be used to solve small problem instances optimally. To solve the problem instances with realistic size, heuristic and metaheuristic algorithms have been proposed. A heuristic method is used to determine and secure a quick solution while the metaheuristic based on particle swarm optimization (PSO) is designed to obtain the near-optimal solution. A numerical experiment is piloted and conducted on the benchmark instances that could be obtained from the literature. The performances of the proposed algorithms are tested through numerical experiments. The proposed PSO can obtain the solution within 0.1% of the optimal solution for problem instances up to 60 jobs. The performance of the proposed PSO is found to be significantly better than the performance of the heuristic