排序方式: 共有164条查询结果,搜索用时 15 毫秒
151.
152.
153.
Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001 相似文献
154.
We study competitive due‐date and capacity management between the marketing and engineering divisions within an engineer‐to‐order (ETO) firm. Marketing interacts directly with the customers and quotes due‐dates for their orders. Engineering is primarily concerned with the efficient utilization of resources and is willing to increase capacity if the cost is compensated. The two divisions share the responsibility for timely delivery of the jobs. We model the interaction between marketing and engineering as a Nash game and investigate the effect of internal competition on the equilibrium decisions. We observe that the internal competition not only degrades the firm's overall profitability but also the serviceability. Finally, we extend our analysis to multiple‐job settings that consider both flexible and inflexible capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
155.
给出了一种混合部署的多个导弹营的阵地多要素选址决策方法,运用了模糊关系合成矩阵,将各种情况下的多要素导弹阵地选址问题转化为模糊指派问题,并运用了匈牙利算法进行求解,最后给出了实际算例. 相似文献
156.
宋一中 《军械工程学院学报》1992,(3)
装备修理是我军一项计划性强、涉及面广和费用颇高的系统工作。本文首先系统分析了装备修理的组织过程。在此基础上,建立了适用于总部、军区等上下各级装备修理任务分配的数学规划模型,并对模型进行了讨论,同时对模型中目标函数的获取提供了一条可行的技术途径。最后,举例说明了该模型的应用。 相似文献
157.
158.
Petri网在防空C~3I系统建模与分析中的应用 总被引:3,自引:1,他引:2
针对野战防空系统中的火力分配问题,首先为旅营两级防空系统建立了Petri网模型,并运用时间Petri网理论对其进行了时延分析,论述了为野战防空火力分配建立辅助决策系统的重要性。最后利用谓词Petri网描述了火力分配的推理过程,为有效分析战术决策的正确性提供了依据和思路 相似文献
159.
160.
In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献