Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs
暂无分享,去创建一个
[1] A. M. Geoffrion,et al. Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .
[2] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.
[3] Toshihide Ibaraki,et al. A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..
[4] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..
[5] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Ronald L. Rardin,et al. An Overview of Complexity Theory in Discrete Optimizations: Part I. Concepts , 1982 .
[8] Ronald L. Rardin,et al. An Overview of Complexity Theory in Discrete Optimization: Part II. Results and Implications , 1982 .
[9] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[10] Eugene L. Lawler. On Scheduling Problems with Deferral Costs , 1964 .
[11] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[12] T. B. Tate,et al. Machine Scheduling Problems , 1978 .
[13] Marion Lauriere. An algorithm for the 0/1 Knapsack problem , 1978, Math. Program..