IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v173y2006i2p583-599.html
   My bibliography  Save this article

Efficient scheduling of periodic information monitoring requests

Author

Listed:
  • Zeng, Daniel D.
  • Dror, Moshe
  • Chen, Hsinchun

Abstract

No abstract is available for this item.

Suggested Citation

  • Zeng, Daniel D. & Dror, Moshe & Chen, Hsinchun, 2006. "Efficient scheduling of periodic information monitoring requests," European Journal of Operational Research, Elsevier, vol. 173(2), pages 583-599, September.
    • Handle: RePEc:eee:ejores:v:173:y:2006:i:2:p:583-599
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00235-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jan Korst & Emile Aarts & Jan Karel Lenstra, 1997. "Scheduling Periodic Tasks with Slack," INFORMS Journal on Computing, INFORMS, vol. 9(4), pages 351-362, November.
    2. Jan Korst & Emile Aarts & Jan Karel Lenstra, 1996. "Scheduling Periodic Tasks," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 428-435, November.
    3. Hanen, Claire, 1994. "Study of a NP-hard cyclic scheduling problem: The recurrent job-shop," European Journal of Operational Research, Elsevier, vol. 72(1), pages 82-101, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Short, Michael, 2010. "A note on 'Efficient scheduling of periodic information monitoring requests'," European Journal of Operational Research, Elsevier, vol. 201(1), pages 329-335, February.
    2. Ryu, C. & Sharman, R. & Rao, H.R. & Upadhyaya, S., 2010. "Security protection design for deception and real system regimes: A model and analysis," European Journal of Operational Research, Elsevier, vol. 201(2), pages 545-556, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sofie Coene & Frits C. R. Spieksma & Gerhard J. Woeginger, 2011. "Charlemagne's Challenge: The Periodic Latency Problem," Operations Research, INFORMS, vol. 59(3), pages 674-683, June.
    2. Idir Hamaz & Laurent Houssin & Sonia Cafieri, 2018. "A robust basic cyclic scheduling problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(3), pages 291-313, September.
    3. Félix Quinton & Idir Hamaz & Laurent Houssin, 2020. "A mixed integer linear programming modelling for the flexible cyclic jobshop problem," Annals of Operations Research, Springer, vol. 285(1), pages 335-352, February.
    4. Liliana Cucu & Nicolas Pernet & Yves Sorel, 2008. "Periodic real-time scheduling: from deadline-based model to latency-based model," Annals of Operations Research, Springer, vol. 159(1), pages 41-51, March.
    5. Peter Brucker & Thomas Kampmeyer, 2008. "Cyclic job shop scheduling problems with blocking," Annals of Operations Research, Springer, vol. 159(1), pages 161-181, March.
    6. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    7. Přemysl Šůcha & Zdeněk Hanzálek, 2011. "A cyclic scheduling problem with an undetermined number of parallel identical processors," Computational Optimization and Applications, Springer, vol. 48(1), pages 71-90, January.
    8. Marchetti, Olivier & Munier-Kordon, Alix, 2009. "A sufficient condition for the liveness of weighted event graphs," European Journal of Operational Research, Elsevier, vol. 197(2), pages 532-540, September.
    9. Penn, Michal & Raviv, Tal, 2009. "An algorithm for the maximum revenue jobshop problem," European Journal of Operational Research, Elsevier, vol. 193(2), pages 437-450, March.
    10. Hamaz, Idir & Houssin, Laurent & Cafieri, Sonia, 2024. "The robust cyclic job shop problem," European Journal of Operational Research, Elsevier, vol. 312(3), pages 855-865.
    11. Hanen, Claire & Hanzalek, Zdenek, 2020. "Grouping tasks to save energy in a cyclic scheduling problem: A complexity study," European Journal of Operational Research, Elsevier, vol. 284(2), pages 445-459.
    12. Munier, A., 1996. "The complexity of a cyclic scheduling problem with identical machines and precedence constraints," European Journal of Operational Research, Elsevier, vol. 91(3), pages 471-480, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:173:y:2006:i:2:p:583-599. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.