排序方式: 共有437条查询结果,搜索用时 15 毫秒
411.
Impact of tax reduction policies on consumer purchase of new automobiles: An analytical investigation with real data‐based experiments
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We investigate and compare the impact of the tax reduction policies implemented in the United States and China to stimulate consumer purchase of new automobiles and improve manufacturers' profits. The U.S. policy provides each qualifying consumer with a federal income tax deduction on state and local sales and excise taxes paid on the purchase price (up to a cutoff level), whereas the Chinese policy reduces the vehicle sales tax rate for consumers. We observe that these policy designs are consistent with the tax management system and the economic environment in the respective country. We analytically determine the effects of the two tax reduction policies on the automobile sales and the manufacturer's and the retailer's profits. Numerical examples are then used to provide insights on the importance of certain factors that influence the effects of the two policies. Finally, a numerical experiment with sensitivity analysis based on real data is conducted to compare the merits and characteristics of the two policies under comparable conditions. We find that the U.S. policy is better than the Chinese policy in stimulating the sales of high‐end automobiles, whereas the Chinese policy is better than the U.S. policy in improving the sales of low‐end automobiles. The U.S. policy is slightly more effective in increasing the profitability of the automobile supply chain; but, in general, the Chinese policy is more cost effective. The methodology developed herein can be used to evaluate other tax reduction policies such as those related to the purchase of energy‐saving vehicles and to serve as a decision model to guide the choice of alternative tax reduction policies. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 577–598, 2014 相似文献
412.
This article deals with supply chain systems in which lateral transshipments are allowed. For a system with two retailers facing stochastic demand, we relax the assumption of negligible fixed transshipment costs, thus, extending existing results for the single‐item case and introducing a new model with multiple items. The goal is to determine optimal transshipment and replenishment policies, such that the total centralized expected profit of both retailers is maximized. For the single‐item problem with fixed transshipment costs, we develop optimality conditions, analyze the expected profit function, and identify the optimal solution. We extend our analysis to multiple items with joint fixed transshipment costs, a problem that has not been investigated previously in the literature, and show how the optimality conditions may be extended for any number of items. Due to the complexity involved in solving these conditions, we suggest a simple heuristic based on the single‐item results. Finally, we conduct a numerical study that provides managerial insights on the solutions obtained in various settings and demonstrates that the suggested heuristic performs very well. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 637–664, 2014 相似文献
413.
Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this article, we study a biobjective economic lot‐sizing problem with applications, among others, in green logistics. The first objective aims to minimize the total lot‐sizing costs including production and inventory holding costs, whereas the second one minimizes the maximum production and inventory block expenditure. We derive (almost) tight complexity results for the Pareto efficient outcome problem under nonspeculative lot‐sizing costs. First, we identify nontrivial problem classes for which this problem is polynomially solvable. Second, if we relax any of the parameter assumptions, we show that (except for one case) finding a single Pareto efficient outcome is an ‐hard task in general. Finally, we shed some light on the task of describing the Pareto frontier. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 386–402, 2014 相似文献
414.
We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014 相似文献
415.
416.
We give necessary and sufficient conditions based on signatures to obtain distribution‐free stochastic ordering properties for coherent systems with exchangeable components. Specifically, we consider the stochastic, the hazard (failure) rate, the reversed hazard rate, and the likelihood ratio orders. We apply these results to obtain stochastic ordering properties for all the coherent systems with five or less exchangeable components. Our results extend some preceding results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
417.
418.
选择仅有切向位移分量的S2超声兰姆波模式,分别对其在自由单层钢板、有罐壁但无液体负载的单层钢板和有罐壁且有液体负载的单层钢板中的传播规律进行了数值模拟研究.计算结果表明,尽管罐壁和液体负载对超声兰姆波的传播行为产生了一定程度的影响,但仍可保证S2超声兰姆波模式的时域脉冲信号传播较远的距离.研究结果为采用超声兰姆波检测储... 相似文献
419.
We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
420.
The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献