A decomposition approach to a scheduling problem with multiple modes
暂无分享,去创建一个
In this paper a complex scheduling problem is investigated and in particular a solution procedure is presented which is based upon a decomposition approach of the problem. Further research efforts will be devoted to the investigation of properties of the procedure, such as identification of the instances in which it finds the optimal solution, and to the computational testing of the procedure.
[1] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .