| Article ID: | iaor20013930 |
| Country: | China |
| Volume: | 18 |
| Issue: | 3 |
| Start Page Number: | 37 |
| End Page Number: | 42 |
| Publication Date: | May 2000 |
| Journal: | Systems Engineering |
| Authors: | Tong Gang, Li Guangquan, Liu Baokun |
| Keywords: | genetic algorithms, job shop |
The earliness and tardiness scheduling problem with different due windows on the parallel machines is presented. To compile chromatic core, the coding technique using job numbers is proposed. The steady-step genetic algorithm is used for the before-mentioned problem. The results of computer simulation experiment indicate that the algorithm and coding technique are applicable and effective.