1、机械机床毕业设计41带有交货期和加工时间可控的单机排序问题 本科毕业设计论文题 目 带有交货期和加工时间可控的单机排序问题 专业名称 机械设计制造及其自动化 学生姓名 指导教师 毕业时间 摘要 排序问题是一类重要的组合最优化问题。排序问题普遍应用于管理等学科领域,是组合最优化的一类重要问题。调度的任务是根据生产目标和约束,为每个加工对象确定具体的加工路线、时间、机器和操作等。优良的调度策略对于提高生产系统的最优性、提高经济效益都有着极大的作用。但是由于资源约束和工艺约束的并存,迄今计算复杂性理论表明,多数调度问题属于NP一hard(Nondeterministiepolynomial一Hard
2、,非确定性多项式)难问题,目标解的搜索涉及解空间的组合爆炸。排序算法的竞争比分析是排序问题对算法风险的一种评估和保障,具有重要的理论意义和实用价值。 本文讨论了带有交货期和工件的加工时间可控的单机排序问题本文首先根据最优排序的性质确定了最优资源的分配方法并将问题转化为指派问题通过构造多项式时间算法确定最优排序#然后本文将学习效应与加工时间可控问题结合分别讨论了加工时间是线性资源函数和凸资源函数两种情况证明了该类问题是多项式时间可解的最后讨论了一种特殊情况学习因子是常数加工时间是凸资源函数给出了复杂性为O(nlogn)的算法通过运行此算法确定最优资源分配量和工件的最优排序。关键词:排序单台机器,
3、交货期,指派加工时间可控,资源分配. ABSTARCTScheduling problem is an improtan combinatorial opti-zation problem.Scheduling problem is widely applied impr-otant problems in combinatorial optimization.The schedul-ing of tasks according to production objectives and constr-aints,to detemine the specific processing route
4、,time,mac-hine and operation eachobject processing.Good scheduling strategy has a great role in improve economic benefits.But due to the coexistence of resource constraints and technological constaints,so the computati-onal complexity theory shows that,most scheduling problr-m belongs to NP a hard(N
5、ondeter ministiepolynomial Har-d,non deteministicpolynomial) problem target search rela-tes to the combinatorial explosion of the solution space.S-orting algorithm of the comprtitive ratio analysis is the so-ft of algorithm the risks of a assessment and security,has the important theory significance
6、 and practical value. This paper discusses the single machine scheduling p-roblem with controllable processing time of delivery and t-he workplece.According to the properties the optimal res-ource allocation method and the problem can be converte-d to assigment problem by construting a polynomial ti
7、me ,Algorithm to detemine the optimal ordering and the learn-ing effect and problem with controllable processing times Respectively discusses the processing time is a linear res-ource functions and convex resource function in two case-sproved that this kind of problem is polynomial time solv-able fi
8、nally discussed a special case study factor is consta-nt processing time is a convex resource function gives co-mplexity is O(nlog n)algorithm by running this algorithm .To detemine the optimal resource allocation optimal quan-tity and parts of the soft.Key words:the single machine scheduling,delive
9、ry p-eriod,controllable processing times,resource allocation.ABSTRACT.5第一章 绪论.81.1 课题研究的背景和意义.81.2课题研究的目的意义和主要内容.9 1.2.1 排序问题的简述.9 1.2.2 排序问题的求解.10 1.2.3 算法复杂性的简介.101.3 本章小结.11第二章 带有交货期和加工时间可控的单机排序问题.122.1 单机排序.12 2.1.1 符号说明 .12 2.1.2 常用排序方法.132.2带有交货期和加工时间可控的单机排序问题.14 2.2.1问题描述.14 2.2.2资源约束.16 2.2.3模型推广.192.3应用举例及计算结果.232.4本章小结.25第三章 仿真与分析.25 3.1车间调度仿真.25 3.1.1 车间调度问题的描述.25 3.1.2 车间调度问题的特点.253.2仿真调度的原理和特点.26 3.2.1 仿真调度的原理.26 3.2.2 仿真调度的特点.263.3 仿真的基本方法
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1