Research on priority rules for the stochastic resource constrained multi-project scheduling problem with new project arrival

The resource constrained multi-project scheduling problem (RCMPSP) is a general and classic problem, which is usually considered and solved in a deterministic environment. However, in real project management, there are always some unforeseen factors such as one or more new project arrivals that give rise to intermittent changes in the activity duration (or stochastic duration) of the current project in execution by inserting the new project. This study takes two practical factors in terms of stochastic duration of project activities and new project arrivals waiting for insertion into account of the problem space to form a stochastic resource constrained multi-project scheduling problem with new project arrivals (SRCMPSP-NPA). Based on the benchmark of the PSPLIB (Project Scheduling Problem Library), a new data set is built and 20 priority rules (PRs) are applied to solve the problem and their performances are analyzed. In addition, a heuristic hybrid method is designed for solving the problem timely by dividing the entire scheduling process into multi-state scheduling problems solved by the corresponding rules separately. This approach has been verified by experiments and its performance is better than that of a single rule in most situations

Hierarchical Multi-Project Planning and Supply Chain Management: an Integrated Framework

This work focuses on the need for new knowledge to allow hierarchical multi-project management to be conducted in the construction industry, which is characterised by high uncertainty, fragmentation, complex decisions, dynamic changes and long-distance communication. A dynamic integrated project management approach is required at strategic, tactical and operational levels in order to achieve adaptability. The work sees the multi-project planning and control problem in the context of supply chain management at main contractor companies. A portfolio manager must select and prioritise the projects, bid and negotiate with a wide range of clients, while project managers are dealing with subcontractors, suppliers, etc whose relationships and collaborations are critical to the optimisation of schedules in which time, cost and safety (etc) criteria must be achieved. Literature review and case studies were used to investigate existing approaches to hierarchical multi-project management, to identify the relationships and interactions between the parties concerned, and to investigate the possibilities for integration. A system framework was developed using a multi-agent-system architecture and utilising procedures adapted from literature to deal with short, medium and long-term planning. The framework is based on in-depth case study and integrates time-cost trade-off for project optimisation with multi-attribute utility theory to facilitate project scheduling, subcontractor selection and bid negotiation at the single project level. In addition, at the enterprise level, key performance indicator rule models are devised to align enterprise supply chain configuration (strategic decision) with bid selection and bid preparation/negotiation (tactical decision) and project supply chain selection (operational decision). Across the hierarchical framework the required quantitative and qualitative methods are integrated for project scheduling, risk assessment and subcontractor evaluation. Thus, experience sharing and knowledge management facilitate project planning across the scattered construction sites. The mathematical aspects were verified using real data from in-depth case study and a test case. The correctness, usefulness and applicability of the framework for users was assessed by creating a prototype Multi Agent System-Decision Support System (MAS-DSS) which was evaluated empirically with four case studies in national, international, large and small companies. The positive feedback from these cases indicates strong acceptance of the framework by experienced practitioners. It provides an original contribution to the literature on planning and supply chain management by integrating a practical solution for the dynamic and uncertain complex multi-project environment of the construction industry

On the project risk baseline: Integrating aleatory uncertainty into project scheduling

Producción CientíficaObtaining a viable schedule baseline that meets all project constraints is one of the main issues for project managers. The literature on this topic focuses mainly on methods to obtain schedules that meet resource restrictions and, more recently, financial limitations. The methods provide different viable schedules for the same project, and the solutions with the shortest duration are considered the best-known schedule for that project. However, no tools currently select which schedule best performs in project risk terms. To bridge this gap, this paper aims to propose a method for selecting the project schedule with the highest probability of meeting the deadline of several alternative schedules with the same duration. To do so, we propose integrating aleatory uncertainty into project scheduling by quantifying the risk of several execution alternatives for the same project. The proposed method, tested with a well-known repository for schedule benchmarking, can be applied to any project type to help managers to select the project schedules from several alternatives with the same duration, but the lowest risk

A three-phase approach for robust project scheduling: an application for R&D project scheduling

During project execution, especially in a multi-project environment unforeseen events arise that disrupt the project process resulting in deviations of project plans and budgets due to missed due dates and deadlines, resource idleness, higher work-in-process inventory and increased system nervousness. In this thesis, we consider the preemptive resource constrained multi-project scheduling problem with generalized precedence relations in a stochastic and dynamic environment and develop a three-phase model incorporating data mining and project scheduling techniques to schedule the R&D projects of a leading home appliances company in Turkey. In Phase I, models classifying the projects with respect to their resource usage deviation levels and an activity deviation assignment procedure are developed using data mining techniques. Phase II, proactive project scheduling phase, proposes two scheduling approaches using a bi-objective genetic algorithm (GA). The objectives of the bi-objective GA are the minimization of the overall completion time of projects and the minimization of the total sum of absolute deviations for starting times for possible realizations leading to solution robust baseline schedules. Phase II uses the output of the first phase to generate a set of non-dominated solutions. Phase III, called the reactive phase, revises the baseline schedule when a disruptive event occurs and enables the project managers to make “what-if analysis” and thus to generate a set of contingency plans for better preparation

Scheduling and Resource Efficiency Balancing. Discrete Species Conserving Cuckoo Search for Scheduling in an Uncertain Execution Environment

The main goal of a scheduling process is to decide when and how to execute each of the project’s activities. Despite large variety of researched scheduling problems, the majority of them can be described as generalisations of the resource-constrained project scheduling problem (RCPSP). Because of wide applicability and challenging difficulty, RCPSP has attracted vast amount of attention in the research community and great variety of heuristics have been adapted for solving it. Even though these heuristics are structurally different and operate according to diverse principles, they are designed to obtain only one solution at a time. In the recent researches on RCPSPs, it was proven that these kind of problems have complex multimodal fitness landscapes, which are characterised by a wide solution search spaces and presence of multiple local and global optima. The main goal of this thesis is twofold. Firstly, it presents a variation of the RCPSP that considers optimisation of projects in an uncertain environment where resources are modelled to adapt to their environment and, as the result of this, improve their efficiency. Secondly, modification of a novel evolutionary computation method Cuckoo Search (CS) is proposed, which has been adapted for solving combinatorial optimisation problems and modified to obtain multiple solutions. To test the proposed methodology, two sets of experiments are carried out. Firstly, the developed algorithm is applied to a real-life software development project. Secondly, the performance of the algorithm is tested on universal benchmark instances for scheduling problems which were modified to take into account specifics of the proposed optimisation model. The results of both experiments demonstrate that the proposed methodology achieves competitive level of performance and is capable of finding multiple global solutions, as well as prove its applicability in real-life projects

Analysis and Optimization of Mobile Business Processes

Mobility of workers and business processes rapidly gains the attention of businesses and business analysts. A wide variety of definitions exists for mobile business processes. This work considers a type of business processes concerned with the maintenance of distributed technical equipment as, e.g., telecommunication networks, utility networks, or professional office gear. Executing the processes in question, workers travel to the location where the equipment is situated and perform tasks there. Depending on the type of activities to be performed, the workers need certain qualifications to fulfill their duty. Especially in network maintenance processes, activities are often not isolated but depend on the parallel or subsequent execution of other activities at other locations. Like every other economic activity, the out- lined mobile processes are under permanent pressure to be executed more efficiently. Since business process reengineering (BPR) projects are the common way to achieve process improvements, business analysts need methods to model and evaluate mobile business processes. Mobile processes challenge BPR projects in two ways: (i) the process at- tributes introduced by mobility (traveling, remote synchronization, etc.) complicate process modeling, and (ii) these attributes introduce process dynamics that prevent the straightforward prediction of BPR effects. This work solves these problems by developing a modeling method for mobile processes. The method allows for simulating mobile processes considering the mobility attributes while hiding the complexity of these attributes from the business analysts modeling the processes. Simulating business processes requires to assign activites to workers, which is called scheduling. The spatial distribution of activities relates scheduling to routing problems known from the logistics domain. To provide the simula- tor with scheduling capabilities the according Mobile Workforce Scheduling Problem with Multitask-Processes (MWSP-MP) is introduced and analyzed in-depth. A set of neighborhood operators was developed to allow for the application of heuristics and meta-heuristics to the problem. Furthermore, methods for generating start solutions of the MWSP-MP are introduced. The methods introduced throughout this work were validated with real-world data from a German utility. The contributions of this work are a reference model of mobile work, a business domain independent modeling method for mobile business processes, a simulation environment for such processes, and the introduction and analysis of the Mobile Workforce Scheduling Problem with Multitask-Processes

Perturbing event logs to identify cost reduction opportunities: A genetic algorithm-based approach

Organisations are constantly seeking new ways to improve operational efficiencies. This research study investigates a novel way to identify potential efficiency gains in business operations by observing how they are carried out in the past and then exploring better ways of executing them by taking into account trade-offs between time, cost and resource utilisation. This paper demonstrates how they can be incorporated in the assessment of alternative process execution scenarios by making use of a cost environment. A genetic algorithm-based approach is proposed to explore and assess alternative process execution scenarios, where the objective function is represented by a comprehensive cost structure that captures different process dimensions. Experiments conducted with different variants of the genetic algorithm evaluate the approach's feasibility. The findings demonstrate that a genetic algorithm-based approach is able to make use of cost reduction as a way to identify improved execution scenarios in terms of reduced case durations and increased resource utilisation. The ultimate aim is to utilise cost-related insights gained from such improved scenarios to put forward recommendations for reducing process-related cost within organisations