Search results

The purpose of this paper is to combine the interval grey number algorithm with a project scheduling model, so as to solve the interval grey number based project scheduling problem.

According to the grey system theory, if we could not clearly collect the right value of an activity while obtaining the upper and lower boundaries of the activity duration time, we can find activity duration time as interval grey number. This paper tries to combine interval grey number with project scheduling problem. The general definition of interval grey number was given. And then the linear operations of independent interval grey number and non-independent interval grey number were further defined. Interval grey number based project scheduling model and its algorithm were further proposed. Finally, a numerical case was adopted to test the effectiveness of the proposed method.

The results show that grey project scheduling and grey critical path method could be established under interval grey number measured activities.

Scheduling problem was widely used in project planning and control. This manuscript attempted to combine interval grey number with project scheduling so as to explain the flexible deadline in a special project. It is truly in accordance with the requirements for real applications.

This paper proposed linear operations of independent and non-independent interval grey numbers, and proposed a interval grey number based project scheduling model. Valuable contribution is to combine interval grey numbers with project scheduling and it is meaningful to make a useful strategy in a flexible condition of project scheduling.

The implementation and control processes of project planning and scheduling involve a wide range of methods and tools. Despite the development and modification and integration of the project management theory with newer scheduling approaches in particular, practitioners’ views on the efficiency and effectiveness of these methods and tools differ. This situation can be attributed in part to a lack of understanding of the most appropriate basis for implementing these methods and tools. This study, therefore, aims to overcome this deficiency by conceptualizing and adopting a taxonomy of planning and scheduling methods.

The study is based on a review and discourse analysis of the literature covering a large number of theoretical and empirical studies. The underlying theories of various planning and scheduling methods were analyzed with respect to the taxonomy criteria adopted in the study.

Using the taxonomy, the key characteristics of planning and scheduling methods considered in this study were identified and interpreted. These included concepts and theories; key features; suitability and usability; and benefits and limitations. Overall, the findings suggest that project managers should consider taxonomy as a support tool for selecting and prioritizing the most appropriate method or combination of methods for managing their projects. Recommendations include the need for more advanced or multi-dimensional taxonomies to cope with the diversity of project type and size.

The results of the study allow project managers to improve their current practices by utilizing taxonomy when considering the implementation of planning and scheduling methods. Moreover, taxonomy can be considered as a tool to promote learning on the part of those less experienced in planning and scheduling. Taxonomy can be considered as an initial platform for further research in this area.

A survey of project scheduling problems since 1973 limited to work done specifically in the project scheduling area (although several techniques developed for assembly line balancing and job‐shop scheduling can be applicable to project scheduling): the survey includes the work done on fundamental problems such as the resource‐constrained project scheduling problem (RCPSP); time/cost trade‐off problem (TCTP); and payment scheduling problem (PSP). Also discusses some recent research that integrates RCPSP with either TCTP or PSP, and PSP with TCTP. In spite of their practical relevance, very little work has been done on these combined problems to date. The future of the project scheduling literature appears to be developing in the direction of combining the fundamental problems and developing efficient exact and heuristic methods for the resulting problems.

Project scheduling/rescheduling occurs in all stages of projects, from feasibility stage to monitoring stage to completion. Since the late 1950s, network‐based techniques CPM (critical path method) and PERT (programme evaluation review technique) are the techniques commonly used for project management. However, there are limitations in working with these tools that need to be overcome. Also, the computing ef. ciency of classic CPM/PERT analysis needs to be enhanced. Substantial research has been carried out globally in this field covering all areas of project scheduling: time scheduling, resource scheduling, cost scheduling, modern project management techniques, advanced mathematical models used for construction scheduling, and so on. To understand and document this research status, the authors have carried out an extensive study of various journals, published and unpublished research papers, and present this literature review.

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.

Dynamic planning and scheduling forms a widely adopted smart strategy for solving real-world problems in diverse business systems. This paper uses deductive content analysis to explore secondary data from previous studies in dynamic planning and scheduling to draw conclusions on its current status, forward action and research needs in construction management.

The authors searched academic databases using planning and scheduling keywords without a periodic setting. This research collected secondary data from the database to draw an objective comparison of categories and conclusions about how the data relates to planning and scheduling to avoid the subjective responses from questionnaires and interviews. Then, applying inclusion and exclusion criteria, we selected one hundred and four articles. Finally, the study used a seven-step deductive content analysis to develop the categorisation matrix and sub-themes for describing the dynamic planning and scheduling categories. The authors used deductive analysis because of the secondary data and categories comparison. Using the event types represented in a quadrant mapping, authors delve into where, when, application and benefits of the classes.

The content analysis showed that all the accounts and descriptions of dynamic planning and scheduling are identifiable in an extensive research database. The content analysis reveals the need for multi-hybrid (4D BIM-Agent based-discrete event-discrete rate-system dynamics) simulation modelling and optimisation method for proffering solutions to scheduling and planning problems, its current status, tools and obstacles.

This research reveals the deductive content analysis talent in construction research. It also draws direction, focuses and raises a question on dynamic planning and scheduling research concerning the five-integrated model, an opportunity for their integration, models combined attributes and insight into its solution viability in construction.

Historically, scheduling of production activities has been one of the most important management problems. Scheduling involves the planning and the co‐ordination of the various activities to achieve the optimum utilisation of resources over a given time period. Production scheduling differs with the typology of the production systems. Various production systems that are encountered in practice are: continuous production, mass production, batch production, job shop production and projects. In this article, we attempt only to discuss the project scheduling problems.

Since the early 1960s, there have been different techniques to schedule linear projects, but for the most part, these have been overshadowed by the critical path method (CPM). Recently, there has been renewed interest in linear scheduling and in adapting some of the CPM techniques to linear scheduling. This necessitates a review of the research in the area of linear scheduling. The present paper provides an overview of linear scheduling, discusses the different approaches that have been used and expresses new avenues for research in the area of resource levelling of linear schedules.