0. Introduction T h e id en tifica tio n o f n am es an d abbrev ia tions in a ra w te x t is a n im p o rtan t sub ac tiv ity in the "to k en iza tio n " p ro cess , i.e . th e id en tifica tion o f th e b as ic u n its o f th e tex t: parag raphs, sen ten ces a n d w ords. T o k en iza tio n is in its tu rn an im p o rtan t su b ac tiv ity in th e "norm alization" o f tex ts , th e to ta lity...

In this paper we consider the uncapacitated economic lot-size model, where demand is a deterministic function of price. In the model a single price need to be set for all periods. The objective is to find an optimal price and ordering decisions simultaneously. In 1973 Kunreuther and Schrage proposed an heuristic algorithm to solve this problem. The contribution of our paper is twofold. First, w...

We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is ...

We introduce a new genetic algorithm (GA) approach for the integrated inventory distribution problem (IIDP). We present the developed genetic representation and use a randomized version of a previously developed construction heuristic to generate the initial random population. We design suitable crossover and mutation operators for the GA improvement phase. The comparison of results shows the s...

In this paper, an orthogonal strip packing problem with rotation of items and without the guillotine packing constraint is considered. A fast heuristic algorithm for the large-scale problems is presented. This heuristic algorithm is mainly based on heuristic strategies inspired by the wall-building rule of bricklayers in daily life. The heuristics is simple and the setting of parameter is not r...

This article proposes a mixed integer non-linear programming model for the optimizing supply chains of importers of waterborne containerized goods from Asia to the USA. This model determines the least-cost strategy for an importer, in terms of ports and landside transportation modes to be used, where costs considered include costs for transportation and handling, pipeline inventory, and safety-...

Machines at customers have to be provided with spare parts upon failure. Consider a number of groups of machines, for each of which a target aggregate fill rate or target average response time (waiting time) should be met. Between groups, commonality exists, i.e., some parts occur in the material breakdown structure of machines in multiple groups. Instead of using separate stocks per group of m...

In this chapter we present an innovative approach to combine common results of Markov decision theory and series expansions for optimization. We call our algorithm the series expansion optimization algorithm. Our algorithm efficiently determines the optimal policy of continuous-time Markov decision processes exactly or alternatively up to an arbitrarily small precision. We prove its convergence...

This study considers instant decision-making needs of the automobile manufactures for resequencing vehicles before final assembly (FA). We propose a rule-based two-stage stochastic model to determine the number of spare vehicles that should be kept in the pre-assembly buffer to restore the altered sequence due to paint defects and upstream department constraints. First stage of the model decide...

Retail store managers may not follow order advices generated by an automated inventory replenishment system if their incentives differ from the cost minimization objective of the system or if they perceive the system to be suboptimal. We study the ordering behavior of retail store managers in a supermarket chain to characterize such deviations in ordering behavior and investigate their potentia...