JIT意义下极大化顾客满意数的并行多机问题

随着JIT(Just-In-Time)生产管理技术的出现和发展,考虑到以往极大化顾客满意数问题的研究只限于单机问题,而实际的生产调度和计划管理中绝大多数情况是并行多机问题,提出了一个在JIT意义下, 极大化顾客满意数的并行多机问题,并在分析相应的单机问题最优排序的基础上,构造出一个求解其多机问题的启发式算法,该算法的构思新颖,计算复杂性低,适用求解多机问题,具有工程实用价值的有效算法.最后给出了一个数值例子.

Job scheduling problem of maximizing customers'satisfaction degree on parallel machines based on JIT technique

The emergence of JIT (Just-In-Time) management technology has opened up a recent research field for job scheduling and production. The research on the job scheduling problem of maximizing customers' satisfaction degree used to be mostly based on a single machine. Yet most actual scheduling and project management cases need scheduling on parallel machines. In view of this, a mathematical model for the job scheduling problem of minimizing the make span and maximizing customers' satisfaction degree is put forward. According to the algorithm on single machines, a heuristic algorithm is presented to find an approximate solution for the scheduling problem on parallel machines. The numerical example illustrates that the heuristic algorithm is very effective in obtaining near-optimal solution.