Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem

A high multiplicity scheduling problem consists of many jobs which can be partitioned into relatively few groups, where all the jobs within each group are identical. Polynomial, and even strongly polynomial, algorithms for the standard scheduling problem, in which all jobs are assumed to be distinct, become exponential for the corresponding high multiplicity problem. In this paper, we study various high multiplicity problems of scheduling unit-time jobs on a single machine. We provide strongly polynomial algorithms for constructing optimal schedules with respect to several measures of efficiency (completion time, lateness, tardiness, the number of tardy jobs and their weighted counterparts). The algorithms require a number of operations that are polynomial in the number of groups rather than in the total number of jobs. As a by-product, we identify a new family of nxn transportation problems which are solvable in O(n log n) time by a simple greedy algorithm.

[1]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[2]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[3]  Thomas Lengauer,et al.  The complexity of compacting hierarchically specified layouts of integrated circuits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[5]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Approach for Sequencing Groups of Identical Jobs , 1980, Oper. Res..

[6]  Kenneth Steiglitz,et al.  Testing for cycles in infinite graphs with periodic structure , 1987, STOC.

[7]  Ron Shamir,et al.  Minimizing the number of tardy job units under release time constraints , 1990, Discret. Appl. Math..

[8]  Christos H. Papadimitriou,et al.  The Traveling Salesman Problem with Many Visits to Few Cities , 1984, SIAM J. Comput..

[9]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: practical and theoretical results , 1987 .

[10]  James B. Orlin,et al.  A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[11]  Thomas Lengauer,et al.  Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs , 1987, J. Algorithms.

[12]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[13]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[14]  Thomas Lengauer,et al.  Hierarchical planarity testing algorithms , 1989, JACM.

[15]  Michael Rothkopf,et al.  Letter to the Editor - The Traveling Salesman Problem: On the Reduction of Certain Large Problems to Smaller Ones , 1966, Operational Research.

[16]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .