作业车间调度问题是最困难的组合优化问题之一,在实际生产中具有广泛应用。调度的目的是使完工时间最小化。本文针对实际的具有批量调度问题,分析并比较了几种调度策略。采用遗传算法进行求解,针对作业车间调度问题使用了一种单亲移位算子进行交叉和变异以避免不可行解的产生。最后给出了这些调度策略的仿真实例,结果表明,使用不同的调度策略将得到不同的优化结果,为实际的生产提供一定的指导作用。
Job-shop scheduling problem(JSP)is one of the most difficult combinatorial optimization problems which are widely applied to the practical production.The purpose of job-shop scheduling is to minimize the completion time.Aiming at batch process scheduling problem,several schemes are analyzed and compared.A partheno-genetic operation(PGO)for crossover operation in JSP is proposed in order to avoid unfeasible solutions. Finally,an example is given and the results of these schemes show that the different optimal scheduling results will be obtained by different schemes.Therefore,these schemes can provide certain instructional significance for practical production.