排序方式: 共有52条查询结果,搜索用时 718 毫秒
31.
为确定所有工件的多个共同工期以及工件的最优调度序列,最小化提前惩罚、延误惩罚和公共工期分配的加权和,利用位置权重与处理时间的匹配过程来获得最优解。对此问题给出了最优解满足的性质,当分配给共同工期的工件个数为给定常数时该问题可解。该问题是多项式可解的,并给出了具体求解算法。 相似文献
32.
敏捷供需链中的准时采购计划方法研究 总被引:8,自引:0,他引:8
针对敏捷供需链的管理需求 ,在引入准时化 ( JIT)思想的基础上 ,就如何解决向供应商采购 ,提出了敏捷供需链中的准时采购计划问题 ,并给出了问题的数学描述。利用数学推导 ,将所建的原始优化模型转化成线性规划问题。计算结果表明 ,提出的准时采购计划方法 ,完全可以做到在供应能力平衡的前提下 ,实现敏捷供需链面向客户准时供应的经营目标 ,使提前 /拖期惩罚费用总额极小化。 相似文献
33.
柔性作业车间动态调度问题研究 总被引:6,自引:0,他引:6
为了有效求解柔性作业车间动态调度问题,提出了一个基于多目标免疫遗传算法(MOIGA)的动态调度优化算法。首先定义了柔性作业车间动态调度问题,然后采用事件驱动和周期驱动相结合的调度策略,提出了基于MOIGA的动态调度优化模型,接着设计了面向交货期性能最优的柔性作业车间调度算法,并讨论了影响算法复杂度的因素,最后通过一个实例仿真,表明了算法的可行性和优越性。 相似文献
34.
关于延误问题改进的Emmons条件 总被引:2,自引:1,他引:1
Emmons条件在求解单台机器延误问题中起着十分重要的作用,对陶霖(1988)等提出的弱于Emmons条件的所谓改进的Emmons条件再进一步改进简化,算例表明了算法的有效性. 相似文献
35.
The common due window scheduling problem with batching on a single machine is dealt with to minimize the total penalty of weighted earliness and tardiness. In this paper it is assumed that a job incurs no penalty as long as it is completed within the common due window. It is the first time for the due window scheduling to be extended to this situation so that jobs can be processed in batches. An unbounded version of batch scheduling is also considered. Hence, jobs, no matter how many there are, can be processed in a batch once the machine is free. For two cases that the location of due window is either a decision variable or a given parameter, polynomial algorithms are proposed based on several optimal properties. 相似文献
36.
LI Ying |juan WANG Ding |wei . Department of Industry Business Administration Shenyang University Shenyang China . Department of Systems Engineering College of Information Science Engineering Northeastern University Shenyan 《系统科学与系统工程学报(英文版)》2000,(1)
1 IntroductionSince the real-world resource requirements are usually time-dependent,nonlinear,andnonconvex,a much more elaborated model is needed to study earliness/ tardinessproduction scheduling problems.A semi-infinite programming model[2 ,3] can closely modelthe earliness/ tardiness production planning problem.Because it has infinitely manynonconvex constraints,it is very difficult to solve the model.The complexity of theproblem has been discussed in [1 ] .The presented bestmethod in so… 相似文献
37.
带有交货期窗口的调度问题及算法 总被引:4,自引:1,他引:3
对不同交货期窗口下的提前/拖期单机调度问题进行了分析,给出了最优序列中相邻工件对所满足的必要条件,提出了两个优先级法则,并利用优先级法则设计出遗传算法的交叉算子,在文章的最后,给出了实验结果和结论. 相似文献
38.
The strong non-deterministic polynomial-hard (NP-hard) character of job shop scheduling problem (JSSP) has been acknowledged widely and it becomes stronger when attaches the no-wait constraint, which widely exists in many production processes, such as chemistry process, metallurgical process. However, compared with the massive research on traditional job shop problem, little attention has been paid on the no-wait constraint. Therefore, in this paper, we have dealt with this problem by decomposing it into two sub-problems, the timetabling and sequencing problems, in traditional frame work. A new efficient combined non-order timetabling method, coordinated with objective of total tardiness, is proposed for the timetabling problems. As for the sequencing one, we have presented a modified complete local search with memory combined by crossover operator and distance counting. The entire algorithm was tested on well-known benchmark problems and compared with several existing algorithms. Computational experiments showed that our proposed algorithm performed both effectively and efficiently. 相似文献
39.
研究了具有不同交货期窗口的Flowshop提前/拖期调度问题,并考虑处理时间的不确定性以及存储时间的有限性,在模糊规划理论基础上,建立了带有提前/拖期的存储时间有限型Flowshop的调度模型,通过中间值最大隶属度算法,将原有的模糊调度模型转化为清晰的调度模型,并应用了遗传算法进行优化求解。仿真实验验证了算法的有效性。 相似文献
40.
考虑到产品不同的交货期, 研究了不确定条件下的作业车间调度问题, 用三角模糊数表示产品处理时间, 建立了调度问题的模型, 并结合模糊理论设计了一种改进的遗传算法进行求解. 该算法通过整数编码的方法产生初始种群, 结合轮盘赌方法和精英保留策略进行选择操作, 采用基于优先工序交叉(precedence operation crossover, POX)算子和互换变异方法进行交叉和变异操作, 并通过动态调整交叉概率和变异概率的方法来提高算法的性能以及计算效率. 最后, 通过算例和企业实例验证了该模型和算法的有效性. 相似文献