Danh mục

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    
10.10.2023

Phí tải xuống: 1,000 VND Tải xuống file đầy đủ (11 trang) 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

Tài liệu được xem nhiều: