Resource Constrained Chain Scheduling of UET Jobs on Two Machines

References

• Błażewicz J. , Cellary W. , Słowiński R. , Wȩglarz J. Scheduling Under Resource Constraints: Deterministic Models (1987) (J. C. Baltzer, Basel, Germany) Google Scholar
• Błażewicz J. , Ecker K. , Schmidt G. , Wȩglarz J. Scheduling in Computer and Manufacturing Systems (1993) (Springer Verlag, Berlin and New York) Crossref, Google Scholar
• Błażewicz J. , Lenstra J. K. , Rinnooy Kan A. H. G. Scheduling subject to resource constraints: Classification and complexity. Discrete Appl. Math. (1983) 5 11 24 Crossref, Google Scholar
• Fujii M. , Kasami T. , Ninomiya K. Optimal sequencing of two equivalent processors. SIAM J. Appl. Math. (1969) 17 784 789 Crossref, Google Scholar
• Garey M. R. , Johnson D. S. Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. (1975) 4 397 411 Crossref, Google Scholar
• Graham R. L. , Lawler E. L. , Lenstra J. K. , Rinnooy Kan A. H. G. Optimization and approximation in deterministic sequencing and scheduling theory: A survey. Ann. Discrete Math. (1979) 5 287 326 Crossref, Google Scholar
• Kariv O. , Even S. An O(n 2.5) algorithm for maximum matching in general graphs. Sixteenth Annual Sympos. Foundations of Computer Science. IEEE (1975) 100 112 Google Scholar
• Röck H. (1984) . Unpublished Result Google Scholar
• Warmuth M. (1984) . Unpublished Result Google Scholar