Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations

We address a novel truck scheduling problem arising in crossdocking logistics, in which inbound trucks carry items (pallets) which must be sorted and loaded onto outbound trucks. We minimize the utilisation of the warehouse by focusing on the synchronisation between the different related trucks. The problem is to assign the trucks to the doors of the warehouse and sequence them, in order to minimize the total time spent in the system by the pallets. We discuss the complexity of the problem, showing that even with a single door the problem is NP-hard in general, and discuss some special cases.     

Modeling and solution of the joint quay crane and truck scheduling problem

This paper addresses the joint quay crane and truck scheduling problem at a container terminal, considering the coordination of the two types of equipment to reduce their idle time between performing two successive tasks. For the unidirectional flow problem with only inbound containers, in which trucks go back to quayside without carrying outbound containers, a mixed-integer linear programming model is formulated to minimize the makespan. Several valid inequalities and a property of the optimal solutions for the problem are derived, and two lower bounds are obtained. An improved Particle Swarm Optimization (PSO) algorithm is then developed to solve this problem, in which a new velocity updating strategy is incorporated to improve the solution quality. For small sized problems, we have compared the solutions of the proposed PSO with the optimal solutions obtained by solving the model using the CPLEX software. The solutions of the proposed PSO for large sized problems are compared to the two lower bounds because CPLEX could not solve the problem optimally in reasonable time. For the more general situation considering both inbound and outbound containers, trucks may go back to quayside with outbound containers. The model is extended to handle this problem with bidirectional flow. Experiment shows that the improved PSO proposed in this paper is efficient to solve the joint quay crane and truck scheduling problem.     

Evaluation of stock allocation policies in a divergent inventory system with shipment consolidation

In this paper we consider a one-warehouse N-retailer inventory system characterized by access to real-time point-of-sale data, and a time based dispatching and shipment consolidation policy at the warehouse. More precisely, inventory is reviewed continuously, while a consolidated shipment (for example, a truck) to all retailers is dispatched from the warehouse at regular time intervals. The focus is on investigating the cost benefits of using state-dependent myopic allocation policies instead of a simple FCFS (First-Come-First-Serve) rule to allocate shipped goods to the retailers. The analysis aims to shed some light on when, if ever, FCFS is a reasonable policy to use in this type of system? The FCFS allocations of items to retailers are determined by the sequence in which retailer orders (or equivalently customer demands) arrive to the warehouse. Applying the myopic policy enables the warehouse to postpone the allocation decision to the moment of shipment (from the warehouse) or the moments of delivery (to the different retailers), and to base it on the inventory information available at those times. The myopic allocation method we study is often used in the literature on periodic review systems.     

An Integrated Inventory-Routing System for Multi-item Joint Replenishment with Limited Vehicle Capacity

In this paper, we develop a mathematical programming approach for coordinating inventory and transportation decisions in an inbound commodity collection system. In particular, we consider a system that consists of a set of geographically dispersed suppliers that manufacture one or more non-identical items, and a central warehouse that stocks these items. The warehouse faces a constant and deterministic demand for the items from outside retailers. The items are collected by a fleet of vehicles that are dispatched from the central warehouse. The vehicles are capacitated, and must also satisfy a frequency constraint. Adopting a policy in which each vehicle always collects the same set of items, we formulate the inventory-routing problem of minimizing the long-run average inventory and transportation costs as a set partitioning problem. We employ a column generation approach to determine a lower bound on the total costs, and develop a branch-and-price algorithm that finds the optimal assignment of items to vehicles. We also propose greedy constructive heuristics, and develop a very large-scale neighborhood (VLSN) search algorithm to find near-optimal solutions for the problem. Computational tests are performed on a set of randomly generated problem instances.The work of this author was supported by a scholarship of the Faculty of Engineering of Ubonratchathani University, Ubonratchathani, Thailand., The work of this author was supported in part by the National Science Foundation under Grant No. DMI-0085682.     

Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost

Cross docking terminals allow companies to reduce storage and transportation costs in a supply chain. At these terminals, products of different types from incoming trucks are unloaded, sorted, and loaded to outgoing trucks for delivery. If the designated outgoing truck is not immediately available for some products, they are temporarily stocked in a small storage area available at the terminal. This paper focuses on the operational activities at a cross docking terminal with two doors: one for incoming trucks and another one for outgoing trucks. We consider the truck scheduling problem with the objective to minimize the storage usage during the product transfer inside the terminal. Our interest in this problem is mainly theoretical. We show that it is NP-hard in the strong sense even if there are only two product types. For a special case with fixed subsequences of incoming and outgoing trucks, we propose a dynamic programming algorithm, which is the first polynomial algorithm for this case. The results of numerical tests of the algorithm on randomly generated instances are also presented.     

Separate vs. joint replenishment policies with maximum storage requirement costs

Multi-item inventory problems give rise to the possibility of time-phasing the replenishments of different items over the inventory cycle. Such a policy reduces the peak storage requirement, compared to a policy of simultaneous replenishment. This, in turn, increases the amount of warehouse space which is permanently available for leasing throughout the cycle. However, where cost savings may be achieved through combining setups of different items, as in the well known joint replenishment problem, such a time-phasing policy may increase total setup costs. This paper considers the two item joint replenishment problem, where a cost (equivalent to the opportunity cost of warehouse space) attaches to the peak storage requirement which occurs within the inventory cycle. Existing joint replenishment models do not consider such costs, but their consideration suggests that joint replenishment is not always optimal. We analyze possible policies under both joint and separate replenishment, and provide optimal closed form solutions. A numerical example to illustrate the tradeoff between joint and separate replenishment is provided.     

Inventory Positioning in Multiple Product Supply Chains

In this paper we address the problem of inventory positioning, i.e., the determination of the supply chain node where inventory should be held, to minimize holding costs given a pre-specified order fill rate. A single-echelon inventory system with multiple products models the problem. The value of inventory is assumed to be an increasing function of the amount of processing performed at upstream nodes, while achieved fill-rates are dependent on the distance or time between the inventory storage and customer locations. We propose a novel analytical approach to solve the problem for the case of normally distributed demand that is based on iterative calculations of inventory holding costs at the various potential inventory locations.     

需求率基于库存的变质物品的两货栈模型

针对需求受库存水平影响的变质品的两货栈系统,本文首先考虑了允许缺货但缺货要补情形下,分别给出了L₁系统(库存系统只用自己的货栈存放物品)和L₂系统(库存系统使用自己货栈和租用货栈存放物品)时,销售商的库存和运输策略模型。其次给出了允许缺货但缺货不补L₁系统和L₂系统时,销售商的库存和运输策略,并对模型最优解作了相关分析,最后给出算例,给销售商实际的库存管理提供了理论依据。     

Stock Rationing in a Continuous Review Two-Echelon Inventory Model

In this paper we consider a 1-warehouse, N-retailer inventory system where demand occurs at all locations. We introduce an inventory model which allows us to set different service levels for retailers and direct customer demand at the warehouse. For each retailer a critical level is defined, such that a retailer replenishment order is delivered from warehouse stock if and only if the stock level exceeds this critical level. It is assumed that retailer replenishment orders, which are not satisfied from warehouse stock, are delivered directly from the outside supplier, instead of being backlogged. We present an analytical upper bound on the total cost of the system, and develop a heuristic method to optimize the policy parameters. Numerical experiments indicate that our technique provides a very close approximation of the exact cost. Also, we show that differentiating among the retailers and direct customer demand can yield significant cost reductions.     

Optimal transportation policies for production/inventory systems with an unreliable and a reliable carrier

In this paper, we consider a periodic-review make-to-order production/inventory system with two outbound transportation carriers: One carrier is reliable, the other carrier is less reliable but more economical. The objective is to find the optimal shipping policy that minimizes the total discounted transportation, inventory, and customer waiting costs. Under several scenarios, we characterize the optimal policy and present the structural properties for the optimal control parameters and the key performance measures. Our results provide managerial insights on how a manufacturer can effectively manage its transportation carriers and product shipment. We also discuss several possible extensions of the model.     

A deterministic order level inventory model for deteriorating items with two storage facilities

In this paper a deterministic inventory model is developed for a single deteriorating item which is stored in two different warehouses. A rented warehouse is used to store the excess units over the fixed capacity W of the own warehouse. The rented warehouse is assumed to charge higher unit holding cost than the own warehouse, but to offer a better preserving facility resulting in a lower rate of deterioration for the goods than the own warehouse. The optimal stock level for the beginning of the period is found and the model developed is shown to agree with the order level model for non deteriorating items with a single storage facility. An illustration to show the applicability of the model is also presented.     

Simple Models and Insights for Warehouse Sizing

This study is concerned with minimizing the total discounted cost of operating an inventory system and providing the warehouse space necessary to accommodate the replenishment lots, under the assumption of constant product demand. The use of an approximation objective function for the single-item case allows the optimal warehouse size as well as the ratio of relevant investment costs to relevant inventory costs to be written in closed-form. Based upon the value of this ratio, circumstances are identified under which an integrated approach is justified, and others under which the inventory policy and storage capacity can be determined sequentially. The multi-item version of the problem under study is solved by the Lagrangian multiplier method, given that no coordination takes place between the items. Finding the optimal Lagrange multiplier can be accomplished efficiently by the Newton–Raphson method.     

Credit financing in a two-warehouse environment for deteriorating items with price-sensitive demand and fully backlogged shortages

In the current global market, organizations use many promotional tools in order to increase their sales. One such tool is permissible delay in payments, i.e., the buyer does not have to pay for the goods purchased immediately rather can defer the payment for a prescribed period given by the supplier. This phenomenon motivates the retailer/buyer to order a large inventory lot so as to take full benefit of credit period. But the well decorated showroom (OW) with modern facilities has a limited storage capacity. Thus the retailer has to hire a rented warehouse to store the excess units. In this scenario, retailer usually adopts two types of dispatch policy: FIFO & LIFO, depending upon the situation, e.g., nature of items/deteriorating items, location of warehouse. Further in order to survive in the market, the retailer dynamically adjusts the prices of the goods to boost the demand and enhance the revenues.In the light of these facts, this paper develops an inventory model for deteriorating items with price-sensitive demand under permissible delay in payment in a two warehouse environment. Shortages are allowed and fully backlogged. The objective of this study is to find the optimal inventory and pricing policies so as to maximize the total average profit. Further, the different trade credit scenario has been exhibited with the help of a numerical example. A comprehensive sensitivity analysis has also been carried out to advocate the implication of FIFO and LIFO dispatch policy.     

Coordinated control of distribution supply chains in the presence of fuzzy customer demand

This paper considers a single product inventory control in a Distribution Supply Chain (DSC). The DSC operates in the presence of uncertainty in customer demands. The demands are described by imprecise linguistic expressions that are modelled by discrete fuzzy sets. Inventories at each facility within the DSC are replenished by applying periodic review policies with optimal order up-to-quantities. Fuzzy customer demands imply fuzziness in inventory positions at the end of review intervals and in incurred relevant costs per unit time interval. The determination of the minimum of defuzzified total cost of the DSC is a complex problem which is solved by applying decomposition; the original problem is decomposed into a number of simpler independent optimisation subproblems, where each retailer and the warehouse determine their optimum periodic reviews and order up-to-quantities. An iterative coordination mechanism is proposed for changing the review periods and order up-to-quantities for each retailer and the warehouse in such a way that all parties within the DSC are satisfied with respect to total incurred costs per unit time interval. Coordination is performed by introducing fuzzy constraints on review periods and fuzzy tolerances on retailers and warehouse costs in local optimisation subproblems.     

A Dynamic Distribution Model with Warehouse and Customer Replenishment Requirements

This paper addresses a multiperiod integrated model that plans deliveries to customers based upon inventories (at warehouse and customer locations) and vehicle routes. The model determines replenishment quantities and intervals at the warehouse, and distribution lots and delivery routes at customer locations. We investigate coordination of customer and warehouse replenishment decisions and illustrate their interdependence. Computational experience on randomly generated problems is reported. We show that ordering policy at the warehouse is a function of how goods are distributed to lower echelons and that coordination leads to cost reduction.     

An integrated material handling system for a truck assembly plant

The paper attempts to develop a more comprehensive analytical framework for examining the relative merits of alternative material handling and inventory strategies for a truck assembly plant. This model can be used to minimise handling in delivering requirements from the warehouse to the assembly line and from the unpacking area to the warehouse. The model is also designed to look at arrangements of the storage areas to increase the efficiency of material management. This model is based on extensions of the Vehicle Routing Problem. Solutions to the model have been obtained by an implementation of a Genetic Algorithm. The historical demand data of the plant are used to simulate and analyse the different strategies to statistically determine the best material handing and inventory strategies for the truck assembly plant. As a result of implementation, the efficiency of the current system has been increased by about 30%.     

Approximate analysis and optimization of batch ordering policies in capacitated supply chains

Devising manufacturing/distribution strategies for supply chains and determining their parameter values have been challenging problems. Linking production management to stock keeping processes improves the planning of the supply chain activities, including material management, culminating in improved customer service levels. In this study, we investigate a multi-echelon supply chain consisting of a supplier, a plant, a distribution center and a retailer. Material flow between stages is driven by reorder point/order quantity inventory control policies. We develop a model to analyze supply chain behavior using some key performance metrics such as the time averages of inventory and backorder levels, as well as customer service levels at each echelon. The model is validated against simulation, yielding good agreement of robust performance metrics. The metrics are then used within an optimization framework to design the supply chain so as to minimize expected total system costs. The outcome of the optimization framework specifies how to move inventory throughout the supply chain and how to set inventory control parameters, i.e., reorder levels and replenishment batch sizes.     

回收率依赖回收产品质量的再制造EOQ模型

研究回收率依赖回收产品质量情况下制造/再制造混合系统的EOQ模型.该模型假设顾客的需求可通过新产品的制造和回收产品的再制造两种方式满足,且这两种产品无质量差异;需求率是确定的、连续的;总成本包括制造和再制造的固定启动成本,可销售产品和回收品的库存成本,以及缺货成本.当假设缺货成本无限大时给出不允许缺货情况下的模型.给出算例验证模型的有效性.     

A two warehouse inventory model for a deteriorating item with partially/fully backlogged shortage and fuzzy lead time

An optimization inventory policy for a deteriorating item with imprecise lead-time, partially/fully backlogged shortages and price dependent demand is developed under two-warehouse system. For display and storage, the retailer hires one warehouse of finite capacity at market place, treated as own warehouse (OW) and another warehouse of large capacity as it may be required at a distance place from the market, treated as rented warehouse (RW). Holding cost at RW decreases with the increase of distance from the market place. Units are transferred from RW to OW in bulk release pattern and sold from OW. Using the nearest interval approximation method the estimated fuzzy average profit function is defuzzified and transformed to multiple crisp objective functions which are solved by Global Criteria Method. The models are illustrated numerically. Sensitivity of the inventory costs on the location of RW has been depicted graphically. Also loss in profit due to deteriorations for both models have been presented.     

需求依赖于展示区库存水平的易腐品订购和转运策略

本文主要研究易腐品零售商的订货和转运策略。零售商的库存分为两部分,即展示区/货架库存和仓库库存。零售商定期向供应商订货,零售商收到订购的商品首先将其中一部分商品存放在展示区中,余下的部分储存在仓库。展示区的空间是有限的,并且需求依赖于展示区商品的库存量。本文首先建立了以平均利润最大化为目标的库存优化模型并对模型最优解的存在性进行了分析,然后得到了求解最优订购量、转运量、转运时间间隔以及再订购点的算法,最后给出了不同参数条件下的算例。