Meta-hierarchical-heuristic-mathematical- model of loading problems in flexible manufacturing system for development of an intelligent approach
, Pages: 177-190
Ranbir Singh Rajender Singh and B.K. Khan PDF (685K)
Abstract: 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.
Keywords: Flexible manufacturing system (FMS), Loading in FMS, Realistic modelling, Mathematical modelling of FMS, Artificial intelligence in FMS
Impact of end of lease contracts’ option on joint pricing and inventory decisions of remanufacturable leased products
, Pages: 191-204
M. Rabbani S. Keyhanian, Mansure Hasannia, Marzieh Eskandari, Moeen Sammak Jalali PDF (685K)
Abstract: 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.
Keywords: Leasing, Pricing, End options, Mathematical Model, Remanufacturing
A new approach for solving resource constrained project scheduling problems using differential evolution algorithm
, Pages: 205-216
Arian Eshraghi PDF (685K)
Abstract: 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.
Keywords: Resource constrained, Metaheuristic algorithms, Project scheduling, Differential evolution, Investment
Multi-period fuzzy mean-semi variance portfolio selection problem with transaction cost and minimum transaction lots using genetic algorithm
, Pages: 217-228
Mohammad Ali Barati, Mohammad Mohammadi and Bahman Naderi PDF (685K)
Abstract: 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.
Keywords: Multi-period portfolio, Mean-semi variance, Transaction cost, Minimum transaction lots, Fuzzy theory
Integrated batch production and maintenance scheduling for multiple items processed on a deteriorating machine to minimize total production and maintenance costs with due date constraint
, Pages: 229-244
Zahedi Zahedi, T.M.A Ari Samadhi, Suprayogi Suprayogi and Abdul Hakim Halim PDF (685K)
Abstract: 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.
Keywords: Batch production, Machine maintenance, Multiple items
A population-based algorithm for the multi travelling salesman problem
, Pages: 245-256
Rubén Iván Bolaños, Eliana M. Toro O and Mauricio Granada E PDF (685K)
Abstract: 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.
Keywords: Combinatorial optimization, Multi-traveling salesman problem, Population-based algorithm, Local search operators
Analysis of surface roughness and cutting force during turning of Ti6Al4V ELI in dry environment
, Pages: 257-266
V. G. Sargade, S. R. Nipanikar and S. M. Meshram PDF (685K)
Abstract: 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.
Keywords: Ti6Al4V ELI, Surface roughness, PVD TiAlN, Dry environment
Effects of inflation and time value of money on an inventory system with deteriorating items and partially backlogged shortages
, Pages: 267-282
Chandra K. Jaggi, Aditi Khanna and Nidhi PDF (685K)
Abstract: As the long arm of the grinding, deep financial crisis continues to haunt the global economy, the effects of inflation and time value of money cannot be oblivious to an inventory system. Inflation, defined as a general rise in the prices of goods and services over a period of time, has monetary depreciation as one of its major side effects. And, since inventories correspond to substantial investment in capital for any organization, it would be unethical if the effects of inflation and time value of money are not considered while determining the optimal inventory policy. Moreover, deterioration of items is a phenomenon which cannot be ignored, as it may yield misleading results. Further, under the inflationary conditions, the different cost parameters including the price are bound to vary from cycle to cycle over the planning horizon. Another important factor is shortages which no retailer would prefer, and in practice are partially backlogged and partially lost. In order to convert the lost sales into sales, the retailer offers such customers an incentive, by charging them the price prevailing at the time of placing an order, instead of the current inflated price. Therefore, bearing in mind these facts, the present paper develops an inventory model for a retailer dealing with deteriorating items under inflationary conditions over a fixed planning horizon. The objective is to derive the optimal number of cycles and cycle length that maximizes the net present value of the total profit over a fixed planning horizon. An appropriate algorithm has been proposed to obtain the optimal solution. Finally, a numerical example is provided to illustrate the proposed model. Sensitivity analysis of the optimal solution with respect to major parameters is carried out and some managerial inferences have been presented.
Keywords: Inventory, Deterioration, Partial Backlogging, Inflation, Time value of money, Finite planning horizon
Minimizing the total tardiness for the tool change scheduling problem on parallel machines
, Pages: 283-294
Antonio Costa, Fulvio Cappadonna and Sergio Fichera PDF (685K)
Abstract: This paper deals with the total tardiness minimization problem in a parallel machines manufacturing environment where tool change operations have to be scheduled along with jobs. The mentioned issue belongs to the family of scheduling problems under deterministic machine availability restrictions. A new model that considers the effects of the tool wear on the quality characteristics of the worked product is proposed. Since no mathematical programming-based approach has been developed by literature so far, two distinct mixed integer linear programming models, able to schedule jobs as well as tool change activities along the provided production horizon, have been devised. The former is an adaptation of a well-known model presented by the relevant literature for the single machine scheduling problem with tool changes. The latter has been specifically developed for the issue at hand. After a theoretical analysis aimed at revealing the differences between the proposed mathematical models in terms of computational complexity, an extensive experimental campaign has been fulfilled to assess performances of the proposed methods under the CPU time viewpoint. Obtained results have been statistically analyzed through a properly arranged ANOVA analysis.
Keywords: Scheduling, Parallel machines, Tool change, Total tardiness minimization, Linear programming
A hybrid algorithm for stochastic single-source capacitated facility location problem with service level requirements
, Pages: 295-308
Hosseinali Salemi PDF (685K)
Abstract: Facility location models are observed in many diverse areas such as communication networks, transportation, and distribution systems planning. They play significant role in supply chain and operations management and are one of the main well-known topics in strategic agenda of contemporary manufacturing and service companies accompanied by long-lasting effects. We define a new approach for solving stochastic single source capacitated facility location problem (SSSCFLP). Customers with stochastic demand are assigned to set of capacitated facilities that are selected to serve them. It is demonstrated that problem can be transformed to deterministic Single Source Capacitated Facility Location Problem (SSCFLP) for Poisson demand distribution. A hybrid algorithm which combines Lagrangian heuristic with adjusted mixture of Ant colony and Genetic optimization is proposed to find lower and upper bounds for this problem. Computational results of various instances with distinct properties indicate that proposed solving approach is efficient.
Keywords: Stochastic single-source capacitated facility location problem, Poinson distribution, Genetic algorithm
M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan
, Pages: 309-322
V. Azizi, M. Jabbari and A. S. Kheirkhah PDF (685K)
Abstract: Recently, learning effects have been studied as an interesting topic for scheduling problems, however, most researches have considered single or two-machine settings. Moreover, learning factor has been considered for job times instead of setup times and the same learning effect has been used for all machines. This paper studies the m-machine no-wait flowshop scheduling problem considering truncated learning effect in no-wait flowshop environment. In this problem, setup time is a function of job position in the sequence with a learning truncation parameter and each machine has its own learning effect. In this paper, a mixed integer linear programming is proposed for the problem to solve such problem. This problem is NP-hard so an improved genetic algorithm (GA) and a simulated annealing (SA) algorithm are developed to find near optimal solutions. The accuracy and efficiency of the proposed procedures are tested against different criteria on various instances. Numerical experiments approve that SA outperforms in most instances.
Keywords: No-wait flowshop, Learning effect, Genetic Algorithm, Simulated Annealing, Truncated learning parameter
A new ensemble algorithm of differential evolution and backtracking search optimization algorithm with adaptive control parameter for function optimization
, Pages: 323-338
Sukanta Nama Apu Kumar Saha and Sima Ghosh PDF (685K)
Abstract: Differential evolution (DE) is an effective and powerful approach and it has been widely used in different environments. However, the performance of DE is sensitive to the choice of control parameters. Thus, to obtain optimal performance, time-consuming parameter tuning is necessary. Backtracking Search Optimization Algorithm (BSA) is a new evolutionary algorithm (EA) for solving real-valued numerical optimization problems. An ensemble algorithm called E-BSADE is proposed which incorporates concepts from DE and BSA. The performance of E-BSADE is evaluated on several benchmark functions and is compared with basic DE, BSA and conventional DE mutation strategy.
Keywords: Differential Evolution (DE), Backtracking Search Optimization Algorithm (BSA), Ensemble Algorithm, Unconstrained Optimization
Surface roughness evaluation of various cutting materials in hard turning of AISI H11
, Pages: 339-352
H. Aouici B. Fnides, M. Elbah, S. Benlahmidi, H. Bensouilah and M. A. Yallese PDF (685K)
Abstract: This paper describes a comparison of surface roughness between ceramics and cubic boron nitride (CBN7020) cutting tools when machining of AISI H11 hot work steels treated at 50 HRC. Plan is designed according to Taguchi’s L18 (21×32) orthogonal array. The response surface methodology (RSM) and analysis of variance (ANOVA) were used to check the validity of multiple linear regression models and to determine the effects, contribution, significance and optimal machine settings of process parameters, namely, cutting speed, feed rate and depth of cut on machining parameters on the Ra and Rt. The results of this research work showed that, the feed rate was found to be a dominant factor on the surface roughness, followed by the cutting speed, lastly the depth of cut. The CBN7020 cutting tool showed the better performance than that of ceramic based cutting tool. In addition, the combination of low feed rate and high cutting speed is necessary for minimizing the surface roughness.
Keywords: Hard turning, AISI H11 steel, Ceramic, CBN, ANOVA, RSM
Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling
, Pages: 353-366
A. Baskar PDF (685K)
Abstract: Permutation flow shop scheduling problems have been an interesting area of research for over six decades. Out of the several parameters, minimization of makespan has been studied much over the years. The problems are widely regarded as NP-Complete if the number of machines is more than three. As the computation time grows exponentially with respect to the problem size, heuristics and meta-heuristics have been proposed by many authors that give reasonably accurate and acceptable results. The NEH algorithm proposed in 1983 is still considered as one of the best simple, constructive heuristics for the minimization of makespan. This paper analyses the powerful job insertion technique used by NEH algorithm and proposes seven new variants, the complexity level remains same. 120 numbers of problem instances proposed by Taillard have been used for the purpose of validating the algorithms. Out of the seven, three produce better results than the original NEH algorithm.
Keywords: NEH Algorithm, Job Insertion Technique, Flow Shop Scheduling: Makespan
® 2010-2015 GrowingScience.Com