一个成组加工中加工时间可变的加工全程问题

Makespan Problem in Group Processing with Controllable Processing Time

该文考虑在成组加工中工件加工时间受位置影响的单机排序问题.目标函数为极小化加工全程.我们给出了此问题的最优性条件,并且构造了一个最优算法.

This paper considers a single machine scheduling problem in group processing with the processing time affected by their positions in a sequence. A minimized makespan is taken as an objective function. Optimal conditions are given and an optimal algorithm constructed.