Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: a dynamic forward approach

Purpose: The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach: In this article, a forward approach for maximizing net present value (NPV) in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF) is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings: The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value: The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.Peer Reviewe

Genetic algorithms for satellite scheduling problems

Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA (European Space Agency) and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we present some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present computational results obtained with Genetic Algorithms using the STK simulation toolkit.Peer ReviewedPostprint (published version

Welcome to OR&S! Where students, academics and professionals come together

In this manuscript, an overview is given of the activities done at the Operations Research and Scheduling (OR&S) research group of the faculty of Economics and Business Administration of Ghent University. Unlike the book published by [1] that gives a summary of all academic and professional activities done in the field of Project Management in collaboration with the OR&S group, the focus of the current manuscript lies on academic publications and the integration of these published results in teaching activities. An overview is given of the publications from the very beginning till today, and some of the topics that have led to publications are discussed in somewhat more detail. Moreover, it is shown how the research results have been used in the classroom to actively involve students in our research activities

An Agent-Based Model of Multifunctional Agricultural Landscape Using Genetic Algorithms

Landowner characteristics influence his/her willingness to change landuse practices to provide more or less environmental benefits. However, most studies of agricultural/environmental polices identify landowners as homogenous. And, the primary cause of failure of many environmental and other polices is the lack of knowledge on how humans may respond to polices based on changes in their behavior (Stern, 1993). From socioeconomic theory and empirical research, landowners can be identified as individuals who make agricultural landuse decisions independently based on their objectives. Identifying possible classes of landowners, assessing how each would potentially respond to policy alternatives, and the resulting pattern of land uses in a watershed or a riparian corridor would be very useful to policy makers as they evaluated alternatives. Agricultural landscapes are important producers of ecosystem services. The mix of ecosystem services and commodity outputs of an agricultural landscape depends on the spatial pattern of land uses emerging from individual land use decisions. However, many empirical studies show that the production of ecosystem services from agricultural landscapes is declining. This is consistent with research conducted over the last few decades showing there is a narrow range of social circumstances under which landowners are willing to make investments in the present to achieve public benefits in the future through investing in natural capital resulting in public goods which are frequently produced as ecosystem services. In this study an agent-based model within a watershed planning context is used to analyze the tradeoffs involved in producing a number of ecosystem services and agricultural commodities given price and policy scenarios while assuming three different types of agents in terms of their goals. The agents represent landowners who have been divided into a number of different groups based on their goals and the size of their farm operations. The multi-agent-based model is developed using a heuristic search and optimization technique called genetic algorithm (GA) (Holland), which belongs to a broader class of evolutionary algorithms. GAs exhibit three properties (1) they start with a population of solution, (2) they explore the solution space through recombination and mutation and (3) they evaluate individual solutions based on their appropriate fitness value(s), for example given profit maximizing agents this would be gross margin. A GA is a heuristic stochastic search and optimization method, which works by mimicking the evolutionary principles and chromosomal processing in natural genetics. The three economic agents that are modeled are based on variations in their objective functions and constraints. This study will help in identifying the tradeoffs associated with various agents in the provision of ecosystem services and agricultural commodities. The agent model developed here will help policy and decision maker identify the various agents within the watershed and assess various policy options based on that information. The study will also help to understand the interaction and feedback between the agents and their environment associated with various policy initiatives. The results of the study indicate that the agent model correctly predicts the actual landuse landcover map by 75 percent.Multifunctional agriculture, Agent based modeling, Genetic Algorithm, Environmental Economics and Policy, Land Economics/Use,

Stochastic multi-period multi-product multi-objective Aggregate Production Planning model in multi-echelon supply chain

In this paper a multi-period multi-product multi-objective aggregate production planning (APP) model is proposed for an uncertain multi-echelon supply chain considering financial risk, customer satisfaction, and human resource training. Three conflictive objective functions and several sets of real constraints are considered concurrently in the proposed APP model. Some parameters of the proposed model are assumed to be uncertain and handled through a two-stage stochastic programming (TSSP) approach. The proposed TSSP is solved using three multi-objective solution procedures, i.e., the goal attainment technique, the modified ε-constraint method, and STEM method. The whole procedure is applied in an automotive resin and oil supply chain as a real case study wherein the efficacy and applicability of the proposed approaches are illustrated in comparison with existing experimental production planning method

An overview of recent research results and future research avenues using simulation studies in project management

This paper gives an overview of three simulation studies in dynamic project scheduling integrating baseline scheduling with risk analysis and project control. This integration is known in the literature as dynamic scheduling. An integrated project control method is presented using a project control simulation approach that combines the three topics into a single decision support system. The method makes use of Monte Carlo simulations and connects schedule risk analysis (SRA) with earned value management (EVM). A corrective action mechanism is added to the simulation model to measure the efficiency of two alternative project control methods. At the end of the paper, a summary of recent and state-of-the-art results is given, and directions for future research based on a new research study are presented

Genetic Algorithm-based Mapper to Support Multiple Concurrent Users on Wireless Testbeds

Communication and networking research introduces new protocols and standards with an increasing number of researchers relying on real experiments rather than simulations to evaluate the performance of their new protocols. A number of testbeds are currently available for this purpose and a growing number of users are requesting access to those testbeds. This motivates the need for better utilization of the testbeds by allowing concurrent experimentations. In this work, we introduce a novel mapping algorithm that aims to maximize wireless testbed utilization using frequency slicing of the spectrum resources. The mapper employs genetic algorithm to find the best combination of requests that can be served concurrently, after getting all possible mappings of each request via an induced sub-graph isomorphism stage. The proposed mapper is tested on grid testbeds and randomly generated topologies. The solution of our mapper is compared to the optimal one, obtained through a brute-force search, and was able to serve the same number of requests in 82.96% of testing scenarios. Furthermore, we show the effect of the careful design of testbed topology on enhancing the testbed utilization by applying our mapper on a carefully positioned 8-nodes testbed. In addition, our proposed approach for testbed slicing and requests mapping has shown an improved performance in terms of total served requests, about five folds, compared to the simple allocation policy with no slicing.Comment: IEEE Wireless Communications and Networking Conference (WCNC) 201