针对混合流水车间 ( Hybrid Flowshop,HFS)最小化工件全部完成作业时间 ( Makespan)调度问题 ,提出混合整数规划模型 ,基于斜度指标的方法来对工件进行排序 ,采用最先空闲设备( FAM)算法来分配设备 ,并给出其最优值的下界以检验该算法 .仿真结果表明 ,该方法能够较好地解决混合 HFS的调度问题 A hybrid integer programming model was proposed to minimize the number of jobs in a hybrid flowshop (HFS), and the workpieces were sorted based on the skewness index. The first idle device (FAM) algorithm To distribute the equipment and give the lower bound of its optimal value to test the algorithm.The simulation results show that this method can solve the scheduling problem of hybrid HFS