论文信息 - An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

We study the problem of minimizing, in the preemptive case, the number of late jobs on a single machine (1|pmtn,r"j|@?U"j). This problem can be solved by Lawler's algorithm [E.L. Lawler, Ann. Oper. Res. 26 (1990) 125-133] whose time and space complexities are respectively O(n^5) and O(n^3). We propose a new dynamic programming algorithm whose complexities are respectively O(n^4) and O(n^2).

Philippe Baptiste | P. Baptiste

[1] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2] Michael Randolph Garey,et al. Johnson: "computers and intractability , 1979 .

[3] Peter Brucker,et al. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[4] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .

[5] E. L. Lawler,et al. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .

[6] Toshihide Ibaraki,et al. A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Stéphane Dauzère-Pérès,et al. Minimizing late jobs in the general one machine scheduling problem , 1995 .

[9] J. Carlier. The one-machine sequencing problem , 1982 .

[10] L. V. Wassenhove,et al. Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

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