Search results

This paper aims to develop an algorithm to study the impact of dynamic resource disruption on project makespan and provide a suitable resource disruption ratio for various complex industrial and emergency projects.

This paper addresses the RCPSP in dynamic environments, which assumes resources will be disrupted randomly, that is, the information about resource disruption is not known in advance. To this end, a reactive scheduling model is proposed for the case of random dynamic disruptions of resources. To solve the reactive scheduling model, a hybrid genetic algorithm with a variable neighborhood search is proposed.

The results obtained on the PSLIB instances prove the performance advantage of the algorithm; through sensitivity analysis, it can be obtained, the project makespan increases exponentially as the number of disruptions increase. Furthermore, if more than 50% of the project's resources are randomly disrupted, the project makespan will be significantly impacted.

The paper focuses on the impact of dynamic resource disruptions on project makespan. Few studies have considered stochastic, dynamic resource uncertainty. In addition, this research proposes a reasonable scheduling algorithm for the research problem, and the conclusions drawn from the research provide decision support for project managers.

Project scheduling plays an essential role in the implementation of a project due to the limitation of resources in practical projects. However, the existing research tend to focus on finding suitable algorithms to solve various scheduling problems and fail to find the potential scheduling rules in these optimal or near-optimal solutions, that is, the possible intrinsic relationships between attributes related to the scheduling of activity sequences. Data mining (DM) is used to analyze and interpret data to obtain valuable information stored in large-scale data. The goal of this paper is to use DM to discover scheduling concepts and obtain a set of rules that approximate effective solutions to resource-constrained project scheduling problems. These rules do not require any search and simulation, which have extremely low time complexity and support real-time decision-making to improve planning/scheduling.

The resource-constrained project scheduling problem can be described as scheduling a group of interrelated activities to optimize the project completion time and other objectives while satisfying the activity priority relationship and resource constraints. This paper proposes a new approach to solve the resource-constrained project scheduling problem by combining DM technology and the genetic algorithm (GA). More specifically, the GA is used to generate various optimal project scheduling schemes, after that C4.5 decision tree (DT) is adopted to obtain valuable knowledge from these schemes for further predicting and solving new scheduling problems.

In this study, the authors use GA and DM technology to analyze and extract knowledge from a large number of scheduling schemes, and determine the scheduling rule set to minimize the completion time. In order to verify the application effect of the proposed DT classification model, the J30, J60 and J120 datasets in PSPLIB are used to test the validity of the scheduling rules. The results show that DT can readily duplicate the excellent performance of GA for scheduling problems of different scales. In addition, the DT prediction model developed in this study is applied to a high-rise residential project consisting of 117 activities. The results show that compared with the completion time obtained by GA, the DT model can realize rapid adjustment of project scheduling problem to deal with the dynamic environment interference. In a word, the data-based approach is feasible, practical and effective. It not only captures the knowledge contained in the known optimal scheduling schemes, but also helps to provide a flexible scheduling decision-making approach for project implementation.

This paper proposes a novel knowledge-based project scheduling approach. In previous studies, intelligent optimization algorithm is often used to solve the project scheduling problem. However, although these intelligent optimization algorithms can generate a set of effective solutions for problem instances, they are unable to explain the process of decision-making, nor can they identify the characteristics of good scheduling decisions generated by the optimization process. Moreover, their calculation is slow and complex, which is not suitable for planning and scheduling complex projects. In this study, the set of effective solutions of problem instances is taken as the training dataset of DM algorithm, and the extracted scheduling rules can provide the prediction and solution of new scheduling problems. The proposed method focuses on identifying the key parameters of a specific dynamic scheduling environment, which can not only reproduces the scheduling performance of the original algorithm well, but also has the ability to make decisions quickly under the dynamic interference construction scenario. It is helpful for project managers to implement quick decisions in response to construction emergencies, which is of great practical significance for improving the flexibility and efficiency of construction projects.

Influenced by the constantly changing manufacturing environment, no single dispatching rule (SDR) can consistently obtain better scheduling results than other rules for the dynamic job-shop scheduling problem (DJSP). Although the dynamic SDR selection classifier (DSSC) mined by traditional data-mining-based scheduling method has shown some improvement in comparison to an SDR, the enhancement is not significant since the rule selected by DSSC is still an SDR.

This paper presents a novel data-mining-based scheduling method for the DJSP with machine failure aiming at minimizing the makespan. Firstly, a scheduling priority relation model (SPRM) is constructed to determine the appropriate priority relation between two operations based on the production system state and the difference between their priority values calculated using multiple SDRs. Subsequently, a training sample acquisition mechanism based on the optimal scheduling schemes is proposed to acquire training samples for the SPRM. Furthermore, feature selection and machine learning are conducted using the genetic algorithm and extreme learning machine to mine the SPRM.

Results from numerical experiments demonstrate that the SPRM, mined by the proposed method, not only achieves better scheduling results in most manufacturing environments but also maintains a higher level of stability in diverse manufacturing environments than an SDR and the DSSC.

This paper constructs a SPRM and mines it based on data mining technologies to obtain better results than an SDR and the DSSC in various manufacturing environments.

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.

Integrating the Chat Generative Pre-Trained Transformer-type (ChatGPT-type) model with government services has great development prospects. Applying this model improves service efficiency but has certain risks, thus having a dual impact on the public. For a responsible and democratic government, it is necessary to fully understand the factors influencing public acceptance and their causal relationships to truly encourage the public to accept and use government ChatGPT-type services.

This study used the Latent Dirichlet allocation (LDA) model to analyze comment texts and summarize 15 factors that affect public acceptance. Multiple-related matrices were established using the grey decision-making trial and evaluation laboratory (grey-DEMATEL) method to reveal causal relationships among factors. From the two opposite extraction rules of result priority and cause priority, the authors obtained an antagonistic topological model with comprehensive influence values using the total adversarial interpretive structure model (TAISM).

Fifteen factors were categorized in terms of cause and effect, and the antagonistic topological model with comprehensive influence values was also analyzed. The analysis showed that perceived risk, trust and meeting demand were the three most critical factors of public acceptance. Meanwhile, perceived risk and trust directly affected public acceptance and were affected by other factors. Supervision and accountability had the highest driving power and acted as the causal factor to influence other factors.

This study identified the factors affecting public acceptance of integrating the ChatGPT-type model with government services. It analyzed the relationship between the factors to provide a reference for decision-makers. This study introduced TAISM to form the LDA-grey-DEMATEL-TAISM method to provide an analytical paradigm for studying similar influencing factors.

A variety of buffer allocation methods exist to distribute an aggregated time buffer among project activities. However, these methods do not pay simultaneous attention to two key attributes of disruptive events that may occur during the construction phase: probability and impact. This paper fills this research gap by developing a buffer allocation method that takes into account the synergistic impact of these two attributes on project activities.

This paper develops a three-step method, calculating the probability that project activities are disrupted in the first step, followed by measuring the potential impact of disruption on project activities, and then proposing a risk-informed buffer allocation index by simultaneously integrating probability and impact outputs from the first two steps.

The proposed method provides more accurate results by sidestepping the shortcomings of conventional fuzzy-based and simulation-based methods that are purely based on expert judgments or historical precedence. Further, the paper provides decision-makers with a buffer allocation method that helps in developing cost-effective buffering and backup strategies by prioritizing project activities and their required resources.

This paper develops a risk-informed buffer allocation method that differs from those already available. The simultaneous pursuit of the probability and impact of disruptions distinguishes our method from conventional buffer allocation methods. Further, this paper intertwines the research domains of complexity science and construction management by performing centrality analysis and incorporating a key attribute of project complexity (i.e. the interconnectedness between project activities) into the process for buffer allocation.

This paper proposed an adaptation of the theory of planned behavior (TPB) model to study the factors influencing organic food purchase behavior in an emerging market. This research introduced household norms as an important factor that reflected the influence of household activities and family pressure on individuals to perform organic food purchase behaviors. The role of trust in organic food as a direct and a moderating factor was examined in the proposed framework as well.

The study proposed a model with 10 hypotheses from the literature review. The hypotheses were tested using data collected from 407 organic food customers in Hanoi, Vietnam. The partial least squares structural equation modeling (PLS-SEM) approach was used for analysis.

The results indicated that household norms played an important role influencing purchase intention and behavior. This research also showed that trust in organic food directly affected purchase intention and played a moderating role on the attitude towards organic food and purchase intention relationship. However, trust in organic food did not show moderating effects on other relationships in the model.

More context-specific reasons may be incorporated into the research model to better explain consumer purchase behaviors.

The role of household norms and its impact under TPB has not been investigated for organic food purchase behaviors, particularly in emerging markets.

Omnichannel sales have provided new impetus for the development of catering merchants. The authors thus focus on how catering merchants should manage capacities at the ordering, production and delivery stages to meet customers’ needs in different channels under third-party platform delivery and merchant self-delivery. This is of great significance for the development of the omnichannel catering industry.

This paper formulates the capacity decisions of omnichannel catering merchants under the third-party platform delivery and merchant self-delivery mode. The authors mainly use queuing theory to analyze the queuing behavior of online and offline customers, and the impact of waiting time on customer shopping behavior. In addition, the authors also characterize the merchant’s capacity by the rate in queuing model.

The authors find that capacities at ordering stage and food production stage are composed of base capacities and safety capacities, but the delivery capacities only have the latter. And in the self-delivery mode, merchants can develop higher safety capacities by charging delivery fees. The authors prove that regardless of the delivery mode, omnichannel sales can bring higher profits to merchants by integrating demand.

The authors focus on analyzing the capacity management of omnichannel catering merchants at the ordering, production and delivery stages. And the authors also add the delivery process into the omnichannel for analysis, so as to solve the problem of capacity decision-making under different delivery modes. The management of delivery capacity and its impact on other stages’ capacities are not covered in other literature studies, which is one of the main innovations of this paper.

The rapid, yet low-profit, expansion of the production capacity of state-owned enterprises (SOEs) represents a remarkable phenomenon. However, the motivation behind this key operational decision remains underexplored, especially concerning the prioritization of sociopolitical and financial goals in operations management. Drawing on the multiple-goal model in the behavioral theory of the firm (BTOF), the authors' study aims to examine how SOE capacity expansion is driven by performance feedback regarding the sociopolitical goal of employment provision and how SOEs differently prioritize sociopolitical and financial goals based on negative versus positive feedback on the sociopolitical goal.

The authors' study uses panel data on 826 Chinese SOEs in manufacturing industries from 2011 to 2019. The authors employ the fixed-effects model with Driscoll–Kraay standard errors, which are robust to heteroscedasticity, autocorrelation and cross-sectional dependence.

The authors find that SOEs increase capacity expansion as sociopolitical feedback becomes more negative, but they may not increase capacity expansion in response to positive sociopolitical feedback. Moreover, negative profitability feedback strengthens SOEs' capacity expansion in response to negative sociopolitical feedback. In contrast, negative profitability feedback weakens their response to positive sociopolitical feedback.

The authors' study offers a novel behavioral explanation of SOEs' operational decisions regarding capacity expansion. While the literature has traditionally assumed multiple goals as either hierarchical or compatible, the authors extend the BTOF's multiple-goal model to illuminate when firms pursue sociopolitical and financial goals as compatible (i.e. the activation rule) versus hierarchical (i.e. the sequential rule), thereby reconciling their tension in distinct performance situations. Practically, the authors provide fine-grained insights into how operations managers can prioritize multiple goals when making operational decisions. The authors' study also shows how policymakers can influence SOE operations to pursue sociopolitical goals for public benefit.

This study aims to analyze notable distribution dispute cases from Islamic law history. The authors will assess these alongside resolutions proposed by historical authorities, some of which evolved into established Islamic case law. In addition, the authors intend to apply classic fair division rules to these cases, providing alternative solutions. Using a game-theoretical approach, the authors plan to compare Islamic solutions with traditional division rules through axiomatic analysis. The goal of this study is to systematically explore the unique principles underpinning Islamic distributions.

In this study, the authors collate Islamic inheritance law disputes involving conflicting claims, unresolvable by primary Islamic law sources, from historical and modern texts. The authors formally model these as claims problems, surplus-sharing problems and adapted claims problems. Concurrently, the authors gather the proposed solutions and historical backgrounds offered by the era’s authorities and jurists. These solutions are axiomatically generalized into rules, while the axioms characterizing distribution rules are checked if they are aligned with Islamic norms and values. This approach facilitates a comparison between Islamic distributions and classic division rules.

The 'Awl and Radd doctrines, used in Islamic inheritance law, are axiomatically equivalent to the Proportional Rule, a prevalent non-Jewish division rule. These doctrines present solutions impervious to manipulation by legal heirs through rights transfer, unlike other possible distributions. Ibn 'Abbas' solution for Awliyya cases uses sequential priorities and diverges uniquely from classic fair division rules in the literature. In addition, it is established that Abu Yusuf's (b. 729) distribution for a legal dispute is axiomatically identical to Abraham ibn Ezra's (b. 1089) division rule.

There is a noticeable dearth of comprehensive studies investigating contentious disputes concerning resource claims within Islamic law. Many of these studies are lacking in-depth analyses of diverse cases, casting doubts on their reliability. As a result, a robust focus is needed on case collection prior to any analytical process. Future research should concentrate on collating instances of fair division problems throughout Islamic history, as well as separately collecting methods of Islamic sharing. This procedure may lead to the characterization of various Islamic regulations, thereby emphasizing distinct Islamic principles. In forthcoming studies, conducting an exhaustive axiomatic evaluation of the cases and proposed resolutions is imperative.

This research illuminates existing knowledge gaps, setting a course for novel research trajectories. It underlines the fair division literature’s oversight of disputes within Islamic law, despite the plentiful existence of contentious cases. The research underscores the relevance of cooperative game theory as a tool for dissecting Islamic legal disputes. By accounting for unique Islamic norms and principles, this study lays a foundation for a nuanced comprehension of the dynamics and outcomes of legal disputes. By integrating an interdisciplinary approach, this research strives to bridge the gap between game theory and Islamic law.

Beyond addressing a significant research lacuna, this study carries extensive societal implications. By shedding light on enduring debates within Islamic law, it encourages a rejuvenated understanding of the evolution and interpretation of legal disputes. The axiomatic disparities between rulers’ and jurists’ methods provide invaluable insights within the Islamic context, bolstering the understanding of sociocultural dynamics that influence legal decision-making. This research has the potential to shape legal discourse, guide policymaking and spur scholarly, juristic and societal dialogue. Consequently, it may foster a more comprehensive and enlightened approach toward the resolution of legal disputes in Islamic law.

To the best of the authors’ knowledge, this study is the first to examine Islamic law’s historical legal disputes from a game-theoretical standpoint. Existing studies rarely collect distribution disputes systematically, and none scrutinize the axiomatic rationales underlying authorities’ and jurists’ distributions, opting instead to focus on historical backgrounds. While the fair division literature extensively examines disputes, it often overlooks those originating from Islamic law, which presents a rich source of disputes that can be modeled as fair division problems. This research makes a distinct contribution by incorporating disputes from Islamic law into the existing body of cooperative game theory literature.