It is a NP-hard problem to schedule a list of nonresumable jobs to the available intervals of an availability-constrained single machine to minimize the scheduling length. This paper transformed this scheduling proble...It is a NP-hard problem to schedule a list of nonresumable jobs to the available intervals of an availability-constrained single machine to minimize the scheduling length. This paper transformed this scheduling problem into a variant of the variable-sized bin packing problem, put forward eight bin packing algorithms adapted from the classic one-dimensional bin packing problem and investigated their performances from both of the worst-case and the average-case scenarios. Analytical results show that the worst-case performance ratios of the algorithms are not less than 2. Experimental results for average cases show that the Best Fit and the Best Fit Decreasing algorithm outperform any others for independent and precedence-constrained jobs respectively.展开更多
Condition-based maintenance(CBM) is receiving increasing attention in various engineering systems because of its effectiveness. This paper formulates a new CBM optimization problem for continuously monitored degrading...Condition-based maintenance(CBM) is receiving increasing attention in various engineering systems because of its effectiveness. This paper formulates a new CBM optimization problem for continuously monitored degrading systems considering imperfect maintenance actions. In terms of maintenance actions,in practice, they scarcely restore the system to an as-good-as new state due to residual damage. According to up-to-data researches, imperfect maintenance actions are likely to speed up the degradation process. Regarding the developed CBM optimization strategy, it can balance the maintenance cost and the availability by the searching the optimal preventive maintenance threshold.The maximum number of maintenance is also considered, which is regarded as an availability constraint in the CBM optimization problem. A numerical example is introduced, and experimental results can demonstrate the novelty, feasibility and flexibility of the proposed CBM optimization strategy.展开更多
文摘It is a NP-hard problem to schedule a list of nonresumable jobs to the available intervals of an availability-constrained single machine to minimize the scheduling length. This paper transformed this scheduling problem into a variant of the variable-sized bin packing problem, put forward eight bin packing algorithms adapted from the classic one-dimensional bin packing problem and investigated their performances from both of the worst-case and the average-case scenarios. Analytical results show that the worst-case performance ratios of the algorithms are not less than 2. Experimental results for average cases show that the Best Fit and the Best Fit Decreasing algorithm outperform any others for independent and precedence-constrained jobs respectively.
基金supported by the National Natural Science Foundation of China(61873122)the Priority Academic Program Development of Jiangsu Higher Education Institutions。
文摘Condition-based maintenance(CBM) is receiving increasing attention in various engineering systems because of its effectiveness. This paper formulates a new CBM optimization problem for continuously monitored degrading systems considering imperfect maintenance actions. In terms of maintenance actions,in practice, they scarcely restore the system to an as-good-as new state due to residual damage. According to up-to-data researches, imperfect maintenance actions are likely to speed up the degradation process. Regarding the developed CBM optimization strategy, it can balance the maintenance cost and the availability by the searching the optimal preventive maintenance threshold.The maximum number of maintenance is also considered, which is regarded as an availability constraint in the CBM optimization problem. A numerical example is introduced, and experimental results can demonstrate the novelty, feasibility and flexibility of the proposed CBM optimization strategy.
