A NOTE ON SCHEDULE OF N-JOBS ON 2 IDENTICAL MACHINES TO MINIMIZE WEIGHTED MEAN FLOW TIME

作者：WEBSTER S^*

来源：Computers & Industrial Engineering, 1994, 26(4): 795-796.

DOI：10.1016/0360-8352(94)90014-0

In a recent paper, Alidaee [Computers ind. Engng 24, 53-55 (1993)] notes the similarity between the scheduling problems of minimizing weighted mean flow time (WMFT) on two parallel machines and minimizing weighted earliness/tardiness (WET) about a common due date on a single machine. Based on this similarity, Aldaee describes how a dynamic programming algorithm proposed by Hall and Posner [Opns Res. 39, 836-846 (1991)] for the WET problem can be modified and applied to the WMFT problem. The work is an important extension of earlier results on an equivalence relationship between the WMFT and WET problems. This Note helps consolidate the literature by recognizing Rothkopf [Mgmt Sci. 12, 437-447 (1996)] as the originator of the algorithm described in [Computers ind. Engng 24, 53-55 (1993)].

• 出版日期1994-10