Download or read book An Improved Algorithm for the Exchange Heuristic for Solving Multi project Multi resource Constrained Scheduling with Variable intensity Activities written by Jaegun Yoo and published by . This book was released on 1992 with total page 240 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Resource Constrained Project Scheduling written by Christian Artigues and published by John Wiley & Sons. This book was released on 2013-03-01 with total page 235 pages. Available in PDF, EPUB and Kindle. Book excerpt: This title presents a large variety of models and algorithms dedicated to the resource-constrained project scheduling problem (RCPSP), which aims at scheduling at minimal duration a set of activities subject to precedence constraints and limited resource availabilities. In the first part, the standard variant of RCPSP is presented and analyzed as a combinatorial optimization problem. Constraint programming and integer linear programming formulations are given. Relaxations based on these formulations and also on related scheduling problems are presented. Exact methods and heuristics are surveyed. Computational experiments, aiming at providing an empirical insight on the difficulty of the problem, are provided. The second part of the book focuses on several other variants of the RCPSP and on their solution methods. Each variant takes account of real-life characteristics which are not considered in the standard version, such as possible interruptions of activities, production and consumption of resources, cost-based approaches and uncertainty considerations. The last part presents industrial case studies where the RCPSP plays a central part. Applications are presented in various domains such as assembly shop and rolling ingots production scheduling, project management in information technology companies and instruction scheduling for VLIW processor architectures.
Download or read book Scheduling Parallel Project Networks with Constrained Resources written by Elliott N. Weiss and published by . This book was released on 1985 with total page 34 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Dissertation Abstracts International written by and published by . This book was released on 1994 with total page 700 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Meta Heuristic Algorithm Frameworks for a Subcontracted Capital and Resource Constrained Project Scheduling Problem with Discounted Cash Flows written by Saeed Nouri and published by . This book was released on 2023 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: Over recent years, a fairly large number of project scheduling problems have been focused on maximizing the Net Present Value (NPV) of cash flows during the project. From the contractor's point of view, cash inflows generally represent their revenues, and cash outflows are expenditures. In most real-life construction projects, the prime contractor typically subcontracts the activities to one or several experienced agents. Considering project scheduling problems with subcontractors is almost ignored in the literature and very little research has been done in the presence of subcontractors. This study aims to develop a Subcontracted Capital and Resource Constrained Project Scheduling Problem with Discounted Cash Flows (SCRCPSPDCF) in which the interactions and negotiations between the client, prime contractor, and subcontractor are considered. The proposed model is discussed under the progress payments that are made to the prime contractor (from the client) and the subcontractors (from the prime contractor). The main advantage of this model is that the cash flow environment is created according to the terms and conditions of all three parties involved in the project. A Hybrid Genetic Algorithm (HGA) which simultaneously benefits from both local search procedure and population-based search is developed to tackle this NP-hard problem. A computational experiment is conducted to evaluate the performance of HGA and to be able to compare the obtained results, Genetic Algorithm (GA) and Multi-Start Iterative Improvement algorithm (MSII) are also utilized. The computational results of the three metaheuristics which are usefully summarized indicate that HGA consistently outperforms the two other metaheuristics. Finally, the impact of two key parameters of the model, related to subcontractors are explored and several conclusions are drawn.
Download or read book A Heuristic Procedure for Resource constrained Project Scheduling written by Vichit Suraphongschai and published by . This book was released on 1976 with total page 458 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Activity Cuts and Resource Rescheduling ACRES Algorithm for Resource constrained Project Rescheduling written by Joseph Guy Hobeika and published by . This book was released on 1992 with total page 124 pages. Available in PDF, EPUB and Kindle. Book excerpt: Many heuristic algorithms, with various levels of solution optimality, have been developed for solving the problem of project scheduling under resource constraints. In most of these algorithms, the critical path method of scheduling is initially applied, and the project duration is then modified or extended in order to meet the resource-imposed constraints. Namely, the activity control time (ACTIM) algorithm developed by Brooks and the time-resource (TIMRES) method proposed by Gleeson are two of the well documented approaches dealing with resource-constrained scheduling. The limitation of these and other algorithms is that the optimum solutions shift from one algorithm to another corresponding to variations in the inputs to the project network. The objective of this research is to develop a set of heuristic rules that would give more optimal results with less sensitivity to project input variations. The methodology of the activity cuts and resource rescheduling (ACRES) algorithm, developed in this research, is based on the assumption that activities may start with less than the required amount of resources but their durations are accordingly adjusted to meet the original resource-time (man-days) required. Activities are stopped or cut and resources regrouped at specific times, and these are then reallocated according to adopted priority rules. The algorithm allows full utilization of available resources by continuously reassigning the otherwise-idle ones as they become available.
Download or read book One of a Kind Production written by Yiliu Tu and published by Springer Science & Business Media. This book was released on 2011-06-21 with total page 308 pages. Available in PDF, EPUB and Kindle. Book excerpt: Despite the numerous competitive advantages of one-of-a-kind production (OKP), the low efficiency and high costs associated with OKP companies threaten to push their business opportunities into the hands of cheaper overseas suppliers. One-of-a-Kind Production introduces a novel strategy and technology to help OKP companies to efficiently mass-produce customized products. In One-of-a-Kind Production, case studies from OKP companies are used to validate the feasibility and effectiveness of the OKP strategy and technology. These case studies include: a structural steel construction company, a manufacturer of specifically ordered compressors and refrigeration systems, a customized high pressure vessel manufacturing company, and a custom window and door manufacturer. To help readers understand OKP strategy and technology, the authors offer a year’s free access to the OKP Management and Control Software System. This system is based on a new integrated production control and management concept, namely product production structure. It is a useful tool – and One-of-a-Kind Production is a valuable guide – for production engineers and managerial staff in manufacturing companies, as well as for university researchers and graduate students.
Download or read book An Optimal Algorithm for the Resource Constrained Project Scheduling Problem written by Stanford University. Department of Operations Research. Systems Optimization Laboratory and published by . This book was released on 1975 with total page 186 pages. Available in PDF, EPUB and Kindle. Book excerpt: The report presents an algorithm for solving a form of the resource constrained project scheduling problem. This particular form of the problem differs from that usually considered in that the time needed to complete a job depends on the amount of resources applied to that job. Jobs are preemptable and the objective is to minimize the project duration. It is shown that this problem is equivalent to the problem of finding that transportation polytope, defined by the resource constraints, of minimal dimension which has a face specified by the precedence constraints. A theorem is presented which gives conditions under which a face of a specified type exists. Using this theorem, the problem transforms into an integer programming problem with variables representing the completion times for each job. The constraint set is defined by inequalities involving addition and maximum operations on the variables and, without the constraint that the variables be integer, the constraint set forms a nonconvex, polyhedral set.
Download or read book Exact and Heuristic Scheduling Algorithms written by Frank Werner and published by MDPI. This book was released on 2020-03-18 with total page 200 pages. Available in PDF, EPUB and Kindle. Book excerpt: This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others.
Download or read book An Heuristic Scheduling Algorithm for Resource Constrained Project Networks written by Stewart Iden Marsh (Jr) and published by . This book was released on 1976 with total page 40 pages. Available in PDF, EPUB and Kindle. Book excerpt: An algorithm is proposed for scheduling project networks having a single constraining resource and a constant level of available resources. The algorithm seeks to generate a minimum length schedule indirectly by maximizing the average resource utilization over the two time intervals represented by the current decision point and its successor. An attempt is made to schedule all of the activities whose predecessors have been completed; failing this, all feasible subsets are considered. Where possible, the algorithm considers only those subsets which introduce new activities at the subsequent decision point.
Download or read book A Simulated Annealing Algorithm for the Resource constrained Multi project Scheduling Problem written by Satheesh K. S. Ramakrishnan and published by . This book was released on 2003 with total page 136 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Using Combinations of Heuristics to Schedule Activities of Constrained Multiple Resource Projects written by Lucy C. Morse and published by . This book was released on 1996 with total page 7 pages. Available in PDF, EPUB and Kindle. Book excerpt: Although both the Critical Path Method (CPM) and the Project Evaluation and Review Technique (PERT) are common approaches used for project scheduling, neither method considers the availability of resources in the scheduling process, and both methods use constraints of precedence only. This article reports on a study to find a quick and simple procedure for scheduling activities of a constrained multiple-resource single-project network that will lower project costs and minimize project duration. The study considered ten priority-rule based heuristics that are used to determine priorities for activities competing for constrained resources, and applied them to the durations of a group of 108 network problems. The results showed that a combination of different heuristics to schedule project activities gave more optimal solutions than other previously used methods. Different heuristics are more applicable to certain network problems, due to the variable nature of network structure and resource availability.
Download or read book Resource constrained Project Scheduling written by Roland Heilmann and published by . This book was released on 2000 with total page 40 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Solving Multi mode Resource constrained Project Scheduling Problems by a Simple General and Powerful Sequencing Algorithm written by Arno Sprecher and published by . This book was released on 1996 with total page 37 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Heuristics for Solving the Resource constrained Project Scheduling Problem written by Manuel Vázquez and published by . This book was released on 2000 with total page 130 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book A New Heuristic Algorithm for Resource constrained Project Scheduling written by Jaemin Han and published by . This book was released on 1988 with total page 200 pages. Available in PDF, EPUB and Kindle. Book excerpt:
