加权完工时间和的调整时间可分离Flow shop排序问题

Minimizing Total Weighted Completion Time in a Two-Machine Flow Shop with Sequence-Independent Setup Times

讨论了2台机器调整时间可分离的FlowShop排序问题,目标函数为极小化加权完工时间和.给出了对于一种特殊情况,问题存在多项式最优算法的充分条件.接着又给出了求解该问题的一个分枝定界法.

The two-machine flow shop scheduling problem with set-up times are separated and sequence independent is considered. The objective function is to minimize total weighted completion time. For a special case the sufficient condition is presented in which the problem can be solved by a polynomial algorithm. Moreover, a branch and bound algorithm is given.