Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time

Abstract A branch and bound algorithm is proposed for the problem of scheduling jobs on identical parallel machines to minimize the total weighted completion time. Based upon a formulation which partitions the period of processing into unit time intervals, the lower bounding scheme is derived by performing a Lagrangean relaxation of the machine capacity constraints. A special feature is that the multipliers are obtained by a simple heuristic method which allows each lower bound to be computed in polynomial time. This bounding scheme, along with a new dominance rule, is incorporated into a branch and bound algorithm. Computational experience indicates that it is superior to known algorithms.

[1]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

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

[3]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

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

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

[6]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[7]  Salah E. Elmaghraby,et al.  On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .

[8]  S. Sarin,et al.  An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime , 1988 .

[9]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

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

[11]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[12]  L. V. Wassenhove,et al.  An algorithm for single machine sequencing with deadlines to minimize total weighted completion time , 1983 .

[13]  J. J. Brennan,et al.  An Improved Algorithm for Scheduling Jobs on Identical Machines , 1977 .

[14]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[15]  C. Potts.  A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .

[16]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[17]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

[18]  Seiki Kyan,et al.  Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem , 1986, SIAM J. Comput..