DETERMINATION OF THE OPTIMAL BATCH, SIZE AND QUANTITY OF TRANSPORT PACKAGES FOR THE TRANSPORTATION OF KARELIAN BIRCH

This article presents the calculation of the optimal batch, dimensional and mass characteristics and the required number of transport packages for the transportation of Karelian birch in "knife" bars and boards. The number and weight of bars on EURO or FIN pallets, the number of boards of the same cubic capacity are determined and transport packages and stacks of boards are calculated taking into account the realization of the maximum possible carrying capacity and cargo capacity of vehicles and containers. The choice and justification of the rolling stock and its necessary quantity for transportation of the calculated batch of wood is made.

On the Throughput Optimization in Large-Scale Batch-Processing Systems

We analyze a data-processing system with n clients producing jobs which are processed in batches by m parallel servers; the system throughput critically depends on the batch size and a corresponding sub-additive speedup function that arises due to overhead amortization. In practice, throughput optimization relies on numerical searches for the optimal batch size which is computationally cumbersome. In this paper, we model this system in terms of a closed queueing network assuming certain forms of service speedup; a standard Markovian analysis yields the optimal throughput in w n4 time. Our main contribution is a mean-field model that has a unique, globally attractive stationary point, derivable in closed form. This point characterizes the asymptotic throughput as a function of the batch size that can be calculated in O(1) time. Numerical settings from a large commercial system reveal that this asymptotic optimum is accurate in practical finite regimes.

Manufacturing Learning and Forgetting: Steady State Optimal Batch Size for Constant Demand Case

Assuming learning and forgetting in processing units, constant demand rate, and infinite horizon, we analyze costs and properties related to lot sizes in the steady state. Steady State characteristics are described by a convergence in worker experience level or skills. The average per period cost as a function of lot size is found to be non-convex in the steady state. Thus, a simple approach such as first-order condition is not guaranteed to give an optimal solution. We develop sufficient conditions for existence of a uniqueoptimal solution, which are found in some problems. Our study shows that EOQ-type policies that use fixed batch size and produce when inventory reaches zero are not necessarily optimal.

A vendor managed inventory on consignment with penalty as a supply chain coordination arrangement

This paper presents a mathematical two echelon vendor-managed inventory (VMI) model on consignment scheme in supply chain, in which the vendor pays a penalty for every extra unit which exceeds a specific upper limit to the buyer. In this arrangement the vendor can decide about the batch size he wants to transship to the buyer. Two cases are discussed in this paper; single vendor-single buyer and single vendor-two buyers. In this study after a review of coordination in supply chain and VMI on consignment, we discuss vendor-managed inventory scheme in comparison with traditional inventory control system. The optimal batch size is calculated and the paper investigates how a VMI on consignment arrangement with penalty can coordinate the supply chain. Numerical examples and sensitivity analysis is presented to illustrate the performance of model and the results.