Procurement outsourcing is the main competence of the procurement center, whose main concern is how to distribute the operators among all the orders with artrious due date. The operator should find the suitable supplier for each order. From the aspect of the procurement center, they pay attention to not only the procurement cost,but also the service; level.In this thesis, we consider the problem of scheduling and supplier selection for a third-party procurement center. We first formulate this problem as an integer linear programming (ILP) problem. The objective is to minimize the total cost and penalty associated with order tardiness subject to various resource constraints. As is often the case, the resulting ILP problem is NP-complete and it is computational infeasible to find optimal solution. Therefore, we develop an approximation method to find near-optimal solutions for this problem. The key of our method is decompose the original ILP problem into many small sub-problems based on Lagrange relaxation method. Each small sub-problem can be solved by using technique of dynamic programming. The numerical results are provided to validate our method. |