Showing 2 results for R. Tavakkoli-Moghaddam
R. Tavakkoli-Moghaddam, M. Rabbani, and M.a. Beheshti,
Volume 27, Issue 1 (7-2008)
Abstract
This paper presents a nonlinear mixed-integer programming model to minimize the stoppage cost of mixed-model assembly lines. Nowadays, most manufacturing firms employ this type of line due to the increasing varieties of products in their attempts to quickly respond to diversified customer demands. Advancement of new technologies, competitiveness, diversification of products, and large customer demand have encouraged practitioners to use different methods of improving production lines. Minimizing line stoppage is regarded as a main factor in determining the sequence of processing products. Line stoppage results
in idleness of operators and machines, reduced throughput, increased overhead costs, and decreased overall productivity. Due to the complexity of the model proposed, which belongs to a class of NP-hard problems, a meta-heuristic method based on a genetic algorithm (GA) is proposed to obtain near-optimal solutions in reasonable time, especially for large-scale problems. To show the efficiency of the proposed GA, the computational results are compared with those obtained by the Lingo software.
M. Rabbani, R. Tavakkoli-Moghaddam, and H. Vahdan,
Volume 27, Issue 2 (1-2009)
Abstract
This paper presents a discounted cash-flow approach to an inventory model for deteriorating items with the
two-parameter Weibull distribution. According to our proposed model, two shortages are considered: back-orders and lost-sales,
in which the back-order rate is a varying function of the time when the shortage happens. In general, the demand rate is a linear function of the selling price. The objective of this model is to determine the optimal pricing policy and the optimal throughput time in such a way that the total net present value of profits is maximized in the given planning horizon. Finally, a numerical example is provided to solve the model presented using our proposed three-stage approach.
