You Zhao;Rui Hou;Ying-Ju Chen; 《海军后勤学研究》2024,71(5):693-708

Recent years have witnessed e-commerce platforms that voluntarily invest in new digital technologies to help their suppliers reduce production costs. To examine its impact on channel structure, we develop a supply chain model consisting of a supplier and an e-commerce platform who purchases products from the supplier at a wholesale price and sells them to end markets. In addition, the supplier has the option to accept the marketplace by paying a commission fee charged by the platform. We show that the presence of voluntary investment on production improvement can overturn some classical insights from prior studies. For example, a higher marketplace commission fee can lead to a lower selling quantity in the marketplace, but a higher order quantity in the reselling channel under certain conditions. This stands in strict contrast to the opposite finding when the platform invests instead on demand enhancement. In addition, previous studies suggest that offering the supplier the marketplace option is beneficial to the supplier but is detrimental to the platform. However, with voluntary investment, the platform can benefit from allowing the supplier to encroach via the marketplace, and in some situations the supplier suffers from having such an option. We find that the commission fee and the production cost are two interacting forces steering equilibrium decisions for supply chain members, and we characterize the concise operating regimes for the channel structure choices on behalves of the supplier and the platform. A number of extensions are discussed, including product substitution level, investment cost structure, whether the quantity decisions are made simultaneously or sequentially, voluntary investment timing, and endogenous commission fee.  相似文献   

    

I-Chen Lee  Sheng-Tsaing Tseng  Yili Hong 《海军后勤学研究》2020,67(6):469-483

The accelerated degradation test (ADT) is an efficient tool for assessing the lifetime information of highly reliable products. However, conducting an ADT is very expensive. Therefore, how to conduct a cost-constrained ADT plan is a great challenging issue for reliability analysts. By taking the experimental cost into consideration, this paper proposes a semi-analytical procedure to determine the total sample size, testing stress levels, the measurement frequencies, and the number of measurements (within a degradation path) globally under a class of exponential dispersion degradation models. The proposed method is also extended to determine the global planning of a three-level compromise plan. The advantage of the proposed method not only provides better design insights for conducting an ADT plan, but also provides an efficient algorithm to obtain a cost-constrained ADT plan, compared with conventional optimal plans by grid search algorithms.  相似文献   

    

Xin Chen  Zhisong Chen 《海军后勤学研究》2013,60(6):512-523

Consider a manufacturer serving a set of retail stores each of which faces deterministic demands in a finite planning horizon. At the beginning of the planning horizon, the production capacity of the manufacturer is built, followed by production, outsourcing to third party manufacturers if necessary and distribution to the retail stores. Because the retail stores are usually managed by different managers who act as independent profit centers, it is desirable that the total cost is divided among the retail stores so that their incentives can be appropriately captured and thus efficient operations can be achieved. Under various conditions, we prove that there is a fair allocation of costs among the retail stores in the sense that no subset of retail stores subsidizes others, or equivalently, the resulting capacity investment game has a nonempty core, that is, the capacity investment game is a balanced game. In addition, our proof provides a mechanism to compute a fair cost allocation. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 512–523, 2013  相似文献   

    

Anthony G. Heyes  Catherine Liston‐Heyes 《Defence and Peace Economics》2013,24(4):289-299

In recent years military procurement agencies have used “progress payments” in contracting. Although, overall, the adoption of such a policy may well have contributed to a decrease in total costs of procurement, we identify a class of inefficiencies that are likely to have been generated by it.  相似文献   

    

Rainer Kolisch  Christian Heimerl 《海军后勤学研究》2012,59(2):111-127

Scheduling IT projects and assigning the project work to human resources are an important and common tasks in almost any IT service company. It is particularly complex because human resources usually have multiple skills. Up to now only little work has considered IT‐specific properties of the project structure and human resources. In this article, we present an optimization model that simultaneously schedules the activities of multiple IT projects with serial network structures and assigns the project work to multiskilled internal and external human resources with different efficiencies. The goal is to minimize costs. We introduce a metaheuristic that decomposes the problem into a binary scheduling problem and a continuous staffing problem where the latter is solved efficiently by exploiting its underlying network structure. For comparison, we solve the mixed–binary linear program with a state–of–the–art commercial solver. The impacts of problem parameters on computation time and solution gaps between the metaheuristic and the solver are assessed in an experimental study. Our results show that the metaheuristic provides very favorable results in considerable less time than the solver for midsize problems. For larger problems, it shows a similar performance while the solver fails to return feasible solutions. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 111–127, 2012  相似文献   

    

Gur Mosheiov  Vitaly A. Strusevich 《海军后勤学研究》2017,64(3):217-224

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017  相似文献   

    

Majid Al‐Gwaiz  Xiuli Chao  H. Edwin Romeijn 《海军后勤学研究》2016,63(5):367-373

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016  相似文献   

    

Qinan Wang  Ruifang Wang 《海军后勤学研究》2005,52(7):645-658

Although quantity discount policies have been extensively analyzed, they are not well understood when there are many different buyers. This is especially the case when buyers face price‐sensitive demand. In this paper we study a supplier's optimal quantity discount policy for a group of independent and heterogeneous retailers, when each retailer faces a demand that is a decreasing function of its retail price. The problem is analyzed as a Stackelberg game whereby the supplier acts as the leader and buyers act as followers. We show that a common quantity discount policy that is designed according to buyers' individual cost and demand structures and their rational economic behavior is able to significantly stimulate demand, improve channel efficiency, and substantially increase profits for both the supplier and buyers. Furthermore, we show that the selection of all‐units or incremental quantity discount policies has no effect on the benefits that can be obtained from quantity discounts. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   

    

Guohua Wan  Xiangtong Qi 《海军后勤学研究》2010,57(2):159-171

In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   

    

Mehmet Önal  H. Edwin Romeijn 《海军后勤学研究》2010,57(2):172-187

We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献