We consider a class of k-server optimal task scheduling problems — partitioning and scheduling N tasks with various reql-time constrains and work loads on k servers with convex task processing cost function so as to minimize the total task processing cost while still guarantee satisfaction of all time constrains. This class has broad expressing power for practical scheduling problems in several areas such as real-time multi-media wireless transmission [2, 7, 4], CPU energy conservation [10, 1, 8], and warehouse order processing management, et. al.. Our formulation is quite general such that most previous works can be readily reduced to a special case of the presented k-server optimal task scheduling problem. We show that, when k=1, optimal solution can be obtained in computational complexity of 0(N) and the corresponding optimal scheduling problem is equivalent to finding the shortest 2D Euclidean distance between two vertices inside a well-defined 2D polygon. However, when k ≥ 2, the optimal scheduling problem can be demonstrated to be NP-hard by reducing it to a well-known NP-complete bin-packing problem. Therefore, we conclude no polynomial time algorithm exists for a general k-server optimal task scheduling problem. We then construct approximation algorithmsto solve the presented k-server problem in a practical way and illustrate its performance by simulation results and analysis.