Trim cutting operation in wire electrical discharge machining (WEDM) is considered as a probable solution to improve surface characteristics and geometrical accuracy by removing very small amount of work materials from the surface obtained after a rough cutting operation. In this study, an attempt has been made to model the surface roughness and dimensional shift in trim cutting operations in WEDM process through response surface methodology (RSM). Four process parameters; namely pulse-on time (Ton), servo voltage (SV), wire depth (Wd) and Dielectric flow rate (FR) have been considered as input parameters in trim cutting operations for modelling. Desirability function has been employed to optimize multi performance characteristics. Increasing the value of Ton, Wd and FR increases the surface roughness and dimensional shift but increasing SV decreases both surface roughness and dimensional shift. Quadratic models have been proposed for both the performance characteristics. In present experimentation, thickness of recast layer was observed in the range of 6?m to 12?m for low to high value of discharge parameters.

This research discusses an integer batch scheduling problems for a single-machine with position-dependent batch processing time due to the simultaneous effect of learning and forgetting. The decision variables are the number of batches, batch sizes, and the sequence of the resulting batches. The objective is to minimize total actual flow time, defined as total interval time between the arrival times of parts in all respective batches and their common due date. There are two proposed algorithms to solve the problems. The first is developed by using the Integer Composition method, and it produces an optimal solution. Since the problems can be solved by the first algorithm in a worst-case time complexity O(n2n-1), this research proposes the second algorithm. It is a heuristic algorithm based on the Lagrange Relaxation method. Numerical experiments show that the heuristic algorithm gives outstanding results.

The optimum selection of process parameters has played an important role for improving the surface finish, minimizing tool wear, increasing material removal rate and reducing machining time of any machining process. In this paper, optimum parameters while machining AISI D2 hardened steel using solid carbide TiAlN coated end mill has been investigated. For optimization of process parameters along with multiple quality characteristics, principal components analysis method has been adopted in this work. The confirmation experiments have revealed that to improve performance of cutting; principal components analysis method would be a useful tool.

This paper proposes a method to quote the due date and the price of incoming orders to multiple customers simultaneously when the contingent orders exist. The proposed method utilizes probabilistic information on contingent orders and incorporates some negotiation theories to generate quotations. Rather than improving the acceptance probability of quotation for single customer, the method improves the overall acceptance probability of quotations being submitted to the multiple customers. This helps increase the total expected contribution of company and acceptance probability of entire new orders rather than increasing these measures only for a single customer. Numerical analysis is conducted to demonstrate the working mechanism of proposed method and its effectiveness in contrast to sequential method of quotation.

In the existing literature, there are a huge number of studies focused on p-hub median problems and inventing heuristic or metaheuristic algorithms for solving them. But such analogous body of literature does not exist for its counterpart problem; p-hub center problem. In fact, since p-hub center has been lately introduced and has a particular objective function, minimizing the maximum cost between origin-destination nodes, there are few studies investigating the problem and the challenges for solving it. In this study, after presenting a complete definition of the uncapacitated multiple allocation p-hub center problem (UMApHCP) two well-known metaheuristic algorithms are proposed to solve the problem for small scale and large scale standard data sets. These two algorithms are one single solution-based algorithm, Simulated Annealing (SA), and one population-based metaheuristic, Genetic Algorithm (GA). Because of the particular nature of the problem, Dijkstra’s algorithm has been incorporated in the fitness function calculation part of the proposed methods. The numerical results of running the GA and SA for standard test problems show that for smaller scale test problems, single solution-based SA shows greater performance versus GA but for larger scales of data sets the GA generally yield more desirable solutions.

The present paper studies the reliability analysis of the casting process in foundry work using a probabilistic approach. As foundry industries in many developing countries suffer from poor quality of casting due to improper management, lack of resources and wrong working methods followed, which results in the decrement of productivity. Hence, to ensure the quality and productivity, favorable steps must be taken. The considered casting system has four main types of defects; namely mold shift, shrinkage, cold shut and blowholes. The complete casting system can fail due to the misalignment of the mold and combination of defects such as shrinkage and blow holes and can also fail by defects of shrinkage, blow holes and cold shut, simultaneously. The system is analyzed with the help of the supplementary variable technique and Laplace transformation. The availability, reliability, mean time to failure, sensitivity analysis and cost-effectiveness have been evaluated for the considered system. The results have been shown with the help of graphs, which predicts the behavior of the casting process system when any one of the defect or more than one defect appears.

Skill management is a key factor in improving effectiveness of industrial companies, notably their maintenance services. The problem considered in this paper concerns scheduling of maintenance tasks under resource (maintenance teams) constraints. This problem is generally known as unrelated parallel machine scheduling. We consider the problem with a both objectives of minimizing total weighted tardiness (TWT) and number of tardiness tasks. Our interest is focused particularly on solving this problem under skill constraints, which each resource has a skill level. So, we propose a new efficient heuristic to obtain an approximate solution for this NP-hard problem and demonstrate his effectiveness through computational experiments. This heuristic is designed for implementation in a static maintenance scheduling problem (with unequal release dates, processing times and resource skills), while minimizing objective functions aforementioned.

Global competition pressures have forced manufactures to adapt their productive capabilities. In order to satisfy the ever-changing market demands many organizations adopted flexible resources capable of executing several products with different performance criteria. The unrelated parallel-machines makespan minimization problem (Rm||Cmax) is known to be NP-hard or too complex to be solved exactly. In the heuristics used for this problem, the MCT (Minimum Completion Time), which is the base for several others, allocates tasks in a random like order to the minimum completion time machine. This paper proposes an ordered approach to the MCT heuristic. MOMCT (Modified Ordered Minimum Completion Time) will order tasks in accordance to the MS index, which represents the mean difference of the completion time on each machine and the one on the minimum completion time machine. The computational study demonstrates the improved performance of MOMCT over the MCT heuristic.

In recent years, supply chain management is known as the key factor for achieving competitive advantage. Better customer service, revenue improvement and cost reduction are the results of this philosophy. Organizations can manage the performance of their firms by appropriate goal setting, identifying criteria and continuous performance measurement, which creates a good view for the business circumstances. Developing and defining appropriate indicators at different levels of chain is necessary for implementing a performance measurement system. In this study, we propose a new method to determine the measurement indicators and strategies of the company in term of balanced scorecard. The study is a combination of balanced scorecard, path analysis, evolutionary game theory and cooperative game theory for strategic planning. The study offers an appropriate program for future activities of organizations and determines the present status of the firm. The implementation of the proposed method is introduced for a food producer and the results are analyzed.

Scheduling ‘n’ jobs on ‘m’ machines in a flow shop is NP- hard problem and places itself at prominent place in the area of production scheduling. The essence of any scheduling algorithm is to minimize the makespan in a flowshop environment. In this paper an attempt has been made to develop a heuristic algorithm, based on the reduced weightage of machines at each stage to generate different combination of ‘m-1’ sequences. The proposed heuristic has been tested on several benchmark problems of Taillard (1993) [Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.]. The performance of the proposed heuristic is compared with three well-known heuristics, namely Palmer’s heuristic, Campbell’s CDS heuristic, and Dannenbring’s rapid access heuristic. Results are evaluated with the best-known upper-bound solutions and found better than the above three.