Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTrang, Hong Son-
dc.contributor.authorTran, Van Lang-
dc.contributor.authorNguyen, Huynh Tuong-
dc.description.abstractThis 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.vi_VN
dc.relation.ispartofseriesJournal of Computer Science and Cybernetics;Vol. 34 No. 02 .- P.97–111-
dc.subjectAvailable time-windowvi_VN
dc.subjectAssignment approachvi_VN
dc.subjectSPT/LPT rulevi_VN
dc.subjectTabu search algorithmvi_VN
dc.titleMinimizing makespan of personal scheduling problem in available time-windows with split-min and setup-time constraintsvi_VN
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 
  Restricted Access
5.95 MBAdobe PDF
Your IP:

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