This paper is to analyze an integrated production and inventory model in a single-vendor multi-buyer supply chain. The vendor is defined as the manufacturer and the buyers as the retailers. The product that the manufacturer produces is supplied to the retailers with constant periodic time interval. The production rate of the manufacturer is constant for the time. The demand of the retailers is constant for the time. The cycle time of the vendor is defined as the elapsed time from the start of the production to the start of the next production, while the cycle times of the buyer as the elapsed time between the adjacent supply times from the vendor to the buyer. The cycle times of the vendor and the buyers that minimizes the total cost in a supply chain are analyzed. The cost factors are the production setup cost and the inventory holding cost of the manufacturer, the ordering cost and the inventory holding cost of the retailers. The cycle time of the vendor is investigated through the cycle time that satisfies economic production quantity with the production setup cost and the inventory holding cost of the manufacturer. An integrated production and inventory model is formulated, and an algorithm is developed. An numerical example is presented to explain the algorithm. The solution of the algorithm for the numerical examples is compared with that of genetic algorithm. Numerical example shows that the vendor and the buyers can save cost by integrated decision making.

This paper is to analyze the cycle time of the vendor in a single-vendor multi-buyers supply chain. The vendor is the manufacturer and the buyers are the retailers. The cycle time of the vendor is the elapse time from the beginning time of the production to the beginning time of the next production. The cycle time of the vendor that minimizes the total cost in a supply chain is analyzed. The cost factors are the production setup cost and the inventory holding cost of the vendor, the ordering cost and the inventory holding cost of the retailers. The cycle times of the vendor obtained with the costs of the vendor is compared with those obtained with the costs of the vendor and the retailers. Various numerical examples are tested if the cycle times of the vendor for both methods are the same.

This paper deals with the picking batch size which a bi-directional carousel system can be feasible. The items that customers order are retrieved from the bins of carousel with batch size. The mathematical equations representing rotary travel distance and retrieval lead time to pick a given batch size are derived. Rotary travel distance represents the distance which carousel system rotates to retrieve items in a batch. The bi-directional carousel system rotates to minimize the travel distance in retrieving the items in a batch. Rotary travel distance and retrieval lead time are analyzed for the batch size through the simulation approach. From the simulation, the retrieval batch size that carousel system can be feasible is obtained. A numerical example is shown to explain the solution procedure.

This paper is to analyze the picking lead time for picking batch size in a warehouse system and to get minimum picking batch size that is the warehouse system feasible. The warehouse system consists of aisles and racks, which two racks face each other through aisle. The products are picked from the storage locations by batch size. The probability that items are picked in the each row of the rack in the aisle for order picking activity is derived. The picking lead time for picking batch size is the time passed from the first picking location to arrival at starting location in aisle picking all items included in a batch size. The picking lead time for picking batch size in an aisle is analyzed. The picking lead time for picking batch size in the whole warehouse system is obtained. The warehouse system is feasible if all items that customers order are picked from the storage locations for same period. The picking batch size that is the warehouse system feasible is obtained. The problem is analyzed, a solution procedure is developed, and a numerical example is shown to explain the problem.

The demand for facility used in producing multi-products is changed dynamically for discrete and finite time periods. The excess or the shortage for facility is occurred according to difference of the facility capacity size and demand for facility through given time periods. The shortage facility is met through the outsourcing production. The excess facility cost is considered for the periods that the facility capacity is greater than the demand for the facility, and the outsourcing production cost is considered for the periods that the demand for facility is greater than the facility capacity. This paper addresses to determine the facility capacity size, outsourcing production products and amount that minimizes the sum of the facility capacity cost, the excess facility cost and the outsourcing production cost. The characteristics of the optimal solution are analyzed, and an algorithm applying them is developed. A numerical example is shown to explain the problem.

This paper addresses the analysis of the travel distance and order picking time of the vehicle in a aisle when items are picked by the batch in a warehouse system. Batching is to combine several orders in a single tour of the storage/retrieval machine. An

This paper addresses capacity expansion planning model of distribution center under usability of public distribution center. For discrete and finite time periods, demands for distribution center increase dynamically. The capacity expansion planning is to

Distribution centers in a distribution system that consists of the distribution centers and retailers supplies products to retailers. At the present, although total capacity of the distribution centers are enough to supply total demand of retailers, capac

  This paper addresses determining the location of the distribution centers in a discrete dynamic distribution system. In discrete and finite time horizon, the demands of retailers are dynamic for the periods. Some locations among the retailers can be cho

  This paper is to determine the transportation size and the location of distribution centers to minimize logistics cost in a distribution system where products are transported from the distribution centers to the retailers. Logistics cost consists of the

  This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. Th

  This paper addresses a the maintenance system based on the concept of RAMS (Reliability, Availability, Maintenance, Safety) for the effective maintenance of the urban transit. A systematic approach for developing a cost-effective maintenance strategy ba

  This paper addresses the analysis of the travel distance and the number of storage location for storage location allocation methods in a warehouse system. The dedicated, randomized, combined and limited storage methods are considered. The combined and t

This paper is to analyze the travel distance and the transport size of the vehicle when the AGV carries multiple-load in the tandem automated guided vehicle systems. The size of multiple-load represents the number of load that the AGV can carry simultaneo

This paper addresses a model for the transportation planning that determines the transportation cycle time and the ve-hicle Size to minimize the cost In a distribution system The vehicle routing to minimize the transportation distance of the vehicles is a

This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of v

This study develops an efficient heuristic which is based on genetic approach for AGVs flow path layout problem. The suggested solution approach uses a algorithm to replace two 0-1 integer programming models and a branch-and-bound search algorithm. Geneti

A mathematical model is developed for economic design of multi-stage distribution system that consists of factory, central distribution centers, local distribution centers and retailers. The retailers are supplied products from different stage suppliers according to order size. The retailers are supplied products from factory if demand amount is large, central distribution center if medium, local distribution center if small. The cost factors are transportation cost, handling cost at distribution centers and inventory holding cost at retailers. It is to determine the transportation route of each retailer, the size and number of the vehicle at factory and distribution centers, the handling amount at distribution centers. The mathematical model is represented, the solution procedure is developed.

In this paper, a mathematical model is developed for economic design of multi-stage distribution system that consists of factory, central distribution centers, local distribution centers and retailers. The retailers are supplied products from different st