Numerical analysis of ion-implantation in target with a rectangular groove

Ion dynamics of pulsed plasma sheath during the plasma source ion-implantation (PSII) affects the resultant surface properties and structures. In this work, a two-dimensional fluid model is applied to the problem of computing ion dynamics in the sheath of a target with a rectangular groove. The evolution of sheath edge, x and y components of ion velocity on the target surface are simulated to describe the physics of sheath in PSII.     

Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines

In spite of many studies, investigating balancing and sequencing problems in Mixed-Model Assembly Line (MMAL) individually, this paper solves them simultaneously aiming to minimize total utility work. A new Mixed-Integer Linear Programming (MILP) model is developed to provide the exact solution of the problem with station-dependent assembly times. Because of NP-hardness, a Simulated Annealing (SA) is applied and compared to the Co-evolutionary Genetic Algorithm (Co-GA) from the literature. To strengthen the search process, two main hypotheses, namely simultaneous search and feasible search, are developed contrasting Co-GA. Various parameters of SA are reviewed to calibrate the algorithm by means of Taguchi design of experiments. Numerical results statistically show the efficiency and effectiveness of the proposed SA in terms of both the quality of solution and the time of achieving the best solution. Finally, the contribution of each hypothesis in this superiority is analyzed.     

Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min–max technique

In the literature of multi-objective problem, there are different algorithms to solve different optimization problems. This paper presents a min–max multi-objective procedure for a dual-objective, namely make span, and sum of the earliness and tardiness of jobs in due window machine scheduling problems, simultaneously. In formulation of min–max method when this method is combined with the weighting method, the decision maker can have the flexibility of mixed use of weights and distance parameter to yield a set of Pareto-efficient solutions. This research extends the new hybrid metaheuristic (HMH) to solve parallel machines scheduling problems with sequence-dependent setup time that comprises three components: an initial population generation method based on an ant colony optimization (ACO), a simulated annealing (SA) as an evolutionary algorithm employs certain probability to avoid becoming trapped in a local optimum, and a variable neighborhood search (VNS) which involves three local search procedures to improve the population. In addition, two VNS-based HMHs, which are a combination of two methods, SA/VNS and ACO/VNS, are also proposed to solve the addressed scheduling problems. A design of experiments approach is employed to calibrate the parameters. The non-dominated sets obtained from HMH and two best existing bi-criteria scheduling algorithms are compared in terms of various indices and the computational results show that the proposed algorithm is capable of producing a number of high-quality Pareto optimal scheduling plans. Aside, an extensive computational experience is carried out to analyze the different parameters of the algorithm.     

A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novel operators, to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a local-search-based metaheuristic. The performance of simulated annealing critically depends on its operators and parameters, in particular, its neighborhood search structure. In this paper, we propose an effective neighborhood search structure based on insertion neighborhoods as well as analyzing the behavior of simulated annealing with different types of operators and parameters by the means of Taguchi method. An experiment based on Taillard benchmark is conducted to evaluate the proposed algorithm against some effective algorithms existing in the literature. The results show that the proposed algorithm outperforms the other algorithms.     

Parallel-machine scheduling problems with sequence-dependent setup times using an ACO,SA and VNS hybrid algorithm

This paper proposes a hybrid metaheuristic for the minimization of makespan in scheduling problems with parallel machines and sequence-dependent setup times. The solution approach is robust, fast, and simply structured, and comprises three components: an initial population generation method based on an ant colony optimization (ACO), a simulated annealing (SA) for solution evolution, and a variable neighborhood search (VNS) which involves three local search procedures to improve the population. The hybridization of an ACO, SA with VNS, combining the advantages of these three individual components, is the key innovative aspect of the approach. Two algorithms of a hybrid VNS-based algorithm, SA/VNS and ACO/VNS, and the VNS algorithm presented previously are used to compare with the proposed hybrid algorithm to highlight its advantages in terms of generality and quality for large instances.     

Meta-heuristics implementation for scheduling of trucks in a cross-docking system with temporary storage

Cross-docking is an approach in inventory management which can reduce inventories, lead times and customer response time. In this strategy, products and shipments are unloaded from inbound trucks, sorted and categorized based on their characteristics, moved and loaded onto outbound trucks for delivery to demand points in a distribution network. The important fact is that, the items are stored in the inventory for a period which is primarily less than the actual time allocated to keep these items in a typical warehouse. Therefore, total cost and space requirement for inventory can be cut down. One of the most important targets in such systems is to establish coordination between the performance of inbound and outbound trucks in that these trucks can be scheduled, and the product items can be allocated to trucks effectively. This paper addresses some meta-heuristics to find the best sequence of inbound and outbound trucks, so that the objective, minimizing the total operation time called makespan, can be satisfied. Furthermore, not only the efficiency and capability of the algorithms’ parameters are assessed and analyzed by some performance measures, but also these meta-heuristics are compared with each other in order to find out the set of homogeneous algorithms among all proposed algorithms. By this analysis, it can be shown that the suitability of these meta-heuristics is quite sensible especially for the cross-docking systems with large sizes in which a high volume of inbound or outbound trucks transmit the product items.     

A multi-criteria cross-docking scheduling with just-in-time approach

This paper addresses a scheduling problem of inbound and outbound trailers in a cross-docking system according to just-in-time approach. In the cross-docking system, commodities are unloaded from inbound trailers, sorted and categorized based on their specifications and loaded onto outbound trailers for delivery to demand points in a distribution network. One of the most fundamental issues in such systems is to establish coordination between the performance of inbound and outbound trailers in that they can be scheduled, and the product items can be assigned to trailers effectively. As we observe the JIT concept, the punctuality and exactness of product deliveries are vital for the system’s performance. To satisfy this target, this paper considers a multi-criteria scheduling in which primary objective is to minimize earliness and tardiness simultaneously via a unified objective function. Three meta-heuristics are applied for this matter, and their solutions’ quality and the acquired elapsed time are compared with each other in each case.     

Effects of cold plasma on the color parameters of Hyssop (Hyssopus officinalis L.) using color imaging instrumentation and spectrophotometer

This research was conducted to evaluate the effects of cold atmospheric plasma treatment on the color of Hyssop (Hyssopus officinalis L.) and also to compare the usage of the spectrophotometer vs the color imaging instrumentation for the evaluation of the treatment on the color parameters. The experiments were investigated at different treatment times of 1, 5, and 10 minutes and the voltage values of 17, 20, and 23 kV. Possible changes of color were evaluated by using CIE L*a*b* values obtained with HunterLab colorimeter and CIE L*a*b* values obtained with a digital still camera (DSC) using digital image processing (MATLAB software). The values of L*, a*, and b* of the samples were obtained using both the methods. The results revealed that the L*, a*, and b* values of the treated Hyssop samples changed with increasing the treatment time and the voltage applied. Evaluating the interaction effects revealed that there was a significant difference in the (−a^*/b^* ) ratio. In addition, the results showed that the effects of all variables on the color parameters were significantly different in the case of the DSC using digital image processing. However, these effects were not significantly different using HunterLab colorimeter except for time variable and interaction effects of a* and (−a^*/b^* ) ratio. The lightest green color and the maximum chlorophyll content loss were observed for 23 kV applied over 10 minutes. Based on the results, the digital image processing can be used as a practical tool to study the variations at the color of dried Hyssop leaves after cold plasma treatment.     

Development of fitted line and fitted cosine curve for recognition and analysis of unnatural patterns in process control charts

Pattern Analysis and Applications - Unnatural patterns in process control charts exhibit out-of-control conditions. Therefore, increase in sensitivities in control charts is mandatory to study...     

Due window scheduling with sequence-dependent setup on parallel machines using three hybrid metaheuristic algorithms

Due-date determination problems have gained significant attention in recent years due to the industrial focus in the just-in-time philosophy. This paper considers a machine scheduling problem where jobs should be completed at times as close as possible to their respective due dates, and hence, both earliness and tardiness should be penalized. It is assumed that earliness and tardiness (ET) penalties will not occur if a job is completed within the due window. However, ET penalties will occur if a job is completed outside the due window. The objective is to determine a schedule that minimizes sum of the earliness and tardiness of jobs. To achieve this objective, three hybrid metaheuristics are proposed. The first metaheuristic is a hybrid algorithm which combines elements from both simulated annealing (SA) as constructive heuristic search and a variable neighborhood search (VNS) as local search improvement technique. The second one presents a hybrid metaheuristic algorithm which composed of a population generation method based on an ant colony optimization (ACO) and a VNS to improve the population. Finally, a hybrid metaheuristic approach is proposed which integrates several features from ACO, SA, and VNS in a new configurable scheduling algorithm. A design of experiments approach is employed to calibrate the parameters and operators of the algorithm. Computational experiments conducting on 252 randomly generated problems compare the results with the VNS algorithm proposed previously and show that the procedure is capable of producing consistently good results.