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

Scheduling jobs within time windows on identical parallel machines: New model and algorithms

Author

Listed:
  • Gabrel, Virginie

Abstract

No abstract is available for this item.

Suggested Citation

  • Gabrel, Virginie, 1995. "Scheduling jobs within time windows on identical parallel machines: New model and algorithms," European Journal of Operational Research, Elsevier, vol. 83(2), pages 320-329, June.
  • Handle: RePEc:eee:ejores:v:83:y:1995:i:2:p:320-329
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00010-N
    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. Jansen, Klaus, 1994. "An approximation algorithm for the license and shift class design problem," European Journal of Operational Research, Elsevier, vol. 73(1), pages 127-131, February.
    2. Kolen, Antoon W. J. & Kroon, Leo G., 1993. "On the computational complexity of (maximum) shift class scheduling," European Journal of Operational Research, Elsevier, vol. 64(1), pages 138-151, 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. repec:pal:jorsoc:v:55:y:2004:i:11:d:10.1057_palgrave.jors.2601795 is not listed on IDEAS
    2. Crevits, Igor & Debernard, Serge & Denecker, Pascal, 2002. "Model building for air-traffic controllers' workload regulation," European Journal of Operational Research, Elsevier, vol. 136(2), pages 324-332, January.
    3. repec:pal:jorsoc:v:54:y:2003:i:8:d:10.1057_palgrave.jors.2601575 is not listed on IDEAS
    4. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, 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:83:y:1995:i:2:p:320-329. See general information about how to correct material in RePEc.

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

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.