Search results

The purpose of this study is to examine the question of whether the repatriation adjustment process varies with different combinations of duration and purpose of international assignments.

A multiple-case study within one company was conducted based on in-depth interview data.

The authors find that learning-driven international assignments are more beneficial for career growth and receive better organizational support, as assignees are able to maintain regular communication (visibility) with the home unit. On the other hand, those on demand-driven, long-duration international assignments need to have a closer connection (integration) with employees in the host unit and find it challenging to maintain high visibility in the home unit simultaneously.

The authors contribute to existing research by highlighting that demand-driven assignees on longer assignments face greater challenges upon returning home. In addition, expatriates on short-term assignments face drastically fewer challenges than expatriates on longer assignments.

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.

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.

In this study, supervision and control of the possible problems among people over a large area with a limited number of drone cameras and security staff is established.

These drones, namely unmanned aerial vehicles (UAVs) will be adaptively and automatically distributed over the crowds to control and track the communities by the proposed system. Since crowds are mobile, the design of the drone clusters will be simultaneously re-organized according to densities and distributions of people. An adaptive and dynamic distribution and routing mechanism of UAV fleets for crowds is implemented to control a specific given region. The nine popular clustering algorithms have been used and tested in the presented mechanism to gain better performance.

The nine popular clustering algorithms have been used and tested in the presented mechanism to gain better performance. An outperformed clustering performance from the aggregated model has been received when compared with a singular clustering method over five different test cases about crowds of human distributions. This study has three basic components. The first one is to divide the human crowds into clusters. The second one is to determine an optimum route of UAVs over clusters. The last one is to direct the most appropriate security personnel to the events that occurred.

This study has three basic components. The first one is to divide the human crowds into clusters. The second one is to determine an optimum route of UAVs over clusters. The last one is to direct the most appropriate security personnel to the events that occurred.

This research investigates how to optimize storage location assignment to decrease the order picking time and the waiting time of orders in the staging area of low-temperature logistics centers, with the goal of reducing food loss caused by temperature abuse.

The authors applied ABC clustering to the products in a simulated database of historical orders modeled after the actual order pattern of a large cold logistics company; then, the authors mined the association rules and calculated the sales volume correlation indices of the ordered products. Finally, the authors generated three different simulated order databases to compare order picking time and waiting time of orders in the staging area under eight different storage location assignment strategies.

All the eight proposed storage location assignment strategies significantly improve the order picking time (by up to 8%) and the waiting time of orders in the staging area (by up to 22%) compared with random placement.

The results of this research are based on a case study and simulated data, which implies that, if the best performing strategies are applied to different environments, the extent of the improvements may vary. Additionally, the authors only considered specific settings in terms of order picker routing, zoning and batching: other settings may lead to different results.

A storage location assignment strategy that adopts dispersion and takes into consideration ABC clustering and shipping frequency provides the best performance in minimizing order picker's travel distance, order picking time, and waiting time of orders in the staging area. Other strategies may be a better fit if the company's objectives differ.

Previous research on optimal storage location assignment rarely considered item association rules based on sales volume correlation. This study combines such rules with several storage planning strategies, ABC clustering, and two warehouse layouts; then, it evaluates their performance compared to the random placement, to find which one minimizes the order picking time and the order waiting time in the staging area, with a 30-min time limit to preserve the integrity of the cold chain. Order picking under these conditions was rarely studied before, because they may be irrelevant when dealing with temperature-insensitive items but become critical in cold warehouses to prevent temperature abuse.

Assembly lines are widely employed in manufacturing processes to produce final products in a flow efficiently. The simple assembly line balancing problem is a basic version of the general problem and has still attracted the attention of researchers. The type-I simple assembly line balancing problems (SALBP-I) aim to minimise the number of workstations on an assembly line by keeping the cycle time constant.

This paper focuses on solving multi-objective SALBP-I problems by utilising an artificial bee colony based-hyper heuristic (ABC-HH) algorithm. The algorithm optimises the efficiency and idleness percentage of the assembly line and concurrently minimises the number of workstations. The proposed ABC-HH algorithm is improved by adding new modifications to each phase of the artificial bee colony framework. Parameter control and calibration are also achieved using the irace method. The proposed model has undergone testing on benchmark problems, and the results obtained have been compared with state-of-the-art algorithms.

The experimental results of the computational study on the benchmark dataset unequivocally establish the superior performance of the ABC-HH algorithm across 61 problem instances, outperforming the state-of-the-art approach.

This research proposes the ABC-HH algorithm with local search to solve the SALBP-I problems more efficiently.

Disaster management and humanitarian logistics (HT) play crucial roles in large-scale events such as earthquakes, floods, hurricanes and tsunamis. Well-organized disaster response is crucial for effectively managing medical centres, staff allocation and casualty distribution during emergencies. To address this issue, this study aims to introduce a multi-objective stochastic programming model to enhance disaster preparedness and response, focusing on the critical first 72 h after earthquakes. The purpose is to optimize the allocation of resources, temporary medical centres and medical staff to save lives effectively.

This study uses stochastic programming-based dynamic modelling and a discrete-time Markov Chain to address uncertainty. The model considers potential road and hospital damage and distance limits and introduces an a-reliability level for untreated casualties. It divides the initial 72 h into four periods to capture earthquake dynamics.

Using a real case study in Istanbul’s Kartal district, the model’s effectiveness is demonstrated for earthquake scenarios. Key insights include optimal medical centre locations, required capacities, necessary medical staff and casualty allocation strategies, all vital for efficient disaster response within the critical first 72 h.

This study innovates by integrating stochastic programming and dynamic modelling to tackle post-disaster medical response. The use of a Markov Chain for uncertain health conditions and focus on the immediate aftermath of earthquakes offer practical value. By optimizing resource allocation amid uncertainties, the study contributes significantly to disaster management and HT research.

Prior literature has widely established that the design of storage locations impacts order picking task performance. The purpose of this study is to investigate the performance impact of unit loads, e.g. pallets or rolling cages, utilized by pickers to pack products after picking them from storage locations.

An empirical analysis of archival data on a manual order picking system for deep-freeze products was performed in cooperation with a German brick-and-mortar retailer. The dataset comprises N = 343,259 storage location visits from 17 order pickers. The analysis was also supported by the development and the results of a batch assignment model that takes unit load selection into account.

The analysis reveals that unit load selection affects order picking task performance. Standardized rolling cages can decrease processing time by up to 8.42% compared to standardized isolated rolling boxes used in cold retail supply chains. Potential cost savings originating from optimal batch assignment range from 1.03% to 39.29%, depending on batch characteristics.

This study contributes to the literature on factors impacting order picking task performance, considering the characteristics of unit loads where products are packed on after they have been picked from the storage locations. In addition, it provides potential task performance improvements in cold retail supply chains.

In repetitive projects, repetition offers more possibilities for activity scheduling at the sub-activity level. However, existing resource-constrained repetitive scheduling problem (RCRSP) models assume that there is only one sequence in performing the sub-activities of each activity, resulting in an inefficient resource allocation. This paper proposes a novel repetitive scheduling model for solving RCRSP with soft logic.

In this paper, a constraint programming model is developed to solve the RCRSP using soft logic, aiming at the possible relationship between parallel execution, orderly execution or partial parallel and partial orderly execution of different sub activities of the same activity in repetitive projects. The proposed model integrated crew assignment strategies and allowed continuous or fragmented execution.

When solving RCRSP, it is necessary to take soft logic into account. If managers only consider the fixed logic between sub-activities, they are likely to develop a delayed schedule. The practicality and effectiveness of the model were verified by a housing project based on eight different scenarios. The results showed that the constraint programming model outperformed its equivalent mathematical model in terms of solving speed and solution quality.

Available studies assume a fixed logic between sub-activities of the same activity in repetitive projects. However, there is no fixed construction sequence between sub-activities for some projects, e.g. hotel renovation projects. Therefore, this paper considers the soft logic relationship between sub-activities and investigates how to make the objective optimal without violating the resource availability constraint.