Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Shanghai Jiaotong University》 2017-01
Add to Favorite Get Latest Update

Modeling of and Algorithm for Resource-Constrained Project Scheduling Problem with Resource Allocation Dependent Processing Time

LIU Xinyi;LU Zhiqiang;School of Mechanical and Energy Engineering,Tongji University;  
In classical resource-constrained project scheduling problems,the job processing times are assumed to be constant parameters.However,in many practical cases,the processing times depend on the resource allocated to the job.In this paper,the resource-constrained project scheduling problem was introduced with resource allocation dependent processing time to minimize the duration of the project.A model was established and a genetic algorithm was proposed to solve the problem.To improve the ability of the algorithm,a 1-opt based local search scheme and a 2-opt based local search scheme were introduced.The related properties between different job combinations and the objective of the problem were summarized and proved.Based on these properties,the approach for selecting effective job combinations was established,which greatly improved the efficiency of the algorithm in local search.Comparative computational results reveal that the algorithm proposed in this paper can solve the problem effectively.
【Fund】: 国家自然科学基金资助项目(61473211)
【CateGory Index】: TP18
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved