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: 10
Lượt tải: 0
Xem trước 2 trang đầu tiên của tài liệu này:
Thông tin tài liệu:
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
Nội dung trích xuất từ tài liệu:
On some implementations of solving the resource constrained project scheduling problems
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 algorithmsGợi ý tài liệu liên quan:
-
Lecture Introduction to software engineering - Week 3: Project management
68 trang 184 0 0 -
Ebook The procurement and supply manager's desk reference: Part 1
264 trang 122 0 0 -
Ebook Managing projects in human resources, training and development – Part 1
105 trang 121 0 0 -
Project management – Achieving competitive advantage
562 trang 94 0 0 -
106 trang 91 0 0
-
fundamentals of project management (4th edition): part 1
111 trang 55 0 0 -
274 trang 55 0 0
-
128 trang 53 0 0
-
project management (5th edition): part 1
392 trang 53 0 0 -
Ebook Effective project management: Traditional, agile, extreme (5th ed): Part 1
549 trang 49 0 0