Inventory based two-objective job shop scheduling model and its hybrid genetic algorithm
Applied Soft Computing
| Hi-index | 0.00 |
Job shop scheduling problem is a typical NP-hard problem. In this paper, new designed crossover and mutation operators based on the characteristic of the job shop problem itself are specifically designed. Based on these, an improved genetic algorithm is proposed. The computer simulations are made on a set of benchmark problems and the results indicate the effectiveness of the proposed algorithm.