Search results

Project managers bear the responsibility of selecting and developing resource scheduling methods that align with project requirements and organizational circumstances. This study focuses on resource-constrained project scheduling in multi-project environments. The research simplifies the problem by adopting a single-project perspective using gain coefficients.

It employs uncertainty theory and multi-objective programming to construct a model. The optimal solution is identified using Matlab, while LINGO determines satisfactory alternatives. By combining these methods and considering actual construction project situations, a compromise solution closely approximating the optimal one is derived.

The study provides fresh insights into modeling and resolving resource-constrained project scheduling issues, supported by real-world examples that effectively illustrate its practical significance.

The research highlights three main contributions: effective resource utilization, project prioritization and conflict management, and addressing uncertainty. It offers decision support for project managers to balance resource allocation, resolve conflicts, and adapt to changing project demands.

In the era of artificial intelligence (AI), algorithms have gained unprecedented importance. Scientific studies have shown that algorithms are frequently mentioned in papers, making mention frequency a classical indicator of their popularity and influence. However, contemporary methods for evaluating influence tend to focus solely on individual algorithms, disregarding the collective impact resulting from the interconnectedness of these algorithms, which can provide a new way to reveal their roles and importance within algorithm clusters. This paper aims to build the co-occurrence network of algorithms in the natural language processing field based on the full-text content of academic papers and analyze the academic influence of algorithms in the group based on the features of the network.

We use deep learning models to extract algorithm entities from articles and construct the whole, cumulative and annual co-occurrence networks. We first analyze the characteristics of algorithm networks and then use various centrality metrics to obtain the score and ranking of group influence for each algorithm in the whole domain and each year. Finally, we analyze the influence evolution of different representative algorithms.

The results indicate that algorithm networks also have the characteristics of complex networks, with tight connections between nodes developing over approximately four decades. For different algorithms, algorithms that are classic, high-performing and appear at the junctions of different eras can possess high popularity, control, central position and balanced influence in the network. As an algorithm gradually diminishes its sway within the group, it typically loses its core position first, followed by a dwindling association with other algorithms.

To the best of the authors’ knowledge, this paper is the first large-scale analysis of algorithm networks. The extensive temporal coverage, spanning over four decades of academic publications, ensures the depth and integrity of the network. Our results serve as a cornerstone for constructing multifaceted networks interlinking algorithms, scholars and tasks, facilitating future exploration of their scientific roles and semantic relations.

This study develops a model and algorithm to solve the decentralized resource-constrained multi-project scheduling problem (DRCMPSP) and provides a suitable priority rule (PR) for coordinating global resource conflicts among multiple projects.

This study addresses the DRCMPSP, which respects the information privacy requirements of project agents; that is, there is no single manager centrally in charge of generating multi-project scheduling. Accordingly, a three-stage model was proposed for the decentralized management of multiple projects. To solve this model, a three-stage solution approach with a repeated negotiation mechanism was proposed.

The experimental results obtained using the Multi-Project Scheduling Problem LIBrary confirm that our approach outperforms existing methods, regardless of the average utilization factor (AUF). Comparative analysis revealed that delaying activities in the lower project makespan produces a lower average project delay. Furthermore, the new PR LMS performed better in problem subsets with AUF < 1 and large-scale subsets with AUF > 1.

A solution approach with a repeated-negotiation mechanism suitable for the DRCMPSP and a new PR for coordinating global resource allocation are proposed.

The optimal payment in the whole operation and maintenance period of water environment treatment PPP projects has become the main approach to realize sustainable development of projects. This study is aimed at constructing an effective payment model for the whole life period of projects to achieve win-win among all stakeholders, so as to provide a theoretical reference and managerial implications for the public sector in the whole operation and maintenance period.

In the whole operation and maintenance period of water environment treatment PPP projects, this article investigates how the public sector optimizes the payment in the whole operation and maintenance period of projects. Firstly, the projects' whole operation and maintenance period is divided into several stages according to the performance appraisal period. And then, the multi-stage dynamic programming model is constructed to design the payment construct model for the public sector in each performance appraisal stage. The payment from the public sector is the decision variable, and the deduction from the private sector is a random variable.

The optimal payment model showed that the relatively less objective weight of public sector leaded to its relatively more total payment and vice versa. Therefore, the sustainable development of the projects can only be ensured when the objective weights both of them should be balanced. Additionally, the deduction from the performance appraisal of private sector plays an important role in the model construction. The larger deduction the private sector undertakes, the smaller profits private sector has. Since the deduction at each stage is a random variable, the deduction varies with the different probability distributions obeyed by the practical deduction in each stage.

The findings from this study have provided theoretical and application references, and some managerial implications are also given. First, the improvement of the pricing system of public sector should be accelerated. Second, the reasonable profit of the private sector must be guaranteed. While pursuing the maximization of social benefits, the public sector should make full use of the price sharing mechanism in the market and supervise the real income situation of the private sector. Third is increasing the public to participate in pricing. Additionally, it is a limitation that the deduction is assumed to conform to a uniform distribution in this study. Other probability distributions on deduction can be essentially further sought, so as to be more line with the actual situation of the projects.

The optimal payment in whole operation and maintenance period of the projects has become an important issue, which is a key to project success. This study constructs a multi-stage dynamic programming model to optimize payment in the whole period of projects. Additionally, this study adds its value through deeply developing the new theories of optimal payment to more suitable for the practical problems, so that to optimize the design of payment mechanism. Meanwhile, a valuable reference for public and private sectors is provided to ensure the sustainable development of the projects.

This study aims to study the thermal identification issue by harvesting both solar energy and atmospheric thermal updraft for a solar-powered unmanned aerial vehicle (SUAV) and its electric energy performance under continuous soaring conditions.

The authors develop a specific dynamic model for SUAVs in both soaring and cruise modes. The support vector machine regression (SVMR) is adopted to estimate the thermal position, and it is combined with feedback control to implement the SUAV soaring in the updraft. Then, the optimal path model is built based on the graph theory considering the existence of several thermals distributed in the environment. The procedure is proposed to estimate the electricity cost of SUAV during flight as well as soaring, and making use of dynamic programming to maximize electric energy.

The simulation results present the integrated control method could allow SUAV to soar with the updraft. In addition, the proposed approach allows the SUAV to fly to the destination using distributed thermals while reducing the electric energy use.

Two simplified dynamic models are constructed for simulation considering there are different flight mode. Besides, the data-driven-based SVMR method is proposed to support SUAV soaring. Furthermore, instead of using length, the energy cost coefficient in optimization problem is set as electric power, which is more suitable for SUAV because its advantage is to transfer the three-dimensional path planning problem into the two-dimensional.

This study aims to investigate the dynamic capabilities of Indonesia’s local government internal auditors (LGIAs). LGIAs are the functional civil apparatus that is responsible for the main task of auditing local governments at the provincial, regency and municipal levels. Meanwhile, the LGIAs are also a spearhead in identifying and analysing errors, irregularities and fraudulent actions in the finance and development of local government.

The exploratory case study methodology was used, gathering insights from 18 individuals through interviews. In addition, the authors use a critical perspective of the LGIAs’ behaviours in enhancing their capabilities in compliance with the regulations. Moreover, the authors discuss the low motivation of LGIAs in terms of achievement in knowledge acquisition, a mechanistic curriculum creating a climate of low spirit, mental models in rooted ordinariness and behavioural anxiety in hierarchical systems of expertise.

This paper infers that the LGIAs reflect inertia in terms of capabilities because its curriculum, environment and organisation have pervasively changed the culture of the work environment. Consequently, although immorally convenient and practical, the LGIAs work with professional discipline and expedient behaviours. In addition, the LGIAs behave performativity, presenting task performances with undynamic capabilities. Lastly, these behaviours imply the need to enhance the LGIAs’ dynamic capabilities by structuring local governments’ adaptive environment. Hence, this adaptive environment, in turn, could facilitate LGIAs’ further being in high spirits in enhancing knowledge-based expertise.

This study firstly implies that the research findings indicate the need for environmental-, organisational- and curriculum-made transformations to change the capabilities and competencies of LGIAs in the future, facilitating them to increase assimilation-learning abilities. Furthermore, the research shows that mental models dominate LGIAs, resulting in low spirits and reluctance to develop their dynamic capabilities. The paper recommends creating a work culture where anxiety is not dominant and changing the flexibility of the professional structure for LGIAs so that they can be promoted from functional to structural officers.

LGIAs work in a cultural environment that is always structured to fulfil what the regulations require. So, this study’s first novelty is that it underlines the ordinary job practices of LGIAs and the low incentives to enhance their dynamic capabilities. Secondly, it is highlighted that the institution’s auspices do not facilitate LGIAs to advance their dynamic capabilities because of the static competency-based development curriculum. Thirdly, the research shows that the LGIAs are a civil apparatus whose employment system in Indonesia implies a no-dismissal culture and halo effect in measuring performance.

The study aims to optimize truck routes by minimizing social and economic costs. It introduces a strategy involving diverse drones and their potential for reusing at DNs based on flight range. In HTDRP-DC, trucks can select and transport various drones to LDs to reduce deprivation time. This study estimates the nonlinear deprivation cost function using a linear two-piece-wise function, leading to MILP formulations. A heuristic-based Benders Decomposition approach is implemented to address medium and large instances. Valid inequalities and a heuristic method enhance convergence boundaries, ensuring an efficient solution methodology.

Research has yet to address critical factors in disaster logistics: minimizing the social and economic costs simultaneously and using drones in relief distribution; deprivation as a social cost measures the human suffering from a shortage of relief supplies. The proposed hybrid truck-drone routing problem minimizing deprivation cost (HTDRP-DC) involves distributing relief supplies to dispersed demand nodes with undamaged (LDs) or damaged (DNs) access roads, utilizing multiple trucks and diverse drones. A Benders Decomposition approach is enhanced by accelerating techniques.

Incorporating deprivation and economic costs results in selecting optimal routes, effectively reducing the time required to assist affected areas. Additionally, employing various drone types and their reuse in damaged nodes reduces deprivation time and associated deprivation costs. The study employs valid inequalities and the heuristic method to solve the master problem, substantially reducing computational time and iterations compared to GAMS and classical Benders Decomposition Algorithm. The proposed heuristic-based Benders Decomposition approach is applied to a disaster in Tehran, demonstrating efficient solutions for the HTDRP-DC regarding computational time and convergence rate.

Current research introduces an HTDRP-DC problem that addresses minimizing deprivation costs considering the vehicle’s arrival time as the deprivation time, offering a unique solution to optimize route selection in relief distribution. Furthermore, integrating heuristic methods and valid inequalities into the Benders Decomposition approach enhances its effectiveness in solving complex routing challenges in disaster scenarios.

In the reduction of food waste and the provision of food to the hungry, food banks play critical roles. However, as they are generally run by charitable organisations that are chronically short of human and other resources, their inbound logistics efforts commonly experience difficulties in two key areas: 1) how to organise stocks of donated food, and 2) how to assess the donated items quality and fitness for purpose. To address both these problems, the authors aimed to develop a novel artificial intelligence (AI)-based approach to food quality and warehousing management in food banks.

For diagnosing the quality of donated food items, the authors designed a convolutional neural network (CNN); and to ascertain how best to arrange such items within food banks' available space, reinforcement learning was used.

Testing of the proposed innovative CNN demonstrated its ability to provide consistent, accurate assessments of the quality of five species of donated fruit. The reinforcement-learning approach, as well as being capable of devising effective storage schemes for donated food, required fewer computational resources that some other approaches that have been proposed.

Viewed through the lens of expectation-confirmation theory, which the authors found useful as a framework for research of this kind, the proposed AI-based inbound-logistics techniques exceeded normal expectations and achieved positive disconfirmation.

As well as enabling machines to learn how inbound logistics are handed by human operators, this pioneering study showed that such machines could achieve excellent performance: i.e., that the consistency provided by AI operations could in future dramatically enhance such logistics' quality, in the specific case of food banks.

This paper’s AI-based inbound-logistics approach differs considerably from others, and was found able to effectively manage both food-quality assessments and food-storage decisions more rapidly than its counterparts.

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.

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.