工件可拒绝运输集成流水作业排序研究
发布时间：2018-12-21 20:38
【摘要】：排序论是运筹学中最重要的分支之一.在多种机器环境、限制条件、目标函数下的大量排序模型已经被学者们广泛研究.本学位论文考虑了两台流水作业(flow-shop)机器环境下工件可拒绝的两阶段生产加工与运输的集成排序问题.为了节省成本或者使得生产耗时最小化,工件可拒绝的生产和运输的协调排序问题已经在文献中被广泛研究.通常的运输有工件未加工完阶段间的运输和工件完成加工之后的运输.本文我们主要考虑的是工件未加工完阶段间的运输.针对运输机有不同的数量限制和容量限制,我们在文中将分情形讨论.本文的结构和主要结果如下:·在第一章,我们介绍了问题背景、常用排序记号、文献综述以及排序论中一些的基本结果和算法.·在第二章,我们研究了两阶段之间存在充足的运输机的排序问题TF2 | rej,v ≥ n |Cmax+ ∑ej给出了一个运行时间为O(n(?)(p2j+t)max{Plj+t})的动态规划算法,一个2-近似算法和一个全多项式时间近似方案.·在第三章,我们研究了工件具有相同大小的排序问题TF2 | rej,sj=1 | Cmax +∑ej,给出了一个最坏性能比为2的启发式算法.·在第四章,我们研究了工件具有不同大小的排序问题TF2| rej,sj|Cmax + ∑ ej,给出了一个最坏性能比为11/5的启发式算法.·在第五章,我们研究了工件在第一台机器上具有相同的加工时间时并且运输机数量固定的排序问题TF2 |rej,P1j=p1j=p1,v,sj Cmax + ∑ej,给出了一个运行时间为O(cv+2vv+3n2v+1p1(?)p2j)的动态规划算法.
[Abstract]:Sequencing theory is one of the most important branches of operational research. In a variety of machine environments, constraints, objective functions under a large number of sorting models have been widely studied. In this dissertation, we consider the problem of integrated scheduling of two stages of production, processing and transportation, which can be rejected by two flow operations (flow-shop) machines. In order to save cost or minimize the production time, the coordinated scheduling of production and transportation of rejected jobs has been extensively studied in the literature. The usual transportation includes the transportation between the unprocessed stage of the workpiece and the transportation of the workpiece after the completion of the processing. In this paper, we mainly consider the transportation of the workpiece during the unfinished stage. In view of the different quantity and capacity limitation of transport aircraft, we will discuss the case in this paper. The structure and main results of this paper are as follows: in the first chapter, we introduce the background of the problem, common sort notation, literature review and some basic results and algorithms of sorting theory. In this paper, we study the ordering problem of sufficient transport planes between two stages. TF2 rej,v 鈮，
本文编号：2389430
[Abstract]:Sequencing theory is one of the most important branches of operational research. In a variety of machine environments, constraints, objective functions under a large number of sorting models have been widely studied. In this dissertation, we consider the problem of integrated scheduling of two stages of production, processing and transportation, which can be rejected by two flow operations (flow-shop) machines. In order to save cost or minimize the production time, the coordinated scheduling of production and transportation of rejected jobs has been extensively studied in the literature. The usual transportation includes the transportation between the unprocessed stage of the workpiece and the transportation of the workpiece after the completion of the processing. In this paper, we mainly consider the transportation of the workpiece during the unfinished stage. In view of the different quantity and capacity limitation of transport aircraft, we will discuss the case in this paper. The structure and main results of this paper are as follows: in the first chapter, we introduce the background of the problem, common sort notation, literature review and some basic results and algorithms of sorting theory. In this paper, we study the ordering problem of sufficient transport planes between two stages. TF2 rej,v 鈮，
本文编号：2389430
本文链接：https://www.wllwen.com/kejilunwen/yysx/2389430.html
