Job-shop多机多目标调度

Multiobjective Scheduling On Multi-Machine Job-Shop

本文根据Ｊｏｂ－ｓｈｏＰ生产系统的特点，研究多机多目标调度问题，提出并建立总的流程时间、制造时间间隔期（ｍａｋｅｓｐａｎ）、总的机器空闲时间、延误工作数量、总的延误时间、总的提前时间、总的未完工费用、最大的延误时间、优先关系没有得到满足的工作数量等９个目标的多机多目标调度问题的一般模型，应用改进模拟运火方法进行了仿真实验．

In this paper, according to the characteristics of the Job-shop production System,we consider the multiobjective scheduling problem on multi-machine. It has been proposed andehablished that the general scheduling problem model of multiobjective on multi-machine whichhas nine objectives. total earnness. total incompletion cost. maximum ratdiness and the number ofjobs whose priority can not be satisfied. The simulated experiment is performed using this improved simulated annealing approach.