同序流水作业问题的建模及求解算法

Solving Flow Shop Scheduling Problem

该文针对每项任务有两道工序,每道工序由若干台平行机组成,目标为makespan最小化且避免先到任务延期太长的同序流水作业调度问题,提出了一种Johnson序结合自然序的混合型算法。将此算法下的总完工时间与纯自然序下的总完工时间进行比较,并通过计算机随机模拟的实例得以验证前者的加工方法较优,且避免了先到任务延期太长而不能被客户所接受的情况。

This paper proposes a hybrid algorithm combined the natural sequence with Johnson algorithm a- bout the flow shop scheduling problem aiming to minimize makespan and avoid first task was delayed too long. That problem＇s tasks have two procedures and each procedure is composed of two parallel machines. Compared hybrid algorithm＇s makespan with natural sequence＇s makespan, and through the computer random simulation examples, can validate the former processing method is best. It avoids first task was delayed too long to he accepted.