Đang chuẩn bị liên kết để tải về tài liệu:
An ordered heuristic for the allocation of resources in unrelated parallel-machines

Không đóng trình duyệt đến khi xuất hiện nút TẢI XUỐNG Tải xuống

This paper proposes an ordered approach to the MCT heuristic. MOMCT (Modified Ordered Minimum Completion Time) will order tasks in accordance to the MS index, which represents the mean difference of the completion time on each machine and the one on the minimum completion time machine. The computational study demonstrates the improved performance of MOMCT over the MCT heuristic. | Nội dung Text An ordered heuristic for the allocation of resources in unrelated parallel-machines