论文信息 - A Note on the Generalized Due Dates Scheduling Problems - 字舞流文

A Note on the Generalized Due Dates Scheduling Problems

Chelliah Sriskandarajah

[1] Eugene L. Lawler,et al. Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

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

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

[4] Nicholas G. Hall. Scheduling Problems With Generalized Due Dates , 1986 .

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

[6] Jan Karel Lenstra,et al. Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints , 1983, Oper. Res..

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

[8] Jan Karel Lenstra,et al. Complexity results for scheduling chains on a single machine : (preprint) , 1980 .

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