共查询到20条相似文献,搜索用时 458 毫秒
1.
针对我军维修调度仍然采用"先来先维修(FCFS),重要装备优先维修"问题,结合战时武器装备的维修特点及作战单元战斗力的构成,综合考虑了权重、维修时间与战斗力的关系,以权重和维修时间的比值作为衡量指标,建立了基于战斗力的静态、动态调度模型,提出了相应的调度算法。利用维修调度相关数据对模型进行检验和分析,表明所提出的模型和算法既充分利用了现有的维修调度策略,又对现有的维修策略进行了改进,增强了维修调度的灵活性,缩短了维修时间,使得维修调度更加科学、合理,为决策者进行辅助决策提供了优化思路。 相似文献
2.
由于维修时间存在不确定性,如何在考虑维修时间不确定性的情况下确定任务间隔期的维修方案是一个值得探讨的问题.给出了一种考虑维修时间不确定性的维修任务选择模型及其求解算法,以在一定置信水平下获得最佳的维修方案.首先,给出了考虑维修时间不确定性的维修任务选择问题的假设条件,并建立了一种非线形的、离散的机会约束规划.其次,给出了一种基于随机模拟的粒子群求解算法,包括粒子的表示、适应度函数、更新公式、算法框架等.最后,给出了具体实例,证明了模型与算法的有效性.该模型非常适用于管理人员在维修时间存在不确定性的情况下作出合理的维修任务选择决策. 相似文献
3.
考虑资源约束的复杂维修任务时间预计模型 总被引:1,自引:0,他引:1
在分析装备维修过程时间影响因素的基础上,研究了维修过程时间模型的建模要素关系。采用Petri网技术建立了反映子任务基本关系、资源约束和调度策略的典型维修过程模型,并对典型子任务执行过程进行了细化建模,研究了模型冲突和资源调度策略。针对典型实例进行了维修时间预计和资源利用率分析。 相似文献
4.
通过对不同专业设置方式下的维修任务调度问题进行分析,以最小化批量维修任务的维修时间为目标,将考虑专业维修顺序的批量维修任务调度问题分成两步进行求解,首先,建立了批量维修任务在专业领域内的调度及优化模型;其次,提出了基于NEH的批量维修任务排序方法.最后,通过实例对模型和方法的正确性和可行性进行了说明和验证,实例结果表明,该方法更贴近于实际,实现了快速、有效地解决维修任务调度问题, 相似文献
5.
6.
7.
针对网络化无人机集群任务自主协同问题以及市场竞拍法的优缺点,提出“计算换通信”思想及其相应的分布式任务调度方法。通过对显式和隐式冲突任务的分析,建立任务相关智能体集合。提出基于任务抑制的局部优化方法,用于提前消解部分任务冲突,以减少算法迭代次数。设计基于历史竞标信息的智能体位置推断法,为局部优化提供必要的信息输入。基于组网仿真平台与集群救援场景开展蒙特卡罗仿真实验,结果表明,相比于市场竞拍法中具有代表性的基于共识的捆绑算法和性能影响算法,所提方法能够获得更少的迭代次数、更短的收敛时间以及更优的调度性能。 相似文献
8.
9.
机内测试设备(Built—in Test Equipment,BITE)在复杂系统中的应用越来越多,由于BITE诊断存在不确定性,就可能导致无效的维修.采用一种考虑BITE诊断不确定性的维修任务选择模型及其求解算法,以在一定置信水平下获得最佳的维修方案.首先,给出了考虑BITE诊断不确定性的维修任务选择问题的假设条件,建立了非线性的、离散的随机机会约束规划模型.其次,设计了求解随机机会约束规划模型的一种基于随机模拟的粒子群算法,包括粒子的表示、适应度函数、更新公式、算法框架等.最后,给出了具体实例,证明了模型与算法的有效性.该模型适用于管理人员在考虑BITE诊断不确定性的情况下做出合理的维修任务选择决策. 相似文献
10.
11.
In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
12.
A mixed-model multilevel manufacturing facility running under a just-in-time (JIT) production system is controlled by setting the production schedule for the highest level in the facility, which is usually a mixed-model final assembly line. The schedule is set to achieve the goals of the organization, which under JIT are (1) to keep a constant rate of part usage, and (2) to maintain a smooth production load. In this article we extend earlier work in the literature, which focused on the first goal, by developing scheduling procedures which satisfy both goals. Properties of the resulting production schedules are analyzed and illustrative examples are presented. 相似文献
13.
本文针对复杂零件产品制造精度要求高,工艺性差,残次品率高,生产周期长等特点,在探讨虚拟产品开发技术及其原型系统的基础上,提出了一种复杂零件产品开发的新模式:即在虚拟状态下对产品进行构思、设计、分析、仿真、装配、测试、性能及经济性评估、快速原型及产品数据管理等。 相似文献
14.
This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
15.
The scheduling problem addressed in this paper concerns a manufacturer who produces a variety of product types and operates in a make‐to‐order environment. Each customer order consists of known quantities of the different product types, and must be delivered as a single shipment. Periodically the manufacturer schedules the accumulated and unscheduled customer orders. Instances of this problem occur across industries in manufacturing as well as in service environments. In this paper we show that the problem of minimizing the weighted sum of customer order delivery times is unary NP‐hard. We characterize the optimal schedule, solve several special cases of the problem, derive tight lower bounds, and propose several heuristic solutions. We report the results of a set of computational experiments to evaluate the lower bounding procedures and the heuristics, and to determine optimal solutions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
16.
针对传统造船模式下,车间作业计划与工艺设计串行工作方式的缺点,基于并行工程的原理,提出了分段作业计划与工艺设计的集成运行模式,为实现造船CAPP系统与PPC系统的集成化和并行化提供了实现的基础。针对集成模式的特点,建立了分段作业计划系统资源优化的数学模型,应用遗传算法解决了针对任意分段装配工艺方案的多资源平衡优化问题,可以得到每项作业最优的开工时间,同时能够给出多种资源的最优分布结果,满足了多工艺方案之间资源利用率的比较。最后,给出了计算实例,计算机模拟结果说明了这一方法的有效性。 相似文献
17.
Allocation of scarce common components to finished product orders is central to the performance of assembly systems. Analysis of these systems is complex, however, when the product master schedule is subject to uncertainty. In this paper, we analyze the cost—service performance of a component inventory system with correlated finished product demands, where component allocation is based on a fair shares method. Such issuing policies are used commonly in practice. We quantify the impact of component stocking policies on finished product delays due to component shortages and on product order completion rates. These results are used to determine optimal base stock levels for components, subject to constraints on finished product service (order completion rates). Our methodology can help managers of assembly systems to (1) understand the impact of their inventory management decisions on customer service, (2) achieve cost reductions by optimizing their inventory investments, and (3) evaluate supplier performance and negotiate contracts by quantifying the effect of delivery lead times on costs and customer service. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:409–429, 2001 相似文献
18.
Wai Ki Ching 《海军后勤学研究》2001,48(1):65-78
This paper studies production planning of manufacturing systems of unreliable machines in tandem. The manufacturing system considered here produces one type of product. The demand is assumed to be a Poisson process and the processing time for one unit of product in each machine is exponentially distributed. A broken machine is subject to a sequence of repairing processes. The up time and the repairing time in each phase are assumed to be exponentially distributed. We study the manufacturing system by considering each machine as an individual system with stochastic supply and demand. The Markov Modulated Poisson Process (MMPP) is applied to model the process of supply. Numerical examples are given to demonstrate the accuracy of the proposed method. We employ (s, S) policy as production control. Fast algorithms are presented to solve the average running costs of the machine system for a given (s, S) policy and hence the approximated optimal (s, S) policy. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 65–78, 2001 相似文献
19.
A natural extension of the bucket brigade model of manufacturing is capable of chaotic behavior in which the product intercompletion times are, in effect, random, even though the model is completely deterministic. This is, we believe, the first proven instance of chaos in discrete manufacturing. Chaotic behavior represents a new challenge to the traditional tools of engineering management to reduce variability in production lines. Fortunately, if configured correctly, a bucket brigade assembly line can avoid such pathologies. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
20.
We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014 相似文献