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

Scheduling of resource tasks

Author

Listed:
  • Ecker, Klaus H.

Abstract

No abstract is available for this item.

Suggested Citation

  • Ecker, Klaus H., 1999. "Scheduling of resource tasks," European Journal of Operational Research, Elsevier, vol. 115(2), pages 314-327, June.
  • Handle: RePEc:eee:ejores:v:115:y:1999:i:2:p:314-327
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00226-4
    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. Jeffrey B. Sidney & George Steiner, 1986. "Optimal Sequencing by Modular Decomposition: Polynomial Algorithms," Operations Research, INFORMS, vol. 34(4), pages 606-612, August.
    2. T. C. Hu, 1961. "Parallel Sequencing and Assembly Line Problems," Operations Research, INFORMS, vol. 9(6), pages 841-848, December.
    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. Ecker, K. H. & Gupta, J. N. D., 2005. "Scheduling tasks on a flexible manufacturing machine to minimize tool change delays," European Journal of Operational Research, Elsevier, vol. 164(3), pages 627-638, August.
    2. Rodriguez Diaz, Antonio & Tchernykh, Andrei & Ecker, Klaus H., 2003. "Algorithms for dynamic scheduling of unit execution time tasks," European Journal of Operational Research, Elsevier, vol. 146(2), pages 403-416, April.

    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. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    2. Ramachandra, Girish & Elmaghraby, Salah E., 2006. "Sequencing precedence-related jobs on two machines to minimize the weighted completion time," International Journal of Production Economics, Elsevier, vol. 100(1), pages 44-58, March.
    3. Demeulemeester, Erik L. & Herroelen, Willy S. & Elmaghraby, Salah E., 1996. "Optimal procedures for the discrete time/cost trade-off problem in project networks," European Journal of Operational Research, Elsevier, vol. 88(1), pages 50-68, January.
    4. 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.
    5. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "An Introduction To Multiprocessor Scheduling," Econometric Institute Archives 272258, Erasmus University Rotterdam.
    6. Tianyu Wang & Odile Bellenguez, 2021. "Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time," Journal of Scheduling, Springer, vol. 24(6), pages 649-662, December.
    7. Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
    8. Blazewicz, Jacek & Liu, Zhen, 2002. "Linear and quadratic algorithms for scheduling chains and opposite chains," European Journal of Operational Research, Elsevier, vol. 137(2), pages 248-264, March.
    9. Rodriguez Diaz, Antonio & Tchernykh, Andrei & Ecker, Klaus H., 2003. "Algorithms for dynamic scheduling of unit execution time tasks," European Journal of Operational Research, Elsevier, vol. 146(2), pages 403-416, April.
    10. Sonja Kolen & Stefan Dähling & Timo Isermann & Antonello Monti, 2018. "Enabling the Analysis of Emergent Behavior in Future Electrical Distribution Systems Using Agent-Based Modeling and Simulation," Complexity, Hindawi, vol. 2018, pages 1-16, February.
    11. Wilbert E. Wilhelm, 1987. "Complexity of sequencing tasks in assembly cells attended by one or two robots," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 721-738, October.
    12. 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.
    13. 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.
    14. Krishnamoorthy, Venkatesh & Efe, Kemal, 1996. "Task scheduling with and without communication delays: A unified approach," European Journal of Operational Research, Elsevier, vol. 89(2), pages 366-379, March.
    15. Markó Horváth & Tamás Kis, 2020. "Polyhedral results for position-based scheduling of chains on a single machine," Annals of Operations Research, Springer, vol. 284(1), pages 283-322, January.
    16. Kap Hwan Kim & Jong Wook Bae, 2004. "A Look-Ahead Dispatching Method for Automated Guided Vehicles in Automated Port Container Terminals," Transportation Science, INFORMS, vol. 38(2), pages 224-234, May.
    17. Joseph Y.‐T. Leung & Michael Pinedo, 2004. "A note on scheduling parallel machines subject to breakdown and repair," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(1), pages 60-71, February.
    18. Tianyu Wang & Odile Bellenguez-Morineau, 2019. "A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time," Journal of Scheduling, Springer, vol. 22(6), pages 709-714, December.
    19. Blazwicz, Jacek & Liu, Zhen, 1996. "Scheduling multiprocessor tasks with chain constraints," European Journal of Operational Research, Elsevier, vol. 94(2), pages 231-241, October.
    20. Nodari Vakhania, 2001. "Tight Performance Bounds of CP-Scheduling on Out-Trees," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 445-464, December.

    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:115:y:1999:i:2:p:314-327. 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.