Please use this identifier to cite or link to this item: https://dspace.ctu.edu.vn/jspui/handle/123456789/54529
Title: Minimizing makespan of personal scheduling problem in available time-windows with split-min and setup-time constraints
Authors: Trang, Hong Son
Tran, Van Lang
Nguyen, Huynh Tuong
Keywords: Splitting-job
Available time-window
Setup-time
Assignment approach
SPT/LPT rule
Tabu search algorithm
Issue Date: 2018
Series/Report no.: Journal of Computer Science and Cybernetics;Vol. 34 No. 02 .- P.97–111
Abstract: This paper deals with personal scheduling problem in available time-windows with split-min and setup-time constraints. The jobs are splittable into sub-jobs 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 NP-hard by a reduction to previous problem in the preliminary results. We propose in this paper an exact method based on MILP model to find optimal solution, some heuristics to find feasible solution and a meta-heuristic 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.
URI: https://dspace.ctu.edu.vn/jspui/handle/123456789/54529
ISSN: 1813-9663
Appears in Collections:Tin học và Điều khiển học (Journal of Computer Science and Cybernetics)

Files in This Item:
File Description SizeFormat 
_file_
  Restricted Access
5.95 MBAdobe PDF
Your IP: 34.231.243.21


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.