Paper Info
Title
Parallel-Machine Scheduling With Precedence Constraints And Controllable Job-Processing Times
Abstract
A parallel-machine scheduling problem with tree-formed precedence constraints is studied, where job-processing times can be compressed by allocating extra resource to the jobs. A tabu-search algorithm is developed in this paper, which searches for the near optimal solutions based on the structural characteristics of the problem. Experiment shows the algorithm is capable for providing satisfactory schedules for media and large-sized problems within acceptable computing time.
Year
DOI
Venue
2017
10.5220/0006290804700476
PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES)
Keywords
Field
DocType
Parallel-machine, Precedence Constraint, Controllable Processing Time, Tabu-search
Mathematical optimization,Machine scheduling,Fair-share scheduling,Computer science,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Kailiang Xu111.43
Rong Fei283.52
Gang Zheng310919.51