Minimizing Service and Operation Costs of Periodic Scheduling

References

  • Acharya S., Alonso R., Franklin M. J., Zdonik S. Broadcast disks: Data management for asymmetric communications environment. ACM SIGMOD Internat. Conf. on Management of Data (SIGMOD 95) (1995) San Jose, CA:199–210CrossrefGoogle Scholar
  • Acharya S., Franklin M. J., Zdonik S. Dissemination-based data delivery using broadcast disks. IEEE Personal Comm. (1995) 2(6):50–60CrossrefGoogle Scholar
  • Ammar M. H., Wong J. W. The design of teletext broadcast cycles. Performance Eval. (1985) 5(4):235–242CrossrefGoogle Scholar
  • Ammar M. H., Wong J. W. On the optimality of cyclic transmission in Teletext systems. IEEE Trans. Comm. (1987) COM-35(1):68–73CrossrefGoogle Scholar
  • Anily S., Glass C. A., Hassin R. The scheduling of maintenance service. Discrete Appl. Math. (1998) 82:27–42CrossrefGoogle Scholar
  • Anily S., Glass C. A., Hassin R. Scheduling of maintenance services to three machines. Ann. Oper. Res. (1999) 86:375–391CrossrefGoogle Scholar
  • Chan M. Y., Chin F. General schedulers for the pinwheel problem based on double-integer reduction. IEEE Trans. Comput. (1992) 41(6):755–768CrossrefGoogle Scholar
  • Chan M. Y., Chin F. Schedulers for larger classes of pinwheel instances. Algorithmica (1993) 9:425–462CrossrefGoogle Scholar
  • Dahlquist G., Björck Å.Numerical Methods (1974) (Prentice-Hall, Inc., Englewood Cliffs, NJ) Google Scholar
  • Feller W.An Introduction to the Theory of Probability and Its Applications (1967) (John Wiley and Sons, New York) CrossrefGoogle Scholar
  • Glass C. A. Feasibility of scheduling lot sizes of three products on one machine. Management Sci. (1992) 38:1482–1494LinkGoogle Scholar
  • Glass C. A. Feasibility of scheduling lot sizes of two frequencies on one machine. Eur. J. Oper. Res. (1994) 75:354–364CrossrefGoogle Scholar
  • Graham R. L., Knuth D. E., Patashnik O.Concrete Mathematics (1989) (Addison-Wesley, Reading, MA) Google Scholar
  • Hadley G., Whitin T. M.Analysis of Inventory Systems (1963) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
  • Hassin R., Megiddo N. Exact computation of optimal inventory policies over an unbounded horizon. Math. Oper. Res. (1991) 16:534–546LinkGoogle Scholar
  • Hofri M., Rosberg Z. Packet delay under the golden ratio weighted TDM policy in a multiple-access channel. IEEE Trans. Inform. Theory (1987) 11–33:341–349CrossrefGoogle Scholar
  • Holte R., Rosier L., Tulchinsky I., Varvel D. Pinwheel scheduling with two distinct numbers. Theoret. Comput. Sci. (1992) 100:105–135CrossrefGoogle Scholar
  • Imielinski T., Viswanathan S., Badrinath B. Energy efficient indexing on air. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 94) (1994) Minneapolis, MN:25–36CrossrefGoogle Scholar
  • Itai A., Rosberg Z. A golden ratio control policy for a multiple-access channel. IEEE Trans. Automat. Contr. (1984) AC-29:712–718CrossrefGoogle Scholar
  • Kenyon C., Schabanel N. The data broadcast problem with non-uniform transmission times. Proc. 10th Annual ACM-SIAM Sympos. on Discrete Algorithms (SODA 99) (1999) Baltimore, MD:547–556Google Scholar
  • Knuth D. E.The Art of Computer Programming (1973) 1(Addison-Wesley, Reading, MA) Google Scholar
  • Roundy R. 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Sci. (1985) 31:1416–1430LinkGoogle Scholar
  • Su C. J., Tassiulas L. Broadcast scheduling for information distribution. Proc. IEEE Infocom (Infocom 97) (1997) Kobe, Japan:109–117Google Scholar
  • Wei W., Liu C. On a periodic maintenance problem. Oper. Res. Lett. (1983) 2:90–93CrossrefGoogle Scholar
  • Vaidya N., Hameed S. Log time algorithms for scheduling single and multiple channel data broadcast. Proc. 3rd Ann. ACM/IEEE Internat. Conf. on Mobile Comput. and Networking (Mobicom 97) (1997) Budapest, Hungary:90–99Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.