论文信息 - Complexity results for scheduling chains on a single machine : (preprint)

Complexity results for scheduling chains on a single machine : (preprint)

Abstract We investigate the computational complexity of deterministic sequencing problems in which unit-time jobs have to be scheduled on a single machine subject to chain-like precedence constraints. NP-hardness is established for the cases in which the number of late jobs or the total weighted tardiness is to be minimized, and for several related problems involving the total weighted completion time criterion.

Jan Karel Lenstra | A. H. G. Rinnooy Kan | J. Lenstra | A. Kan

[1] David S. Johnson,et al. Scheduling Tasks with Nonuniform Deadlines on Two Processors , 1976, J. ACM.

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

[3] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[4] Jan Karel Lenstra,et al. Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[5] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[6] J. K. Lenstra,et al. Computational complexity of discrete optimization problems , 1977 .

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

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

[9] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

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

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

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