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

Allocation of tasks to specialized processors: A planning approach

Author

Listed:
  • Becker, K. J.
  • Gaver, D. P.
  • Glazebrook, K. D.
  • Jacobs, P. A.
  • Lawphongpanich, S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Becker, K. J. & Gaver, D. P. & Glazebrook, K. D. & Jacobs, P. A. & Lawphongpanich, S., 2000. "Allocation of tasks to specialized processors: A planning approach," European Journal of Operational Research, Elsevier, vol. 126(1), pages 80-88, October.
    • Handle: RePEc:eee:ejores:v:126:y:2000:i:1:p:80-88
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00282-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. Dennis W. Fife, 1965. "Scheduling with Random Arrivals and Linear Loss Functions," Management Science, INFORMS, vol. 11(3), pages 429-437, 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. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.
    2. Dinard van der Laan, 2015. "Assigning Multiple Job Types to Parallel Specialized Servers," Tinbergen Institute Discussion Papers 15-102/III, Tinbergen Institute.
    3. P S Ansell & K D Glazebrook & C Kirkbride, 2003. "Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 379-389, April.
    4. Donald P. Gaver & Patricia A. Jacobs & Gennady Samorodnitsky & Kevin D. Glazebrook, 2006. "Modeling and analysis of uncertain time‐critical tasking problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(6), pages 588-599, September.

    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. Urtzi Ayesta & Peter Jacko & Vladimir Novak, 2017. "Scheduling of multi-class multi-server queueing systems with abandonments," Journal of Scheduling, Springer, vol. 20(2), pages 129-145, April.

    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:126:y:2000:i:1:p:80-88. 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.