Dòng Nội dung
1
Minimizing makespan of personal scheduling problem in available time-windows with split—min and setup—time constraints // Tạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics . - 2018. - Page 97 - 111. - ISSN:


15p.
Ký hiệu phân loại (DDC): 004.33
This paper deals with personal scheduling problem in available time- windows with split-min and setup-time constraints. The jobs are split table into sub-job and a common lower bound on the size of each sub-job is imposed. The objective function aims to find a feasible schedule that minimizes the total completion time of all jobs. The proposed scheduling problem was proved to be strongly N P- hard by a reduction to previous problem in the preliminary results. We propose in this paper au exact method based on MILP model to find optimal solution. some heuristics to find feasible solution and a meta-heuristics based on tabu search algorithm to find good solution. The computational results show the performance of proposed exact method some heuristics and tabu search algorithm.
 Số bản sách: (0) Tài liệu số: (0)