排序方式: 共有73条查询结果,搜索用时 156 毫秒
1.
This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016 相似文献
2.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
3.
提出了一种基于垂直线阵的系统,给出了定位模型,并简要介绍了其定位原理.利用由时延引入的距离、高低角和观测得到的方位角信息,建立了三维坐标系下的状态方程和观测方程.通过理论分析和仿真计算,讨论了声速测量误差、时延估计误差和阵元位置误差对系统定位精度的影响,给出了时延估计误差的克拉美-罗下界.综合时延估计、基线横纵扰动、三类误差的影响,在一定条件下,对目标距离估计的相对误差可控制在20%以内. 相似文献
4.
给出了一种基于最大后验概率候选集更换法的多故障诊断策略,并深入阐述了基于最大后验概率候选集更换法的形式化描述,分析了对单故障诊断和多故障诊断的计算模型,提出了基本的故障诊断算法——改进二进制粒子群算法,并对抽象实例进行验证,结果表明,采用改进BPSO算法能有效地求解基于最大后验概率候选集更换法的多故障诊断问题。 相似文献
5.
6.
Xiangtong Qi 《海军后勤学研究》2005,52(4):312-320
Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
7.
Ji Hwan Cha 《海军后勤学研究》2006,53(3):226-234
Burn‐in procedure is a manufacturing technique that is intended to eliminate early failures of system or product. Burning‐in a component or system means to subject it to a period of use prior to being used in field. Generally, burn‐in is considered expensive and so the length of burn‐in is typically limited. Thus, burn‐in is most often accomplished in an accelerated environment in order to shorten the burn‐in process. A new failure rate model for an accelerated burn‐in procedure, which incorporates the accelerated ageing process induced by the accelerated environmental stress, is proposed. Under a more general assumption on the shape of failure rate function of products, which includes the traditional bathtub‐shaped failure rate function as a special case, upper bounds for optimal burn‐in time will be derived. A numerical example will also be given for illustration. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
8.
9.
综合性大学师范类学生学习倦怠现状研究 总被引:1,自引:0,他引:1
本文用连榕等参照Maslach编制的《大学生学习倦怠调查量表》对师范类专业大学生进行问卷调查,旨在探讨综合性大学中师范类学生学习倦怠状况。结果表明:学生的学习倦怠处于中等程度。男生的学习倦怠程度显著高于女生;不同年级的学生在学习倦怠的各个维度上差异显著;不同专业学生学习倦怠状况差异显著,理科最为严重;城镇学生的学习倦怠程度和农村学生差异不显著。 相似文献
10.
This article proposes two dual‐ascent algorithms and uses each in combination with a primal drop heuristic embedded within a branch and bound framework to solve the uncapacitated production assembly distribution system (i.e., supply chain) design problem, which is formulated as a mixed integer program. Computational results indicate that one approach, which combines primal drop and dual‐ascent heuristics, can solve instances within reasonable time and prescribes solutions with gaps between the primal and dual solution values that are less than 0.15%, an efficacy suiting it for actual large‐scale applications. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献