TAILIEUCHUNG - Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. | Yugoslav Journal of Operations Research Volume 19 (2009) Number 2, 281-298 DOI: HEURISTIC ALGORITHM FOR SINGLE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON THE DYNAMIC PROGRAMMING Ivan STANIMIROVIĆ1, Marko PETKOVIĆ2 Predrag STANIMIROVIĆ3* and Miroslav ĆIRIĆ4 1,2,3,4 University of Niš, Department of Mathematics and informatics, Faculty of Sciences and Mathematics, 1 , 2dexterofnis@, 3 pecko@, 4ciricm@ Received: May 2006 / Accepted: October 2009 Abstract: We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm), as well as with Microsoft Project. Keywords: Resource scheduling, dynamic programming, knapsack problem, DELPHI. 1. INTRODUCTION In practice most organizations work within limited resources, so projects are subject to the same constraint. A new project may seek an additional use of resources, so it is needed to ensure that they really would be available. * Corresponding author 282 I. Stanimirović, M. Petković, P. Stanimirović, M. Ćirić / Heuristic algorithm On the other hand, the time constraints are always present, so project manager must work under that boundary. Resource leveling is a way to resolve having too much work assigned to resources, known as resource over allocation. The network diagram can be used to find opportunities for shortening the project schedule. This involves looking at where we can cut the amount of time it takes to complete activities on the critical path, for example, by increasing the resources available to .

• Kỹ thuật lập trình
• Resource scheduling
• Dynamic programming
• Knapsack problem
• Non preemptive case
• Heuristic method
• Heuristic algorithm
• Minimizing makespan of a resource constrained scheduling problem
• A hybrid greedy and genetic algorithms
• Resource constrained scheduling problem
• Large scale problems
• Resource Constrained Project Scheduling Problem
• Backward forward search method
• Two stage genetic algorithm
• Optimized cloud resource management
• Optimized cloud resource management and scheduling
• Energy efficiency
• Minimizing total busy
• Energy efficient scheduling
• Cloud data centers
• Team solving distributed resource
• Multi project scheduling problem
• Resource constrained scheduling
• Optimization problem
• Multi agent system
• Big data technologies
• Cloud computing
• Resource modeling
• Cloud resource scheduling strategies
• Limited multi resource
• ABCD activity classifications
• Flexible resource profile
• One of a Kind Production companies
• A game theory model based on Gale Shapley
• Dual resource constrained flexible job shop scheduling
• Dual resource constrained
• Flexible job shop scheduling
• Minimum Moments of Resources Required
• Integrated planning and scheduling process
• X Y axes
• Non feasible project schedule
• Artificial Bee colony
• Resource constrained project
• The PSPLIB library
• Various meta heuristics
• Theoretically of paramount importance
• Project management process
• Standard problem of RCPSP
• Project management
• Renewable resources
• Cumulative resources
• Branch and bound algorithms
• Net present value
• Multi mode resource constrained project scheduling problem
• Assuming discounted positive cash flow
• Pre emptive Constrained Resources
• Discounted Cash Flows
• RCPSPs and RCMPSPs
• Multi Project Scheduling Problems
• Activity On Arc
• Genetic algorithm based method
• Multi mode activities
• Activities considering precedence constraints
• Exact mathematical programming model
• Project scheduling problem with resource constraints
• Constraint based declarative programming framework
• Scheduling and resource allocation problems
• Constraint logic programming
• Mathematical programming
• Decision support
• Lecture Real time systems
• Real time systems
• Bài giảng Hệ thống thời gian thực
• Multiprocessor scheduling
• Resource access control
• Model of multiprocessor
• Swarm intelligence
• Evolutionary computing
• Optimization methods
• Resource constrained project scheduling
• Approximate methods
• Scheduling algorithm
• Budget constraints
• Cloud computing base
• Admission control
• Scheduling algorithms
• Constraint QoS
• Resource allocation
• Grid computing
• Resource utilization
• Sort Mid tasks scheduling algorithm
• Scheduling a maintenance activity under skills constraints
• Minimize total weighted tardiness and late tasks
• Minimizing objective functions aforementioned
• Maintenance tasks under resource
• Unrelated parallel machine scheduling
• Optimization and swarm intelligence
• Evolutionary algorithm
• Resourceconstrained project scheduling problem
• Cuckoo search algorithm
• Optimization algorithm
• Adaptive workflow scheduling
• Evolutionary approach in cloud computing
• Evolutionary algorithms
• Resource allocation
• Project schedule management
• Critical path method
• Resource leveling
• Differential evolution
• NET framework
• báo cáo khoa học
• báo cáo hóa học
• công trình nghiên cứu về hóa học
• tài liệu về hóa học
• cách trình bày báo cáo