TRA CỨU
thông tin biểu ghi
  • Bài trích
  • Ký hiệu PL/XG: 004.33
    Nhan đề: Minimizing makespan of personal scheduling problem in available time-windows with split—min and setup—time constraints
DDC 004.33
Tác giả CN Trang, Hồng Sơn
Nhan đề Minimizing makespan of personal scheduling problem in available time-windows with split—min and setup—time constraints
Mô tả vật lý 15p.
Tóm tắt 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.
Từ khóa tự do available time-window
Từ khóa tự do search algorithm.
Từ khóa tự do setup-time
Từ khóa tự do Thiết lập thời gian
Từ khóa tự do Thuật toán tìm kiếm
Tác giả(bs) CN Trần, Văn Lang
Tác giả(bs) CN Nguyễn, Huỳnh Tương
Nguồn trích Tạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics 2018Page 97 - 111 Số: 02 Tập: 34
000 00000nab#a2200000ui#4500
00121481
0029
004F0BFEA14-749B-4871-B9FE-7C658E600719
005202006021011
008081223s vm| vie
0091 0
039|y20200602101130|zbacntp
082 |a004.33
100 |aTrang, Hồng Sơn
245 |aMinimizing makespan of personal scheduling problem in available time-windows with split—min and setup—time constraints
300 |a15p.
520 |aThis 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.
653 |aavailable time-window
653 |asearch algorithm.
653 |asetup-time
653 |aThiết lập thời gian
653 |aThuật toán tìm kiếm
700 |aTrần, Văn Lang
700 |aNguyễn, Huỳnh Tương
773 |tTạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics |d2018|gPage 97 - 111|v34|i02
890|c0|a0|b0|d0
Không tìm thấy biểu ghi nào

Không có liên kết tài liệu số nào