论文信息 - Schedule of n jobs on two identical machines to minimize weighted mean flow time

Schedule of n jobs on two identical machines to minimize weighted mean flow time

Abstract In this note we consider the problem of scheduling n jobs on two identical processors to minimize weighted flow time (WMFT). Similarities between this problem and weighted earliness and tardiness (WET) on a single machine [6] is discussed. Based on results on recent developments on WET problem, we give a dynamic programming algorithm for the WMFT problem on two identical processors.

Bahram Alidaee

[1] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[2] Marc E. Posner,et al. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[3] T.C.E. Cheng,et al. Survey of scheduling research involving due date determination decisions , 1989 .

[4] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[5] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .

[6] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[7] Shimon Even,et al. Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .

[8] Kenneth R. Baker,et al. Scheduling with parallel processors and linear delay costs , 1973 .

[9] Albert Schild,et al. On Scheduling Tasks with Associated Linear Loss Functions , 1961 .

[10] Michael H. Rothkopf,et al. Scheduling Independent Tasks on Parallel Processors , 1966 .

[11] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..