in this paper, the study deals with the lead time and setup reduction problem in the vendor-purchaser integrated inventory model. the cost of capital (i.e., opportunity cost) is one of the key factors in making the inventory and investment decisions. lead time is an important element in any inventory system. the proposed model is presents an integrated inventory model with controllable lead tim...

Activity-based costing (ABC) system more precisely allocates the overhead costs to cost objects (products, services or customers) than traditional costing systems. In ABC, resources are consumed by the activities, and multiple cost drivers are used to allocate the costs of activities to the products. The selection of activity and cost drivers is then highly significant. Using too few cost drive...

Because dynamic memory management is an important part of a large class of computer programs, high-performance algorithms for dynamic memory management have been, and will continue to be, of considerable interest. Experience indicates that for many programs, dynamic storage allocation is so important that programmers feel compelled to write and use their own domainspecific allocators to avoid t...

This paper studies coordination and competition issues in a closed-loop supply chain. The supply chain consists of two competing manufacturers who collect the used-product for remanufacturing through a common retailer. We obtain the optimal wholesale prices, and the optimal fraction of collection for the two cases: case1 (uncoordinated system) and case2 (channel-coordinated system). Furthermore...

Given a collection of robots sharing a common environment, assume that each possesses an individual roadmap for its C-space and a cost function for attaining a goal. Vector-valued (or Pareto) optima for collision-free coordination are by no means unique: in fact, continua of optimal coordinations are possible. However, for cylindrical obstacles (those defined by pairwise interactions), we prove...

Network lifetime maximization is a critical problem for longterm data collection in wireless sensor networks. For large-scale networks, distributed and self-adaptive solutions are highly desired. In this paper, we investigate how to optimize the network lifetime by a localized method. Specifically, the network lifetime maximization problem is converted to a localized cost-balancing problem with...

We consider the problem of optimally arranging a collection of query operators into a pipelined execution plan in the presence of precedence constraints among the operators. The goal of our optimization is to maximize the rate at which input data items can be processed through the pipelined plan. We consider two different scenarios: one in which each operator is fixed to run on a separate machi...