Search results

This study aims to deal with the multi-mode resource-constrained project scheduling problem (MRCPSP) with the ability to transport resources among multiple sites, aiming to minimize the total completion time and the total cost of the project simultaneously.

To deal with the problem under consideration, a bi-objective optimization model is developed. All activities are interconnected by finish-start precedence relations, and pre-emption is not allowed. Then, the ɛ-constraint optimization method is used to solve 24 different-sized instances, ranging from 5 to 120 activities, and report the makespan, total cost and CPU time. A set of Pareto-optimal solutions are determined for some instances, and sensitivity analyses are performed to find the impact of changing parameters on objective values.

Results highlight the importance of resource transportability assumption on project completion time and cost, providing useful insights for decision makers and practitioners.

A novel bi-objective optimization model is proposed to deal with the multi-site MRCPSP, considering both the cost and time of resource transportation between multiple sites. To the best of the authors’ knowledge, none of the studies in the project scheduling area has yet addressed this problem.

The proposed model aims to consider the flying hours as a criterion to initiate maintenance operation. Based on this condition, aircraft must be checked before flying hours threshold is met. After receiving maintenance service, the model ignores previous flying hours and the aircraft can keep on flying until the threshold value is reached again. Moreover, the model considers aircraft age and efficiency to assign them to flights.

The aircraft maintenance routing problem (AMRP), as one of the most important problems in the aviation industry, determines the optimal route for each aircraft along with meeting maintenance requirements. This paper presents a bi-objective mixed-integer programming model for AMRP in which several criteria such as aircraft efficiency and ferrying flights are considered.

As the solution approaches, epsilon-constraint method and a non-dominated sorting genetic algorithm (NSGA-II), including a new initializing algorithm, are used. To verify the efficiency of NSGA-II, 31 test problems in different scales are solved using NSGA-II and GAMS. The results show that the optimality gap in NSGA-II is less than 0.06%. Finally, the model was solved based on real data of American Eagle Airlines extracted from Kaggle datasets.

The authors confirm that it is an original paper, has not been published elsewhere and is not currently under consideration of any other journal.

Although disassembly balancing lines has been studied for over two decades, there is a gap in the robotic disassembly. Moreover, combination of problem with heterogeneous employee assignment is also lacking. The hazard related with the tasks performed on disassembly lines on workers can be reduced by the use of robots or collaborative robots (cobots) instead of workers. This situation causes an increase in costs. The purpose of the study is to propose a novel version of the problem and to solve this bi-objective (minimizing cost and minimizing hazard simultaneously) problem.

The epsilon constraint method was used to solve the bi-objective model. Entropy-based Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and Preference Ranking Organization methods for Enrichment Evaluation (PROMETHEE) methods were used to support the decision-maker. In addition, a new criterion called automation rate was proposed. The effects of factors were investigated with full factor experiment design.

The effects of all factors were found statistically significant on the solution time. The combined effect of the number of tasks and number of workers was also found to be statistically significant.

In this study, for the first time in the literature, a disassembly line balancing and employee assignment model was proposed in the presence of heterogeneous workers, robots and cobots to simultaneously minimize the hazard to the worker and cost.

This study aims to minimize the cost and time of blood delivery in the whole blood supply chain network (BSCN) in disaster conditions. In other words, integrating all strategic, tactical and operational decisions of three levels of blood collection, processing and distribution leads to satisfying the demand at the right time.

This paper proposes an integrated BSCN in disaster conditions to consider four categories of facilities, including temporary blood collection centers, field hospitals, main blood processing centers and medical centers, to optimize demand response time appropriately. The proposed model applies the location of all permanent and emergency facilities in three levels: blood collection, processing and distribution. Other essential decisions, including multipurpose facilities, emergency transportation, inventory and allocation, were also used in the model. The LP metric method is applied to solve the proposed bi-objective mathematical model for the BSCN.

The findings show that this model clarifies its efficiency in the total cost and blood delivery time reduction, which results in a low carbon transmission of the blood supply chain.

The researchers proposed an integrated BSCN in disaster conditions to minimize the cost and time of blood delivery. They considered multipurpose capabilities for facilities (e.g. field hospitals are responsible for the three purposes of blood collection, processing and distribution), and so locating permanent and emergency facilities at three levels of blood collection, processing and distribution, support facilities, emergency transportation and traffic on the route with pollution were used to present a new model.

Every day, small and big incidents happen all over the world, and given the human, financial and spiritual damage they cause, proper planning should be sought to deal with them so they can be appropriately managed in times of crisis. This study aims to examine humanitarian supply chain models.

A new model is developed to pursue the necessary relations in an optimal way that will minimize human, financial and moral losses. In this developed model, in order to optimize the problem and minimize the amount of human and financial losses, the following subjects have been applied: magnitude of the areas in which an accident may occur as obtained by multiple attribute decision-making methods, the distances between relief centers, the number of available rescuers, the number of rescuers required and the risk level of each patient which is determined using previous data and machine learning (ML) algorithms.

For this purpose, a case study in the east of Tehran has been conducted. According to the results obtained from the algorithms, problem modeling and case study, the accuracy of the proposed model is evaluated very well.

Obtaining each injured person's priority using ML techniques and each area's importance or risk level, besides developing a bi-objective mathematical model and using multiple attribute decision-making methods, make this study unique among very few studies that concern ML in the humanitarian supply chain. Moreover, the findings validate the results and the model's functionality very well.

Untimely responses to emergency situations in urban areas contribute to a rising mortality rate and impact society's primary capital. The efficient dispatch and relocation of ambulances pose operational and momentary challenges, necessitating an optimal policy based on the system's real-time status. While previous studies have addressed these concerns, limited attention has been given to the optimal allocation of technicians to respond to emergency situation and minimize overall system costs.

In this paper, a bi-objective mathematical model is proposed to maximize system coverage and enable flexible movement across bases for location, dispatch and relocation of ambulances. Ambulances relocation involves two key decisions: (1) allocating ambulances to bases after completing services and (2) deciding to change the current ambulance location among existing bases to potentially improve response times to future emergencies. The model also considers the varying capabilities of technicians for proper allocation in emergency situations.

The Augmented Epsilon-Constrained (AEC) method is employed to solve the proposed model for small-sized problem. Due to the NP-Hardness of the model, the NSGA-II and MOPSO metaheuristic algorithms are utilized to obtain efficient solutions for large-sized problems. The findings demonstrate the superiority of the MOPSO algorithm.

This study can be useful for emergency medical centers and healthcare companies in providing more effective responses to emergency situations by sending technicians and ambulances.

In this study, a two-objective mathematical model is developed for ambulance location and dispatch and solved by using the AEC method as well as the NSGA-II and MOPSO metaheuristic algorithms. The mathematical model encompasses three primary types of decision-making: (1) Allocating ambulances to bases after completing their service, (2) deciding to relocate the current ambulance among existing bases to potentially enhance response times to future emergencies and (3) considering the diverse abilities of technicians for accurate allocation to emergency situations.

In many of today’s manufacturing industries, such as automobile, aerospace, defence, die and mould making, medical and electrical discharge machining (EDM) has emerged as an effective material removal process. In this process, a series of discontinuous electric discharges is used for removing material from the workpiece in the form of craters generating a replica of the tool into the workpiece in a dielectric environment. Appropriate selection of the tool electrode material and combination of input parameters is an important requirement for performance enhancement of an EDM process. This paper aims to optimize an EDM process using single-valued neutrosophic grey relational analysis using Cu-multi-walled carbon nanotube (Cu-MWCNT) composite tool electrode.

This paper proposes the application of grey relational analysis (GRA) in a single-valued neutrosophic fuzzy environment to identify the optimal parametric intermix of an EDM process while considering Cu-MWCNT composite as the tool electrode material. Based on Taguchi’s L9 orthogonal array, nine experiments are conducted at varying combinations of four EDM parameters, i.e. pulse-on time, duty factor, discharge current and gap voltage, with subsequent measurement of two responses, i.e. material removal rate (MRR) and tool wear rate (TWR). The electrodeposition process is used to fabricate the Cu-MWCNT composite tool.

It is noticed that both the responses would be simultaneously optimized at higher levels of pulse-on time (38 µs) and duty factor (8), moderate level of discharge current (5 A) and lower level of gap voltage (30 V). During bi-objective optimization (maximization of MRR and minimization of TWR) of the said EDM process, the achieved values of MRR and TWR are 243.74 mm³/min and 0.001034 g/min, respectively.

Keeping in mind the type of response under consideration, their measured values for each of the EDM experiments are expressed in terms of linguistic variables which are subsequently converted into single-valued neutrosophic numbers. Integration of GRA with single-valued neutrosophic sets would help in optimizing the said EDM process with the Cu-MWCNT composite tool while simultaneously considering truth-membership, indeterminacy membership and falsity-membership degrees in a human-centric uncertain decision-making environment.

The target of this research is to develop a mathematical model which combines the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) and the Multi-Skilled Resource-Constrained Project Scheduling Problem (MSRCPSP). Due to the importance of resource management, the proposed formulation comprises resource leveling considerations as well. The model aims to simultaneously optimize: (1) the total time to accomplish all projects and (2) the total deviation of resource consumptions from the uniform utilization levels.

The K-Means (KM) and Fuzzy C-Means (FCM) clustering methods have been separately applied to discover the clusters of activities which have the most similar resource demands. The discovered clusters are given to the scheduling process as priori knowledge. Consequently, the execution times of the activities with the most common resource requests will not overlap. The intricacy of the problem led us to incorporate the KM and FCM techniques into a meta-heuristic called the Bi-objective Symbiosis Organisms Search (BSOS) algorithm so that the real-life samples of this problem could be solved. Therefore, two clustering-based algorithms, namely, the BSOS-KM and BSOS-FCM have been developed.

Comparisons between the BSOS-KM, BSOS-FCM and the BSOS method without any clustering approach show that the clustering techniques could enhance the optimization process. Another hybrid clustering-based methodology called the NSGA-II-SPE has been added to the comparisons to evaluate the developed resource leveling framework.

The practical importance of the model and the clustering-based algorithms have been demonstrated in planning several construction projects, where multiple water supply systems are concurrently constructed.

Reviewing the literature revealed that there was a need for a hybrid formulation that embraces the characteristics of the RCMPSP and MSRCPSP with resource leveling considerations. Moreover, the application of clustering algorithms as resource leveling techniques was not studied sufficiently in the literature.

Pre-positioning and distributing relief items are important parts of disaster management as it simultaneously considers activities from both pre- and post-disaster stages. This study aims to address this problem with a novel mathematical model.

In this research, a bi-objective mixed-integer linear programming model is developed to tackle pre-positioning and distributing relief items, and it is formulated as an integrated location-allocation-routing problem with uncertain parameters. The humanitarian supply chain consists of relief facilities (RFs) and demand points (DPs). Perishable and imperishable relief commodities (RCs), different types of vehicles, different transportation modes, a time window for delivering perishable commodities and the occurrence of unmet demand are considered. A scenario-based game theory is applied for purchasing RCs from different suppliers and an integrated best-worst method-technique for order of preference by similarity to ideal solution technique is implemented to determine the importance of DPs. The proposed model is used to solve several random test problems for verification, and to validate the model, Iran’s flood in 2019 is investigated as a case study for which useful managerial insights are provided.

Managers can effectively adjust their preferences towards response time and total cost of the network and use sensitivity analysis results in their decisions.

The model locates RFs, allocates DPs to RFs in the pre-disaster stage, and determines the routing of RCs from RFs to DPs in the post-disaster stage with respect to minimizing total costs and response time of the humanitarian logistics network.

Driven by sustainable production, mobile robots are introduced as a new clean-energy material handling tool for mixed-model assembly lines (MMALs), which reduces energy consumption and lineside inventory of workstations (LSI). Nevertheless, the previous part feeding scheduling method was designed for conventional material handling tools without considering the flexible spatial layout of the robotic mobile fulfillment system (RMFS). To fill this gap, this paper focuses on a greening mobile robot part feeding scheduling problem with Just-In-Time (JIT) considerations, where the layout and number of pods can be adjusted.

A novel hybrid-load pod (HL-pod) and mobile robot are proposed to carry out part feeding tasks between material supermarkets and assembly lines. A bi-objective mixed-integer programming model is formulated to minimize both total energy consumption and LSI, aligning with environmental and sustainable JIT goals. Due to the NP-hard nature of the proposed problem, a chaotic differential evolution algorithm for multi-objective optimization based on iterated local search (CDEMIL) algorithm is presented. The effectiveness of the proposed algorithm is verified by dealing with the HL-pod-based greening part feeding scheduling problem in different problem scales and compared to two benchmark algorithms. Managerial insights analyses are conducted to implement the HL-pod strategy.

The CDEMIL algorithm's ability to produce Pareto fronts for different problem scales confirms its effectiveness and feasibility. Computational results show that the proposed algorithm outperforms the other two compared algorithms regarding solution quality and convergence speed. Additionally, the results indicate that the HL-pod performs better than adopting a single type of pod.

This study proposes an innovative solution to the scheduling problem for efficient JIT part feeding using RMFS and HL-pods in automobile MMALs. It considers both the layout and number of pods, ensuring a sustainable and environmental-friendly approach to production.