Research On Two Types Of Sorting Problems Of Artifact Outsourcing And Multiple Agents

In recent years, there has been an in-depth research of outsourcing and multiple agents scheduling.Firstly, manufacturers do not process all the jobs as traditional manufacturers,but rather outsource part of jobs, which consume longer processing time and have lower profit. Next, in the modern scheduling model, the manufacturer often accepts orders from multiple agents and schedule on the same machines to process them, rather than a single agent. So, we mainly research two problems of job-outsourcing and multi-agent scheduling,the research of the problems is more practical significance. The structure of this article is as follows:The first chapter introduces the basic content of the scheduling problem and the three parameter representation methods, also introduces the scheduling algorithm and the com-plexity of the algorithm, and then gives a brief summary of the related research status of the article.In the second chapter, we consider the problem of supply chain scheduling with outsourc-ing on a single machine. We assume that there is only one supplier, one machine and one subcontractor, each job can be processed in-house or outsourced, and the in-house processed jobs are transported in batches, vehicle capacity is limited. This chapter considers that the in-house processed cost is the holding costs of the in-house processed jobs, that is, (weight-ed) the total completion time, the outsourcing budgets axe limited. If all jobs have different processing time, we discuss holding and delivery costs and give pseudo-polynomial time al-gorithm; if all jobs have identical processing time, we consider the weighted total completion time of the in-house processed jobs and delivery costs, and have given pseudo-polynomial time algorithm.In the third chapter, we consider the problem of two agent scheduling with rejection and deterioration on a single machine, agents A and B have their own job families JAandJB, the jobs in the families are either accepted and processed on the machine, which the processing time is only related to its starting times, or rejected with a certain rejection penalty having to be paid, the objective is to minimize the sum of the given objective function fA (non-decreasing functions corresponding to the completion time of the jobs)of the accepted jobs and total rejection penalty of the rejected jobs of the first agent A , given that the sum of the given objective function fB(non-decreasing functions corresponding to the completion time of the jobs)of the accepted jobs and total rejection penalty of the rejected jobs of the agent B does not exceed a fixed value Q ( Q is a positive integer). For every objective function,we have analyzed respectively and given a pseudo-polynomial time algorithm.