基于JIT的一类零件排序问题的通用模型及解法

A GENERALIZED MODEL AND ALGORITHM FOR A CLASS JOB SCHEDULING PROBLEM BASED ON JIT TECHNIQUE

提出了在ＪＩＴ意义下，由ｍ（ ｍ ≥２） 台加工设备组成的柔性制造系统一类零件排序问题的通用模型，证明了该问题是一个ＮＰ完全问题，构造出求解该模型的一个启发式算法。数值例子表明，该算法构思新颖，计算复杂性低，有较为理想的优化效果。

In this paper, A generalized multi-objective model is presented for minimizing the range of lateness and make-span of multi-processors based on JIT technique, It is proved that the job scheduling problem is a NP complete problem. A heuristic algorithm is given to solve the scheduling problem. The numerical example illustrates that the heuristic algorithm is designed very well and can find very good solution of the scheduling problem.