A Cross Entropy-Genetic Algorithm for m-Machines No-Wait Job-ShopScheduling Problem

Abstract

No-wait job-shop scheduling (NWJSS) problem is one of the classical scheduling problems that exist on many kinds of industry with no-wait constraint, such as metal working, plastic, chemical, and food industries. Several methods have been proposed to solve this problem, both exact (i.e. integer programming) and metaheuristic methods. Cross entropy (CE), as a new metaheuristic, can be an alternative method to solve NWJSS problem. This method has been used in combinatorial optimization, as well as multi-external optimization and rare-event simulation. On these problems, CE implementation results an optimal value with less computational time in average. However, using original CE to solve large scale NWJSS requires high computational time. Considering this shortcoming, this paper proposed a hybrid of cross entropy with genetic algorithm (GA), called CEGA, on m-machines NWJSS. The results are compared with other metaheuritics: Genetic Algorithm-Simulated Annealing (GASA) and hybrid tabu search. The results showed that CEGA providing better or at least equal makespans in comparison with the other two methods

Using Multiobjective Genetic Algorithm and Multicriteria Analysis for the Production Scheduling of a Brazilian Garment Company

“…(1) The addressed problem is similar to some works found in the literature, like Senthilkumar and Narayanan [11], Santosa, Budiman and Wiratino [12], Abdelmaguid [13], Dayou, Pu and Ji [14], Chang and Chyu [15] and Franco [16]. However, these works do not consider real-time tasks sequencing or are not applied to real problems.…”

Genetic Algorithms for Perceptual Codes Extraction

“…In our experiments, it was found that a crossover probability Pc = 0.6, or higher, produced good results. One point crossover is realized by cutting the chromosomes at a randomly chosen position and then swapping the segments between the two parents [28,29].…”

“…Mutation in evolutionary algorithms is another search operator. Its main function is to introduce new genetic material and maintain a certain level of diversity in a population since crossover does not introduce any new genetic material [28,29]. In our approach, the remaining candidates of the next generation (after crossover) are formed by the mutation operations.…”

Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropy-genetic algorithm: a case study in Indonesia

“…However, CE needs longer computation time if it stands alone. Thus, we hybridized the CE with genetic algorithm (GA) to reduce the computation time (Santosa, Budiman, & Wiratno, 2011). Using a feature of GA, a new sample can be obtained quickly through a mutation mechanism.…”