关于工件外包与多个代理的两类排序问题研究
发布时间：2018-09-14 11:23
【摘要】：近年来,关于工件外包与多个代理的排序研究日益深入,首先,制造商并不会如传统制造商加工全部工件,而是会将一部分加工耗时长且利润较低的工件外包,其次,现在的排序模型中,制造商往往会收到多个代理的订单,并安排在相同的机器资源上加工,而不只限于单个代理,所以,我们主要研究工件外包与多个代理两类排序问题,对这两类问题的研究极具有现实意义,论文主要结构安排如下:第一章绪论部分阐述了有关排序问题的基本内容、三参数表示法,介绍了排序算法及算法复杂性,并对文章的相关研究现状进行了简要概括.第二章主要分析带有外包的供应链排序问题:制造商为客户加工工件,假设仅有一个供应商,一台本地机器和一个外包商,每个工件既可以在内部加工又可以外包,内部加工工件分批运输,车容量有限.本章考虑内部加工工件的费用为内部加工工件的持货成本,即(加权)总完工时间,外包费用有限.如果所有工件的加工时间不同,我们考虑目标函数为内部加工工件的总完工时间与运输费用,并给出伪多项式时间算法;如果所有工件的加工时间相同,我们考虑内部加工工件的加权总完工时间与运输费用这一目标函数,给出伪多项式时间算法.第三章分析了两个代理工件带有恶化效应的单机可拒绝排序问题.代理人A与B有自己的工件集JA和JB,工件集中工件要么被接收并在机器加工,其中实际加工时间只工件开工时间有关,要么被拒绝,并支付相应的拒绝费用,其目标是在代理人B工件的目标函数fB(对应工件完工时间的非减函数)与拒绝工件的拒绝费用不超过给定值Q的基础上,使得代理人A接收工件的目标函数fA (对应工件完工时间的非减函数)与拒绝工件的拒绝费用总和最小.对于各种目标函数,我们分别进行分析排序,并给出伪多项式时间算法.
[Abstract]:In recent years, the research on job outsourcing and multi-agent scheduling has become more and more intensive. Firstly, the manufacturer will outsource part of the long-time and low-profit jobs instead of all the jobs as the traditional manufacturer. Secondly, in the current scheduling model, the manufacturer often receives orders from multiple agents and arranges them in the same order. Machine resource processing is not limited to a single agent. Therefore, we mainly study two kinds of scheduling problems: job outsourcing and multi-agent scheduling. The research on these two kinds of scheduling problems is of great practical significance. The main structure of this paper is as follows: Chapter 1: Introduction describes the basic content of scheduling problems, three-parameter representation, and introduces the scheduling. Chapter 2 mainly analyzes the supply chain scheduling problem with outsourcing: the manufacturer processes the workpiece for the customer, assuming that there is only one supplier, one local machine and one outsourcer, each workpiece can be processed internally as well as outsourced and processed internally. This chapter considers that the cost of internal processing is the cost of holding the workpiece, i.e. (weighted) total completion time, and the cost of outsourcing is limited. A pseudo-polynomial time algorithm is presented considering the objective function of the weighted total completion time and the transportation cost for all jobs with the same processing time.Chapter 3 analyzes the single machine rejection scheduling problem with deterioration effect for two proxy jobs.Agents A and B have their own set of jobs JA and JB. The object function fB (the non-subtractive function for the completion time of the job) and the rejection cost of the rejected job do not exceed the given value Q. On the other hand, agent A receives the objective function fA (a non-decreasing function corresponding to job completion time) of the job and minimizes the total rejection cost of the rejected job.
【学位授予单位】：曲阜师范大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：O223
本文编号：2242567
[Abstract]:In recent years, the research on job outsourcing and multi-agent scheduling has become more and more intensive. Firstly, the manufacturer will outsource part of the long-time and low-profit jobs instead of all the jobs as the traditional manufacturer. Secondly, in the current scheduling model, the manufacturer often receives orders from multiple agents and arranges them in the same order. Machine resource processing is not limited to a single agent. Therefore, we mainly study two kinds of scheduling problems: job outsourcing and multi-agent scheduling. The research on these two kinds of scheduling problems is of great practical significance. The main structure of this paper is as follows: Chapter 1: Introduction describes the basic content of scheduling problems, three-parameter representation, and introduces the scheduling. Chapter 2 mainly analyzes the supply chain scheduling problem with outsourcing: the manufacturer processes the workpiece for the customer, assuming that there is only one supplier, one local machine and one outsourcer, each workpiece can be processed internally as well as outsourced and processed internally. This chapter considers that the cost of internal processing is the cost of holding the workpiece, i.e. (weighted) total completion time, and the cost of outsourcing is limited. A pseudo-polynomial time algorithm is presented considering the objective function of the weighted total completion time and the transportation cost for all jobs with the same processing time.Chapter 3 analyzes the single machine rejection scheduling problem with deterioration effect for two proxy jobs.Agents A and B have their own set of jobs JA and JB. The object function fB (the non-subtractive function for the completion time of the job) and the rejection cost of the rejected job do not exceed the given value Q. On the other hand, agent A receives the objective function fA (a non-decreasing function corresponding to job completion time) of the job and minimizes the total rejection cost of the rejected job.
【学位授予单位】：曲阜师范大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：O223
【参考文献】
相关期刊论文 前4条
1 王磊;张玉忠;柏庆国;;单机带有可拒绝的供应链排序问题[J];系统科学与数学;2014年09期
2 陈立忠;杨栋;张玉忠;;供应链排序中的外包问题[J];重庆师范大学学报(自然科学版);2013年05期
3 王磊;王国庆;易余胤;;有多种运输方式的供应链排序问题[J];运筹学学报;2011年03期
4 苗翠霞,张玉忠;极小化加权总完工时间的分批排序问题[J];运筹学学报;2005年02期
，本文编号：2242567
本文链接：https://www.wllwen.com/kejilunwen/yysx/2242567.html
