We consider the resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities preemptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose an exact branch and bound algorithm for solving the problem with renewable resources. It uses our new branching scheme based on the representation of a schedule in the form of an activity list.
Nội dung trích xuất từ tài liệu:
On some implementations of solving the resource constrained project scheduling problems
On some implementations of solving the resource constrained project scheduling problems
Số trang: 11
Loại file: pdf
Dung lượng: 320.96 KB
Lượt xem: 12
Lượt tải: 0
Thông tin tài liệu:
Tìm kiếm theo từ khóa liên quan:
Project management Resource constrained project scheduling problem Renewable resources Cumulative resources Branch and bound algorithmsTài liệu có liên quan:
-
Lecture Introduction to software engineering - Week 3: Project management
68 trang 216 0 0 -
Ebook Managing projects in human resources, training and development – Part 1
105 trang 141 0 0 -
Ebook The procurement and supply manager's desk reference: Part 1
264 trang 135 0 0 -
Project management – Achieving competitive advantage
562 trang 107 0 0 -
106 trang 106 0 0
-
274 trang 66 0 0
-
fundamentals of project management (4th edition): part 1
111 trang 61 0 0 -
project management (5th edition): part 1
392 trang 61 0 0 -
128 trang 58 0 0
-
Ebook Operations management (7/E): Part 2
495 trang 56 0 0
