Scheduling with Finite Capacity Input Buffers

References

• Arkin E. M. , Silverberg E. B. Scheduling jobs with fixed start and end times. Discrete Applied Math. (1987) 18 1 8 Crossref, Google Scholar
• Garey M. R. , Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Graham R. L. , Lawler E. L. , Lenstra J. K. , Rinnooy Kan A. H. G. Optimization and approximation in deterministic machine scheduling: A survey. Ann. Discrete Math. (1979) 5 287 326 Crossref, Google Scholar
• Hall N. G. , Posner M. E. , Potts C. N. Scheduling with finite capacity input buffers. (1996) . Technical report, Industrial Engineering, The Ohio State University, Columbus, Ohio Google Scholar
• Hall N. G. , Posner M. E. , Potts C. N. Preemptive scheduling with finite capacity input buffers. Ann. O. R. (1997) 70 399 413 Crossref, Google Scholar
• Hall N. G. , Posner M. E. , Potts C. N. Scheduling with finite capacity output buffers. Opns. Res. (1998) 46this issueGoogle Scholar
• Kruse R. L. Data Structures and Program Design (1987) 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Mcclain J. O. , Thomas L. J. Operations Management (1985) 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Nawijn W. M. Minimum loss scheduling problems. Eur. J. Opnl. Res. (1992) 56 364 369 Crossref, Google Scholar
• Nawijn W. M. , Kern W. , Baas S. Scheduling jobs with release times on a machine with finite storage. Eur. J. Opnl. Res. (1994) 74 120 127 Crossref, Google Scholar
• Orlin J. B. A faster strongly polynomial minimum cost flow algorithm. Proc. 20th ACM Sympos. Theory Computing (1988) 377 387 Crossref, Google Scholar