Periodic Scheduling with Service Constraints

References

  • Anily S., Glass C. A., Hassin R. The scheduling of maintenance service. Discrete Appl. Math. (1997a) 82:27–42CrossrefGoogle Scholar
  • Anily S., Glass C. A., Hassin R. Scheduling maintenance service to three machines. Annals of Oper. Res. (1999) . Special Vol. on Combinatorial Optimisation: Recent Advances in Theory and PracticeCrossrefGoogle Scholar
  • Bar-Noy A., Bhatia R., Naor J., Schieber B. Minimizing service and operations costs of periodic scheduling. (1997) . Working Paper, Electrical Engineering Dept., Tel-Aviv UniversityGoogle Scholar
  • Chandrasekaran R., Mukhopadhyay A., Yang P. Optimal ordering policies for a capacity constrained two-item inventory system. (1992a) . Working Paper, The University of Texas at DallasGoogle Scholar
  • Chandrasekaran R., Mukhopadhyay A., Yang P. Optimal ordering policies for a capacity constrained multi-item inventory system. (1992b) . Working Paper, The University of Texas at DallasGoogle 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. Euro. J. Oper. Res. (1994) 75:354–364CrossrefGoogle Scholar
  • Hassin R., Meggido N. Exact computation of optimal inventory policies over an unbounded horizon. Math. Oper. Res. (1991) 16:534–546LinkGoogle Scholar
  • Holte R., Rosier L., Tulshinsky I., Varvel D. Pinwheel scheduling with two distinct numbers. Theoretical Comput. Sci. (1992) 100:105–135CrossrefGoogle Scholar
  • Mok A., Rosier L., Tulshinsky I., Varvel D. Algorithms and complexity of the periodic maintenance problem. Microprocessing and Microprogramming (1989) 27:657–664CrossrefGoogle Scholar
  • Wei W., Liu C. On a periodic maintenance problem. Oper. Res. Lett. (1983) 2:90–93CrossrefGoogle 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.