一种新的用于Job-Shop问题的“准遗传算法”

A New "GA-like Arithmetic" for Job-Shop Problem

Job-shop问题是生产多品种产品类型企业或生产车间合理安排生产作业计划问题的一个抽象。配合现代计算技术,解决此类问题已出现多种算法,如遗传算法、模拟退火算法和启发算法等。本文对Job-shop问题,给出了一种新的算法———“准遗传算法”。

Job-Shop problem is an abstract of work shop schedule problem or factory plan problem which has many products and many devices. On the base of modern compute technology, we have developed many methods for solving the problem such as GA method, SA method and HA method, etc. A new GA-like method to Job-Shop problem is presented in the paper.