Abstract
This chapter addresses the scheduling problem of a sensor that constantly collects information from multiple sites. In the existing literature, the problem is solved by probabilistic approaches, potentially generating schedules in which a site is not visited for a long time. To overcome this deficiency, this chapter presents a deterministic approach formulated as an integer linear program. Upon showing that the problem is NP-Hard, the chapter develops valid lower and upper bounds and proposes two constructive heuristic methods. Tested via an extensive computational study, the heuristic methods are proven efficient and effective in solving the problem.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bar-Noy, A., Bhatia, R., Naor, J.S., Schieber, B.: Minimizing service and operations costs of periodic scheduling. Mathematics of Operations Research 27, 518–544 (2002)
Chen, D., Mok, A.: The pinwheel: A real-time scheduling problem (chapter 27). Chapman and Hall/CRC, Boca Raton (2004)
Feinberg, E.A., Curry, M.T.: Generalized pinwheel problem. Mathematical Methods of Operations Research 62, 99–122 (2005)
Filar, J.: Player aggregation in the traveling inspector model. IEEE Transactions on Automatic Control 30, 723–729 (1985)
Filar, J.A., Schultz, T.A.: The traveling inspector model. OR Spectrum 8, 33–36 (1986)
Miltenburg, J.: Level schedules for mixed-model assembly lines in just-in-time production systems. Management Science 35(2), 192–207 (1989)
Monden, Y.: Toyota Production System: An Integrated Approach to Just-In-Time, 3rd edn. Engineering & Management Press (1998)
Steiner, G., Yeomans, S.: Level schedules for mixed-model, just-in-time processes. Management Science 39(6), 728–735 (1993)
Tiwari, A., Jun, M., Jeffcoat, D., Murray, R.: The dynamic sensor coverage problem. In: Proceedings of the 16th International Federation of Automatic Control (IFAC) World Congress, Prague, Czech Republic (July 2005)
Yavuz, M., Akcali, E.: Production smoothing in just-in-time manufacturing systems: A review of the models and solution approaches. In: International Journal of Production Research (forthcoming, 2007)
Yerrick, N., Tiwari, A., Jeffcoat, D.: An investigation of a dynamic sensor motion strategy. In: Proceedings of the 6th Cooperative Control and Optimization Conference, Gainesville FL, February 2006, World Scientific, Singapore (2006)
Yerrick, N., Yavuz, M., Jeffcoat, D.: Two sensor motion models for the dynamic sensor coverage problem. In: Military Operations Research (forthcoming, 2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yavuz, M., Jeffcoat, D. (2007). An Analysis and Solution of the Sensor Scheduling Problem. In: Pardalos, P.M., Murphey, R., Grundel, D., Hirsch, M.J. (eds) Advances in Cooperative Control and Optimization. Lecture Notes in Control and Information Sciences, vol 369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74356-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-74356-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74354-5
Online ISBN: 978-3-540-74356-9
eBook Packages: EngineeringEngineering (R0)