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

Scheduling UET-UCT outforests to minimize maximum lateness

Author

Listed:
  • Singh, Gaurav

Abstract

No abstract is available for this item.

Suggested Citation

  • Singh, Gaurav, 2005. "Scheduling UET-UCT outforests to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 165(2), pages 468-478, September.
    • Handle: RePEc:eee:ejores:v:165:y:2005:i:2:p:468-478
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00254-1
    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. Chretienne, Philippe, 1989. "A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints," European Journal of Operational Research, Elsevier, vol. 43(2), pages 225-230, November.
    2. Peter Brucker & M. R. Garey & D. S. Johnson, 1977. "Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 275-284, August.
    3. Yakov Zinder & Duncan Roper, 1998. "An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness," Annals of Operations Research, Springer, vol. 81(0), pages 321-343, June.
    Full references (including those not matched with items on IDEAS)

    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. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    2. Malucelli, Federico, 1996. "A polynomially solvable class of quadratic semi-assignment problems," European Journal of Operational Research, Elsevier, vol. 91(3), pages 619-622, June.
    3. Yuri N. Sotskov, 2020. "Mixed Graph Colorings: A Historical Review," Mathematics, MDPI, vol. 8(3), pages 1-24, March.
    4. Maria Ayala & Abir Benabid & Christian Artigues & Claire Hanen, 2013. "The resource-constrained modulo scheduling problem: an experimental study," Computational Optimization and Applications, Springer, vol. 54(3), pages 645-673, April.
    5. Hans Kellerer & Thomas Tautenhahn & Gerhard Woeginger, 1995. "Note: Open‐shop scheduling with release dates to minimize maximum lateness," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 141-145, February.
    6. Timkovsky, Vadim G., 2003. "Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity," European Journal of Operational Research, Elsevier, vol. 149(2), pages 355-376, September.
    7. D. Prot & O. Bellenguez-Morineau, 2018. "A survey on how the structure of precedence constraints may change the complexity class of scheduling problems," Journal of Scheduling, Springer, vol. 21(1), pages 3-16, February.
    8. Felix Happach, 2021. "Makespan minimization with OR-precedence constraints," Journal of Scheduling, Springer, vol. 24(3), pages 319-328, June.
    9. Malucelli, Federico & Pretolani, Daniele, 1995. "Lower bounds for the quadratic semi-assignment problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 365-375, June.
    10. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    11. Tianyu Wang & Odile Bellenguez-Morineau, 2019. "The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints," Journal of Scheduling, Springer, vol. 22(3), pages 263-269, June.
    12. Zinder, Yakov, 2003. "An iterative algorithm for scheduling UET tasks with due dates and release times," European Journal of Operational Research, Elsevier, vol. 149(2), pages 404-416, September.

    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:165:y:2005:i:2:p:468-478. 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.