This paper deals with the problem of determining the buyer's economic lot sizing policy for exponentially deteriorating products under trade credit. Assuming that the supplier's credit terms are already known and the length of delay is a function of the buyer's order size, we formulate the mathematical model and the solution algorithm is developed based on the properties of an optimal solution.

In today's business transactions, it is more and more common to see that the buyers are allowed some grace period before they settle the account with the supplier. In this regard, we analyze the problem of determining the buyer's EOQ when the supplier allows day-terms credit. For the analysis, it is assumed that the buyer's demand rate is a function of the on -hand inventory level and the relevant mathematical model is developed.

This paper addresses the problem of placing tools in a tool magazine with random-select capability on a flexible machine. The tool placement problem could be a significant portion of the total processing time. It is assumed that the total number of tools required to process a set of parts exceeds the available magazine capacity, and so tool switches may occur between two adjacent parts in a given part sequence. Two heuristics are presented so as to minimize the total travel distance of the tool magazine before the completion of all parts.

This paper analyses the tool switching problem in the dynamic environment, where parts to be processed on a flexible machine arrive randomly. As the total number of tools required to Process a set of parts on the machine is generally larger than the available magazine storage capacity, tool switches between parts are usually necessary. We assume that tool switching must be made just before the processing of the parts. Since the time required for tool switches can be significant relative to processing time and cause the processing of parts to be delayed, it is desirable to minimize the number of tool switches. Therefore, we present one heuristic algorithm to minimize the total number of tool switches and the t)reposed heuristic is compared with the KTNS (Keep Tool Needed Soonest) policy on randomly generated problems.