Research on Resource Selection with Precedence and Due Date Constraint

Authors:
Shujuan Li;Yong Liu;Yan Li;Yuefei Xu;Zhibin Zeng
Affiliations:
School of mechanical & instrumental engineering, Xi'an University of Technology, Xi'an, PRC 710048;School of mechanical & instrumental engineering, Xi'an University of Technology, Xi'an, PRC 710048;School of mechanical & instrumental engineering, Xi'an University of Technology, Xi'an, PRC 710048;IEEE member, British Columbia, Canada V3N5E1;School of mechanical & instrumental engineering, Xi'an University of Technology, Xi'an, PRC 710048
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Year:
2008

Citing 3
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Methods for task allocation via agent coalition formation

Artificial Intelligence
A heuristic genetic algorithm for subcontractor selection in a global manufacturing environment

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the resource selection problem with due date constraint in production planning and control where the subtasks form a precedence network. We prove that this problem is NP-complete. Thus this problem cannot have any polynomial time solution algorithm at present. We establish a nonlinear integer-programming model for this problem, and prove the monotonicity properties of the objective function and constraint function in the model. Basing on our observations, we construct a Branch & Bound method to solve the problem. The test results show that this algorithm is effective.