查看更多>>摘要:For an efficient and cost effective utilization of the resources, queue length as well as server content distribution plays a noteworthy role. Dealing with manufacturing systems or telecommunications networks, we may encounter server’s breakdown which definitely effects queue length, waiting time of customers and cost of the system. We may also come across the situations where server performs the close-down works or may take the vacation of random time whenever enough number of customers are not available to start the service. The main objective of this paper is to analyze a queueing system with server’s breakdown, close-down time, multiple vacation and batch-size-dependent service mechanism. More precisely, we focus to derive the bivariate probability generating function of the joint queue and server content distribution at service completion epoch.We extract those probabilities and present them in a simplified form in terms of roots of the characteristic equation. We also obtain the probabilities at arbitrary epoch using which we acquire marginal distributions and performance measures. At the end, numerical examples with assorted significant distributions are provided which gives an insight to the readers and practitioners.
查看更多>>摘要:If the manufacturer can efficiently reduce costs and boost overall profits throughout the supply chain, he can send some incremental surplus to the retailer to motivate him to share his precise demand information. We study a two-period dual-channel supply chain where a manufacturer sells through a retailer with an advantage in demand information. The manufacturer can encroach and use production learning effects to reduce costs. Based on six scenarios under the “encroachment-dominated and production-learning effect-dominated and dual-factor” approaches, we investigated how the manufacturer’s encroachment and the production-learning effect affected the retailer’s decisions to share information. Some interesting results are obtained. First, a single-win, win-win, or lose-lose situation is generated for the supply chain participants by the dynamic competition mechanism under the combined effects of encroachment and the production learning effect. When more ambiguous demand information is cooperatively provided, both the retailer and manufacturer will benefit from information sharing. The win-win area increases with higher direct selling costs, whereas the win-win area decreases with increased production learning effects. Second, the retailer’s information sharing benefits more from a higher level of the production learning effect when demand information is unclear, and information sharing benefits more from a lower level of the production learning effect when demand information is more accurate. In addition, in terms of profitability following information sharing, we ultimately find that implementing both cost cutting and channel expansion based on unilateral payment contracts is the best incentive strategy to encourage retailers to share information. Finally, we obtain some management insights that support supply chain parties in making decisions regarding the resolution of channel conflicts and the realization of information cooperation.
查看更多>>摘要:This paper presents a novel algorithm for solving multilevel monoobjective decentralized linear programming problems (ML-MO-DLPPs). Our approach represents a refined adaptation of Sinha and Sinha’s linear programming method, enhanced by the development of an interval reduction map, which dynamically refines the decision variable intervals based on the influence of decisions made at preceding levels. Each stage of the algorithm’s construction is thoroughly analyzed. The algorithm’s effectiveness is demonstrated through a comprehensive numerical example, highlighting its practical applicability to resource management problems. Particular emphasis is placed on its application to vaccination planning in long-term care facilities during the COVID-19 pandemic, addressing the optimization of resource allocation with a strong focus on the equitable distribution of COVID-19 vaccines.
查看更多>>摘要:A tree t-spanner of a graph G is a spanning tree T in which the distance between any two adjacent vertices of G is at most t. The smallest t for which G has a tree t-spanner is called the tree stretch index of G, denoted by σT (G) = t. The objective of the t-admissibility problem is to determine whether the tree stretch index of a graph, denoted by σT (G), is less than or equal to a given value t. Given a graph with n vertices and m edges, the recognition of 2-admissible graphs can be accomplished in O(n + m) time. In contrast, t-admissibility is NP-complete for t ≥ 4. Furthermore, determining whether t = 3 remains an open problem, despite more than two decades of research. Given the pivotal role structural knowledge plays in classifying the complexity of 3-admissibility, this paper presents structural characterizations that yield simpler and faster algorithms for checking 2 and 3-admissibility in families of graphs with few P_4’s and (k, ℓ)-graphs. Furthermore, with regard to (0, ℓ)-graphs, we present lower and upper bounds on the tree stretch index of these graphs and characterize graphs whose tree stretch indexes are equal to the proposed upper bound. Finally, we prove that t-admissibility is NP-complete even for line graphs of subdivided graphs.
查看更多>>摘要:Several countries around the world undergo a lot of economic losses due to electricity quality problems every year. Electricity supply chain (ESC) enterprises can effectively reduce economic losses by investing in electricity quality (EQ). Considering the investment decision-making problem of EQ in the ESC and the characteristics of peak-valley pricing, corresponding models for EQ invested by electricity generators (EG) and electricity retailers (ER) were developed in this work. The following conclusions were obtained from this study: (1) The EQ and the electricity prices during peak and valley periods (PVP) as well as the electricity demand during PVPs decreased with the increase in the electricity quality investment cost coefficient (EQICC); (2) When the EQICC is low, the EQ input by the EG can provide lower electricity prices during PVP. On the contrary, when the EQICC is high, the EQ investment of the ER provides lower electricity prices during PVP. (3) ER investing in EQ can bring higher EQ and profits than EG.
查看更多>>摘要:In the modern agricultural system, the necessity for greenhouses is increasingly demanding due to unfavorable climatic conditions that hugely impact crop yields. The production of essential but very much weather-sensitive crops like tomatoes, beans, etc, can be improved by considering a greenhouse environment by regulating temperature, humidity, etc. In West Bengal’s lush plains tomato production has not been able to keep up with the growing demand, and prices for tomatoes in the state’s major cities have increased significantly in the recent past. However, designing the ideal greenhouse entails some ambiguity and complexity, given the variability in the climatic patterns and crop requirements. This uncertainty can be efficiently examined utilizing cylindrical neutrosophic set (CNS), which helps to manage the ambiguous and contradictory information inherent in decision-making processes, resulting in more exact and reliable greenhouse planning. Furthermore, the Dombi logarithmic law produces a very strong and consistent output result with a slight variation in operating parameters. In this research article, we have applied our proposed decision-making process to determine the best greenhouse site for cultivating tomato crops. For this purpose, we have defined Dombi logarithmic aggregation operational laws in the framework of cylindrical neutrosophic numbers (CNN) and utilized these laws to establish a new aggregation operator namely cylindrical neutrosophic Dombi weighted logarithmic aggregation operator (CN DW LA ). The said aggregation operational laws & aggregation operator have been applied to present a new and novel decision-making process where full consistency method (FUCOM) and multi-objective optimization (MOO) have been integrated and embedded fruitfully. Here, the objective functions were formulated using the concept of a single-layer neural network and then MOO and FUCOM methods are implemented to assess criterion weights. We have resolved the most favorable pareto optimal solution derived from MOO by employing simulation and the method for order of preference by similarity to ideal solution (TOPSIS) approach. We also discovered that measurement alternatives and ranking according to compromise solution (MARCOS) and the multi-objective optimization on the basis of ratio analysis (MOORA) methods have not been utilized in the CN environment. Therefore, we have applied our proposed decision-making method with MARCOS and MOORA techniques to determine the optimal greenhouse site for tomato production in West Bengal. An exhaustive sensitivity and comparison analysis have been conducted to assess the stability and robustness of our multi-criteria group decision-making (MCGDM) method. The analysis of our study points out that South Bengal is the most appropriate greenhouse place for cultivating tomatoes in West Bengal.
查看更多>>摘要:To achieve the ultimate objective of multi-dimensional sustainable development of the supply chain system, this paper examines the decision and coordination of the sustainable supply chain (SSC) from the dimensions of environment, society, and governance. Based on a dual-channel collecting structure, this study constructs six supply chain decision models considering two corporate social responsibility (CSR) implementers and three channel leadership structures. The findings reveal that in the SSC with a channel leader, it is most beneficial for the game follower to implement CSR from the perspective of maximising the total benefit to the supply chain and social welfare. The selection of the optimal channel leadership hinges on the trade-off between the collecting cooperation fees and the degree of the member’s CSR implementation. Finally, this research proposes a revenue-responsibility sharing contract to achieve the perfect coordination of the SSC. Our results can function as guidelines for establishing an environmental-friendly SSC system.
查看更多>>摘要:Narushima et al. [SIAM J. Optim. 21 (2011) 212-230] proposed a three-term search direction that guarantees the sufficient descent condition. Building upon this work, we introduce a control factor to refine the search direction, which not only ensures the sufficient descent property but also possesses the trust-region feature, independent of the specific line search strategy. Furthermore, we extend the modified search direction to solve constrained nonlinear equations by employing a hyperplane projection technique. To enhance efficiency, we integrate an inertial acceleration mechanism, leading to an inertial variant of the proposed method. We rigorously establish the global convergence of the inertial method, even in the absence of Lipschitz continuity in the underlying mapping. Additionally, under appropriate conditions, we prove that the method achieves a linear convergence rate. Numerical experiments validate the effectiveness of our methods, demonstrating their superior performance in solving constrained nonlinear equations and restoring blurred images corrupted by Gaussian noise.
查看更多>>摘要:Given a graph G=(V,E), a double Roman dominating function (DRDF) on a graphs a function:V →{0, 1, 2, 3}satisfying the condition that every vertex u for which(u)=0 is adjacent to at least one vertex v for which f(v) = 3 or two vertices v1 and v2 for which f(v1)=f(v2) = 2, and every vertex for which f(u) = 1 is adjacent to at least one vertex v for which f(v) ≥ 2. Theweight w(f) of a double Roman dominating function f is the value w(f)=∑_(u∈V) f(u). The minimum weight of a double Roman dominating function on a graph G is called the double Roman domination number of G, denoted by γdR(G). We say that G is k-γdR-edge critical, if γdR(G+e) <γdR(G) for each e∈E(G), where G is the complement of G, and k-γdR-edge supercritical if γdR(G)=k anddR(G+e)=γdR(G)−2 for every edge e∈E(G). In this paper, we characterize γdR-edge critical trees, answering a problem posed by Nazari-Moghaddam and Volkmann (Discrete Math. Algorithms App. 12 (2020) 2050020). Moreover, we investigate connected-γdR-edge supercritical graphs for k∈{5, 6, 7, 8}. Mathematics Sub ject Classiifcation. 05C69.
查看更多>>摘要:This study aims to investigate a retailer’s optimal decisions under “Value Increasing” promotion, where speculative consumers will deliberately purchase add-on items to qualify for discounts if the purchase amount is less than the “Value Increasing” promotional threshold and then return the add-on items after successful payment. The models without and with the “Value Increasing” promotion are established to investigate the effects of speculative consumers’ add-on items refund behavior on the optimal pricing strategies and the optimal profits. The results show that participating in the “Value Increasing” promotional campaigns does not always benefit retailers. When the promotional discounts degree meets the incentive compatibility conditions, a low probability of the product being added by speculative consumers or a small proportion of speculative consumers makes retailers benefit more from participating in the “Value Increasing” promotional campaigns. However, when these conditions are not met, not participating in the “Value Increasing” promotion is better for retailers. Moreover, compared to without “Value Increasing” promotional campaigns, retailers will set a higher regular price to offset the losses associated with speculative returns under the “Value Increasing” promotional campaigns, which may result in consumers’ final price after the discount not necessarily be lower than the price they would pay under non-promotional campaigns.