Approximation Algorithms for Scheduling Problems with Subcontracting
This paper studies open shop,flow shop and parallel schedulings where jobs can be either processed at manufacturer or outsourced to a subcontractor with enough single machines.Processing costs are required for both the manufacturer and the subcontractor's machines.In this paper,the in-house jobs'set and its schedule will be determined such that the sum of makespan and processing cost is minimized.For the three scheduling problems,the complexities are analyzed and approximation algorithms are proposed.
NETL
NSTL
万方数据
