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

Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems

Author

Listed:
  • Brucker, Peter
  • Kramer, Andreas

Abstract

No abstract is available for this item.

Suggested Citation

  • Brucker, Peter & Kramer, Andreas, 1996. "Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems," European Journal of Operational Research, Elsevier, vol. 90(2), pages 214-226, April.
    • Handle: RePEc:eee:ejores:v:90:y:1996:i:2:p:214-226
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00350-9
    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. Joseph Y.-T. Leung, 1982. "On Scheduling Independent Tasks with Restricted Execution Times," Operations Research, INFORMS, vol. 30(1), pages 163-171, February.
    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. F Sivrikaya şerifoğlu & G Ulusoy, 2004. "Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 504-512, May.
    2. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    3. Lei Lei & Michael Pinedo & Lian Qi & Shengbin Wang & Jian Yang, 2015. "Personnel scheduling and supplies provisioning in emergency relief operations," Annals of Operations Research, Springer, vol. 235(1), pages 487-515, December.
    4. Jacomine Grobler & Andries Engelbrecht & Schalk Kok & Sarma Yadavalli, 2010. "Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time," Annals of Operations Research, Springer, vol. 180(1), pages 165-196, November.
    5. 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.
    6. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.
    7. Xiaoqiang Cai & Chung‐Yee Lee & Chung‐Lun Li, 1998. "Minimizing total completion time in two‐processor task systems with prespecified processor allocations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(2), pages 231-242, March.
    8. Jianer Chen & Chung‐Yee Lee, 1999. "General multiprocessor task scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 57-74, February.
    9. Oguz, Ceyda & Zinder, Yakov & Ha Do, Van & Janiak, Adam & Lichtenstein, Maciej, 2004. "Hybrid flow-shop scheduling problems with multiprocessor task systems," European Journal of Operational Research, Elsevier, vol. 152(1), pages 115-131, January.
    10. Martin Middendorf & Vadim G. Timkovsky, 1999. "Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 417-435, December.
    11. Zhang, Xiandong & (Yale) Gong, Yeming & Zhou, Shuyu & de Koster, René & van de Velde, Steef, 2016. "Increasing the revenue of self-storage warehouses by optimizing order scheduling," European Journal of Operational Research, Elsevier, vol. 252(1), pages 69-78.

    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. A. Agnetis & S. Smriglio, 2000. "Optimal assignment of high multiplicity flight plans to dispatchers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(5), pages 359-376, August.
    2. S. Thomas McCormick & Scott R. Smallwood & Frits C. R. Spieksma, 2001. "A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 31-49, February.
    3. Choi, Byung-Cheon & Briskorn, Dirk & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2008. "Allocating containers to ships with fixed departure times," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 641, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Bampis, Evripidis & Giannakos, Aristotelis & Konig, Jean-Claude, 1996. "On the complexity of scheduling with large communication delays," European Journal of Operational Research, Elsevier, vol. 94(2), pages 252-260, October.
    5. Jinwen Ou & Joseph Y.‐T. Leung & Chung‐Lun Li, 2008. "Scheduling parallel machines with inclusive processing set restrictions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 328-338, 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:90:y:1996:i:2:p:214-226. 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.