排序方式: 共有53条查询结果,搜索用时 0 毫秒
51.
《Applied Mathematical Modelling》2014,38(19-20):4640-4651
In this paper, we consider a retrial and repairable multi-component system with mixed warm and cold standby components. It is assumed that the failure times of primary (operating) and warm standby components follow exponential distributions. When a component fails, it is sent to a service station with a single server (repairman) and no waiting space. The failed component is repaired if the server is idle and it has to enter an orbit if the server is busy. The failed component in the orbit will try to get the repair service again after an exponentially distributed random time period. The repair time also has an exponential distribution. The mean time-to-failure, MTTF, and the steady-state availability, AT(∞), are derived in this retrial and repairable system. Using a numerical example, we compare the systems with and without retrials in terms of the cost/benefit ratios. Sensitivity analysis for the mean time-to-failure and the steady-state availability are investigated as well. 相似文献
52.
We consider the system availability behavior of a one-unit repairable system when the failure and the repair times are generated by a stationary dependent sequence of random variables. We obtain the general expression for the point availability, and discuss the nature of the availability measure for two time series models: a first-order exponential moving average process and a first-order exponential autoregressive process. 相似文献
53.
A single machine scheduling problem with availability constraints and sequence-dependent setup costs
Francisco Ángel-Bello Ada Álvarez Joaquín Pacheco Iris Martínez 《Applied Mathematical Modelling》2011
We study a single machine scheduling problem with availability constraints and sequence-dependent setup costs, with the aim of minimizing the makespan. To the authors’ knowledge, this problem has not been treated as such in the operations research literature. We derive in this paper a mixed integer programming model to deal with such scheduling problem. Computational tests showed that commercial solvers are capable of solving only small instances of the problem. Therefore, we propose two ways for reducing the execution time, namely a valid inequality that strengthen the linear relaxation and an efficient heuristic procedure that provides a starting feasible solution to the solver. A substantial gain is achieved both in terms of the linear programming relaxation bound and in terms of the time to obtain an integer optimum when we use the enhanced model in conjunction with providing to the solver the solution obtained by the proposed heuristic. 相似文献