A Sequencing Problem with Release Dates and Clustered Jobs

This paper considers a one-machine scheduling problem where the objective is to minimize the sum of weighted completion times subject to release dates. A polynomial time algorithm is developed for the case when the jobs are clustered. The jobs in each cluster must be processed sequentially and the clusters are ordered. The insights developed are used in an efficient heuristic for the weighted completion time problem without clusters. Also, a class of release date problems is described for which the heuristic finds an optimal solution.

[1]  H. Weiss.  A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints , 1981 .

[2]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[3]  T. Morton,et al.  Algoristics for Single-Machine Sequencing with Precedence Constraints , 1978 .

[4]  Hiroaki Ishii,et al.  ALGORITHM FOR ONE MACHINE JOB SEQUENCING WITH PRECEDENCE CONSTRAINTS , 1981 .

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

[6]  Jitender S. Deogun.  On Scheduling with Ready Times to Minimize Mean Flow Time , 1983, Comput. J..

[7]  W. A. Horn.  Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .

[8]  D. Adolphson.  Optimal linear-ordering. , 1973 .

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

[10]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

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

[12]  Donald L. Adolphson,et al.  Single Machine Job Sequencing with Precedence Constraints , 1977, SIAM J. Comput..

[13]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[14]  Jitender S. Deogun,et al.  Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time , 1981, SIAM J. Comput..

[15]  T. B. Tate,et al.  Machine Scheduling Problems , 1978 .