Nowadays, most manufacturing units try to locate their requirements and the depot vehicle routing in order to transport the goods at optimum cost. Needless to mention that the locations of the required warehouses influence on the performance of vehicle routing. In this paper, a mathematical programming model to optimize the storage location and vehicle routing are presented. The first objective function of the model minimizes the total cost associated with the transportation and storage, and the second objective function minimizes the difference distance traveled by vehicles. The study uses Imperialist Competitive Algorithm (ICA) to solve the resulted problems in different sizes. The preliminary results have indicated that the proposed study has performed better than NSGA-II and PAES methods in terms of Quality metric and Spacing metric.

The present study investigates an inventory model for non-instantaneous deteriorating items under inflationary conditions with partially backlogged shortages. In today’s market structure consumers are looking for goods for which there is a delay in deterioration. At the same time, the consumers’ willingness to wait has been decreased over time, which leads to lost sales. Moreover in financial decision-making, the effects of inflation and time value of money cannot be oblivious to an inventory system. In this scenario, managing inventory of goods remains a challenging task for the decision makers, who may also have to rent warehouse under different prevailing factors such as, bulk discount, limited space in the retail outlet, or increasing inflation rates. With a focus on reduction of costs and increasing customer service, warehouse decision models are crucial for an organization’s profitability. Hence a mathematical model has been developed in the view of above scenario, in order to determine the optimal policy for the decision maker, by minimizing the present worth of total cost. The optimization procedure has been illustrated by a numerical example and detailed sensitivity analysis of the optimal solution has been performed to showcase the effect of various parameters. Managerial implications has also been presented to aid the decision making process.

In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.

Flexible manufacturing system (FMS) promises a wide range of manufacturing benefits in terms of flexibility and productivity. These benefits are targeted by efficient production planning. Part type selection, machine grouping, deciding production ratio, resource allocation and machine loading are five identified production planning problems. Machine loading is the most identified complex problem solved with aid of computers. System up gradation and newer technology adoption are the primary needs of efficient FMS generating new scopes of research in the field. The literature review is carried and the critical analysis is being executed in the present work. This paper presents the outcomes of the mathematical modelling techniques for loading of machines in FMS’s. It was also analysed that the mathematical modelling is necessary for accurate and reliable analysis for practical applications. However, excessive computations need to be avoided and heuristics have to be used for real-world problems. This paper presents the heuristics-mathematical modelling of loading problem with machine processing time as primary input. The aim of the present work is to solve a real-world machine loading problem with an objective of balancing the workload of the FMS with decreased computational time. A Matlab code is developed for the solution and the results are found most accurate and reliable as presented in the paper.

Leasing currently plays an important role for the global economy. The equipment leasing earning acquired through leasing rather than cash or credit, has reached a dominant level. With this regards, this paper represents a basic mixed-integer non-linear programming model. The study deliberates a firm that leases new products and remanufactured leased merchandises. The proposed study considers the end of lease contract, which contains several options: Return the leased product, return the used product and purchase other remanufactured product and buying the leased product. The primary objective is to maximize the discrepancy between the revenue and the costs of a firm, which leases new products as well as selling remanufactured ones. The product deteriorates with time and the difference between a new and used good is obvious. The product must undergo a remanufacturing procedure before being sold as a remanufactured product.

One subcategory of project scheduling is the resource constrained project scheduling problem (RCPSP). The present study proposes a differential evolution algorithm for solving the RCPSP making a small change in the method to comply with the model. The RCPSP is intended to program a group of activities of minimal duration while considering precedence and resource constraints. The present study introduces a differential evolution algorithm and local search was added to improve the performance of the algorithm. The problems were then solved to evaluate the performance of the algorithm and the results are compared with genetic algorithm. Computational results confirm that the differential evolution algorithm performs better than genetic algorithm.

Multi-period models of portfolio selection have been developed in the literature with respect to certain assumptions. In this study, for the first time, the portfolio selection problem has been modeled based on mean-semi variance with transaction cost and minimum transaction lots considering functional constraints and fuzzy parameters. Functional constraints such as transaction cost and minimum transaction lots were included. In addition, the returns on assets parameters were considered as trapezoidal fuzzy numbers. An efficient genetic algorithm (GA) was designed, results were analyzed using numerical instances and sensitivity analysis were executed. In the numerical study, the problem was solved based on the presence or absence of each mode of constraints including transaction costs and minimum transaction lots. In addition, with the use of sensitivity analysis, the results of the model were presented with the variations of minimum expected rate of programming periods.

This paper discusses an integrated model of batch production and maintenance scheduling on a deteriorating machine producing multiple items to be delivered at a common due date. The model describes the trade-off between total inventory cost and maintenance cost as the increase of production run length. The production run length is a time bucket between two consecutive preventive maintenance activities. The objective function of the model is to minimize total cost consisting of in process and completed part inventory costs, setup cost, preventive and corrective maintenance costs and rework cost. The problem is to determine the optimal production run length and to schedule the batches obtained from determining the production run length in order to minimize total cost.

This paper presents the implementation of an efficient modified genetic algorithm for solving the multi-traveling salesman problem (mTSP). The main characteristics of the method are the construction of an initial population of high quality and the implementation of several local search operators which are important in the efficient and effective exploration of promising regions of the solution space. Due to the combinatorial complexity of mTSP, the proposed methodology is especially applicable for real-world problems. The proposed algorithm was tested on a set of six benchmark instances, which have from 76 and 1002 cities to be visited. In all cases, the best known solution was improved. The results are also compared with other existing solutions procedure in the literature.

This paper investigates the effect of cutting parameters on the surface roughness and cutting force of titanium alloy Ti-6Al-4V ELI when turning using PVD TiAlN coated tool in dry environment. Taguchi L9 orthogonal array design of experiment was used for the turning experiment 2 factors and 3 levels. Turning parameters studied were cutting speed (50, 65, 80 m/min), feed rate (0.08, 0.15, 0.2 mm/rev) and depth of cut 0.5 mm constant. Linear and second order model of the surface roughness and cutting force has been developed in terms of cutting speed and feed. The results show that the feed rate was the most impact factor controlling the cutting force and surface roughness produced. MINITAB 17software was used to develop a linear and second order model of surface roughness and cutting force. Optimum condition was at 66.97 m/min of cutting speed, 0.08 mm/rev of feed rate. Surface roughness 0.57?m and cutting force 54.02 N were obtained at the optimum condition. A good agreement between the experimental and predicted surface roughness and cutting force were observed.