On the complexity of preemptive openshop scheduling problems
暂无分享,去创建一个
[1] Eugene L. Lawler,et al. Minimizing Maximum Lateness in a Two-Machine Open Shop , 1979, Math. Oper. Res..
[2] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[3] Teofilo F. Gonzalez,et al. A Note on Open Shop Preemptive Schedules , 1979, IEEE Transactions on Computers.
[4] B. J. Lageweg,et al. Computer aided complexity classification of deterministic scheduling problems , 1981 .
[5] Robert L. Bulfin,et al. Scheduling ordered open shops , 1987, Comput. Oper. Res..
[6] Eugene L. Lawler,et al. Scheduling open shops with parallel machines , 1982, Oper. Res. Lett..
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Joseph Y.-T. Leung,et al. Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops , 1993, J. Algorithms.
[9] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.
[10] Teofilo F. Gonzalez,et al. Unit Execution Time Shop Problems , 1982, Math. Oper. Res..
[11] D. de Werra,et al. Preemptive Scheduling, Linear Programming and Network Flows , 1984 .
[12] Jacek Blazewicz,et al. Scheduling under resource constraints - deterministic models , 1986 .
[13] W. Kubiak,et al. A Note On The Complexity Of Openshop Scheduling Problems , 1991 .
[14] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[15] Sartaj Sahni,et al. Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops , 1981, Oper. Res..
[16] Eugene L. Lawler,et al. On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.
[17] Chelliah Sriskandarajah,et al. Openshops with Jobs Overlap , 1993 .
[18] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[19] C. Y. Liu,et al. On the complexity of preemptive open-shop scheduling problems , 1985 .