Medium Term Production Management for Cyclic Deliveries

The growing quality and delay requirements have catalyzed the emergence of new commercial paradigms, which have strongly modified the customer–supplier relationship. Customers and suppliers become more and more linked with contracts or global orders spanned over a relatively important period. This paper, examines a type of contract which specifies a fixed and cyclic delivery dates with delivery quantities varying between a min and a max values. The exact delivery quantities are usually known only few days before the delivery. A company which produces n items on a bottleneck facility is considered; each item is confronted to a cyclic demand and has an important holding cost in comparison to set-up costs. We propose heuristic approaches, to build, in a medium term level, cyclic production schedules. These schedules face the demand and minimize a total cost function composed of holding and set-up costs. An experiment is proposed in order to prove the effectiveness of our approaches.     

Using a nonparametric technique to measure the cost efficiency of postal delivery branches

A multiple-input and multiple-output model for measuring the cost efficiency of postal delivery branches is proposed. We analyze the complete postal network of the Serbian post delivery offices, which includes 1,194 post office branches. To compare the branches that operate under the same or similar conditions, the branches are grouped into 18 clusters by implementing the appropriate clustering algorithm. This enables a three-level analysis: branches–clusters–network. The cost efficiency of the branches is measured using data envelopment analysis. The efficiency of a particular cluster is calculated as an average cost efficiency score of the branches that belong to this cluster, and finally, the efficiency of the postal delivery network is assessed. The distribution of cost efficiency scores per clusters takes values from 15 to 92 %. At the level of the total network, the cost efficiency is 40 %, which indicates that there are possibilities for improvement. To obtain more specific guidelines, that is, the decomposition of cost efficiency into pure technical efficiency, the scale efficiency and allocative efficiency were assessed for each cluster and for the total delivery network. This research is beneficial to policy makers defining the scope of universal service obligation and to company managers who want to optimize the postal network. For example, the results of this study indicate that, at a minimum, 794 delivery branches could improve their efficiency by resource reallocation.     

Batch Delivery Scheduling on a Single Machine

The problem of partitioning a set of independent and simultaneously available jobs into batches and sequencing them for processing on a single machine is presented. Jobs in the same batch are to be delivered together, upon completion of the last job in the batch. Jobs finished before this time have to wait until delivery. There are a delivery cost depending on the number of batches formed and an earliness cost for jobs finished before delivery. The dynamic programming approach to minimizing the total cost is considered, yielding two pseudopolynomial algorithms when the number of batches has a fixed upper bound. A polynomial algorithm for a special case of the problem is also presented.     

An integrated producer–buyer supply chain with delivery cost under stochastic transportation time

An integrated producer–buyer supply chain is used to simultaneously determine the optimum levels of the safety stock, delivery quantity, and number of shipments in this paper. The scenario is created by scheduling a single-setup at the producer with multiple deliveries to the buyer, and all shipments to the buyer are equal-sized batches. This study attempts to study the effects of delivery cost and transportation time, assumes that there is a stochastic transportation time between both producer and buyer, and that shortages are allowed. The transportation time is assumed to be Weibull distributed. The objective functions of the integrated model include the setup cost, inventory carrying cost, and delivery cost. We analyze the scenario where the delivery cost is explicitly considered in the model rather than considered as part of the fixed ordering cost or insignificant. A numerical example is also presented to demonstrate the proposed model using actual shipping rate data. In particular, the results show that when the producer's and buyer's carrying costs are low, and/or the mean time of transportation and delivery costs are high, then this can benefit both parties with regard to sharing total profit.     

Fuzzy multi-objective vendor selection under lean procurement

This paper investigates a fuzzy multi-objective vendor selection program under lean procurement based on cost minimization, delivery schedule violation minimization, and maximizing the quality level of the purchased quantity. Specifically, the paper incorporates the vendor production capacity uncertainty into the model to identify an appropriate selection policy for vendors under practical operating conditions. The use of a soft time-window mechanism for the vendor selection model enables decision makers to further incorporate a time based performance metric for vendor evaluation, based on the degree of urgency or need for a part. A solution algorithm using fuzzy AHP is proposed. The results of a numerical example suggest that decision makers prefer vendors who can promise tighter delivery schedules rather than on cost or quality. A sensitivity analysis of the soft time-window on the achievement of the lean procurement objectives is also conducted.     

Single Supplier�CBuyer Integrated Inventory Model Under Multiple JIT Delivery and Stock-Dependent Demand

In this paper, an integrated inventory model for a supply chain comprising of single buyer and single supplier is studied when demand is stock-dependent and units in inventory deteriorate at a constant rate. The total cost of the integrated system consists of the transportation cost, inspection cost and the cost of less flexibility under the assumption of JIT deliveries. The total integrated cost of single-supplier and single-buyer is minimized with respect to number of inspections and deliveries, the cycle time of deliveries and the delivery size for the replenishment time. A numerical example is given to validate the model. The sensitivity analysis carried out suggests that the unit inspection cost, deterioration rate of units in inventory and stock-dependent parameter are the critical factors.     

考虑路径风险的需求不确定应急物流定位-路径问题

针对自然灾害对路网造成的破坏性和受灾点物资需求量的不确定性,综合考虑应急物流路径风险和物资分配的时间公平性,将路径风险定量化为路径通行能力风险、路径损毁风险和路径复杂性,基于鲁棒优化理论,以最小化车辆最长配送时间和应急物流系统总成本为目标,建立了双目标多物资定位-路径优化模型,采用遗传算法对其求解,以汶川地震应急救援相关数据为例进行了数据仿真实验。实验结果的对比分析表明:在考虑路径风险下,随着控制系数的增加,系统总成本和最长配送时间目标值均呈现增大的趋势;受灾点的物资需求扰动越大,构建应急物流系统的总成本越高。算例结果也验证了鲁棒优化方法在处理不确定需求方面的有效性,为解决自然灾害后应急设施点的开设和救援物资的安全及时准确配送提供了有效的方法。     

Managerial and economic impacts of reducing delivery variance in the supply chain

This paper addresses the managerial and economic impacts of improving delivery performance in a serial supply chain when delivery performance is evaluated with respect to a delivery window. Building on contemporary management theories that advocate variance reduction as the critical step in improving the overall performance of a system, we model the variance of delivery time to the final customer as a function of the investment to reduce delivery variance and the costs associated with untimely delivery (expected earliness and lateness). A logarithmic investment function is used and the model solution involves the minimization of a convex–concave total cost function. A numerical example is provided to illustrate the model and the solution procedure. The model presented provides guidelines for determining the optimal level of financial investment for reducing delivery variance. The managerial implications as well as the economic aspects of delivery variance reduction in supply chain management are discussed.     

Cost Functions in the Location of Depots for Multiple-Delivery Journeys

Most wholesale distribution is performed during multiple-delivery journeys. Mathematical methods of locating depots utilize simple functions of delivery data, e.g. weight and distance from the depot, to measure the delivery "cost"; the total "cost" is minimized to find the depot location.It is pointed out that the cost of a delivery is influenced by the occurrence of other deliveries. It is shown that, in a few examples, simple functions of the delivery data are not always good measures of variable cost, as measured by the length of journeys planned to carry out the same deliveries, and that the minimum points of the simple functions rarely coincide with the point of minimum variable cost. It is concluded that, subject to reservations, which are discussed, about the experiments, the use of simple cost functions to locate wholesale distribution depots will probably give misleading results.     

工件可转包加工的排序问题研究

研究工件可以转包加工的单台机排序问题: 有n个工件, 在零时刻已经到达一个单台机处, 每个工件可以由加工者自有的单台机器加工或者转包给其他机器加工. 如果工件被转包加工, 那么其完工时间等于在自有机器上的加工时间, 而产生的加工费用与在自有机器上加工的费用不同. 假设被转包加工的工件的完工时间和加工费用与转包加工机器的总负载没有关系.目标函数是最小化工件最大完工时间与总加工费用的加权和. 该问题已经被证明是NP-难的. 最后给出该问题的伪多项式时间最优算法, 并且提出一个完全多项式时间近似方案(FPTAS).     

The Coordination of Scheduling and Batch Deliveries

This paper considers several scheduling problems where deliveries are made in batches with each batch delivered to the customer in a single shipment. Various scheduling costs, which are based on the delivery times of the jobs, are considered. The objective is to minimize the scheduling cost plus the delivery cost, and both single and parallel machine environments are considered. For many combinations of these, we either provide efficient algorithms that minimize total cost or show that the problem is intractable. Our work has implications for the coordination of scheduling with batch delivery decisions to improve customer service.     

Single-machine common due window assignment and scheduling to minimize the total cost

In this paper we consider a single-machine common due window assignment and scheduling problem with batch delivery cost. The starting time and size of the due window are decision variables. Finished jobs are delivered in batches. There is no capacity limit on each delivery batch, and the cost per batch delivery is fixed and independent of the number of jobs in the batch. The objective is to find a job sequence, a delivery date for each job, and a starting time and a size for the due window that jointly minimize the total cost comprising earliness, weighted number of tardy jobs, job holding, due window starting time and size, and batch delivery. We provide some properties of the optimal solution and present polynomial-time algorithms for the problem.     

Supply chain models for an assembly system with preprocessing of raw materials

In this paper, we investigate the material procurement and delivery policy in a production system where raw materials enter into the assembly line from two different flow channels. The system encompasses batch production process in which the finished product demand is approximately constant for an infinite planning horizon. Two distinct types of raw materials are passed through the assembly line before to convert them into the finished product. Of the two types of raw materials, one type requires preprocessing inside the facility before the assembly operation and other group is fed straightway in the assembly line. The conversion factors are assigned to raw materials to quantify the raw material batch size required. To analyze such a system, we formulate a nonlinear cost function to aggregate all the costs of the inventories, ordering, shipping and deliveries. An algorithm using the branch and bound concept is provided to find the best integer values of the optimal solutions. The result shows that the optimal procurement and delivery policy minimizes the expected total cost of the model. Using a test problem, the inventory requirements at each stage of production and their corresponding costs are calculated. From the analysis, it is shown that the rate and direction change of total cost is turned to positive when delivery rates per batch reaches close to the optimal value and the minimum cost is achieved at the optimal delivery rate. Also, it is shown that total incremental cost is monotonically increasing, if the finished product batch size is increased, and if, inventory cost rates are increased. We examine a set of numerical examples that reveal the insights into the procurement-delivery policy and the performance of such an assembly type inventory model.     

自由作业的供应链排序研究

研究一类集成工件加工和发送的供应链排序模型,即研究如何安排工件在自由作业机器上加工,把加工完毕的工件分批发送给下游客户,使得含生产排序费用和发送费用的目标函数最优.这里,分别取工件最大送到时间和平均送到时间为生产排序费用;而发送费用是由固定费用和与运输路径有关的变化费用组成.利用排序理论和动态规划方法,构造了自由作业供应链排序问题的多项式时间近似算法,并分析算法的性能比.     

Supplier selection in make-to-order environment with risks

The problem of allocation of orders for parts among part suppliers in a customer driven supply chain with operational risk is formulated as a stochastic single- or bi-objective mixed integer program. Given a set of customer orders for products, the decision maker needs to decide from which supplier to purchase parts required for each customer order to minimize total cost and to mitigate the impact of delay risk. The selection of suppliers and the allocation of orders is based on price and quality of purchased parts and reliability of on time delivery. To control the risk of delayed supplies, the two popular percentile measures of risk are applied: value-at-risk and conditional value-at-risk. The proposed approach is capable of optimizing the supply portfolio by calculating value-at-risk of cost per part and minimizing mean worst-case cost per part simultaneously. Numerical examples are presented and some computational results are reported.     

具有可变配送费用和固定配送时刻的单机排序问题

研究了单机环境下生产与配送的协同排序问题.有多个工件需要在一台机器上进行加工,加工完的工件需要分批配送到一个客户.每批工件只能在固定的几个配送时刻出发,不同的配送时刻对应着不同的配送费用.我们的目标是找到生产与配送的协同排序,极小化排序的时间费用与配送费用的加权和.研究了排序理论中主要的四个目标函数,构建了单机情况下的具体模型,分析了问题的复杂性,对于配送费用单调非增的情况给出了它们的最优算法.     

Resource,service quality and performance triad: a framework for measuring efficiency of banking services

In this paper, we present the development of a theoretical framework for measuring the efficiency of banking services taking into account physical and human resources, service quality and performance. Expenditures on quality improvement efforts and the impact of service quality on financial outcomes have long intrigued researchers. Banks have traditionally focused on how to transform their physical resources to generate financial performance, and they inadvertently ignored the mediating intangible factor of service quality. A theoretical framework on the optimization triad of resource, service quality and performance is proposed here, thereby linking the marketing variables to the financial metrics. A measure for the return on quality is developed as the ratio of the potential improvements in financial performance by enhancement of service quality to the observed performance figures. Empirical results obtained from a study of 27 Indian public sector banks and their customers allow us to measure the impact of service quality on financial performance, optimal level of service quality that can be generated using existing resources and the opportunity cost for sub-optimal service delivery. Banks delivering better service are shown to have better transformation of resource to performance using superior service delivery as the medium. Our results confirm the linkage between resource, service quality and performance for services.     

Cost allocation in the Chinese postman problem

This paper considers a cost allocation problem that arises from a delivery problem associated with the Chinese postman problem (CPP). A delivery problem is described by a connected undirected graph in which each edge belongs to a different player, a cost function on the edges of this graph and a fixed vertex which is referred to as the post office. Assume that the post office is providing some service to the players. The nature of this service, which can be thought of as mail delivery, requires that a server will travel along the edges of the graph and returns to the post office. The cost allocation problem is concerned with the cost of providing the service to all players. A specific cost allocation rule is introduced and characterized. Further, the class of delivery problems gives rise to a new class of cooperative combinatorial optimization games called delivery games. It is shown that the outcome of the allocation rule with respect to a bridge-connected Euler graph is a core element of the corresponding delivery game.     

Large scale stochastic inventory routing problems with?split delivery and service level constraints

A stochastic inventory routing problem (SIRP) is typically the combination of stochastic inventory control problems and NP-hard vehicle routing problems, which determines delivery volumes to the customers that the depot serves in each period, and vehicle routes to deliver the volumes. This paper aims to solve a large scale multi-period SIRP with split delivery (SIRPSD) where a customer??s delivery in each period can be split and satisfied by multiple vehicle routes if necessary. This paper considers SIRPSD under the multi-criteria of the total inventory and transportation costs, and the service levels of customers. The total inventory and transportation cost is considered as the objective of the problem to minimize, while the service levels of the warehouses and the customers are satisfied by some imposed constraints and can be adjusted according to practical requests. In order to tackle the SIRPSD with notorious computational complexity, we first propose an approximate model, which significantly reduces the number of decision variables compared to its corresponding exact model. We then develop a hybrid approach that combines the linearization of nonlinear constraints, the decomposition of the model into sub-models with Lagrangian relaxation, and a partial linearization approach for a sub model. A near optimal solution of the model found by the approach is used to construct a near optimal solution of the SIRPSD. Randomly generated instances of the problem with up to 200 customers and 5 periods and about 400 thousands decision variables where half of them are integer are examined by numerical experiments. Our approach can obtain high quality near optimal solutions within a reasonable amount of computation time on an ordinary PC.     

Optimised crossover genetic algorithm for capacitated vehicle routing problem

This paper presents a genetic algorithm for solving capacitated vehicle routing problem, which is mainly characterised by using vehicles of the same capacity based at a central depot that will be optimally routed to supply customers with known demands. The proposed algorithm uses an optimised crossover operator designed by a complete undirected bipartite graph to find an optimal set of delivery routes satisfying the requirements and giving minimal total cost. We tested our algorithm with benchmark instances and compared it with some other heuristics in the literature. Computational results showed that the proposed algorithm is competitive in terms of the quality of the solutions found.