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

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

Author

Listed:
  • Nowicki, Eugeniusz

Abstract

No abstract is available for this item.

Suggested Citation

  • Nowicki, Eugeniusz, 1994. "An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times," European Journal of Operational Research, Elsevier, vol. 72(1), pages 74-81, January.
    • Handle: RePEc:eee:ejores:v:72:y:1994:i:1:p:74-81
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)90331-X
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Schmidt, Gunter, 2000. "Performance guarantee of two simple priority rules for production scheduling," International Journal of Production Economics, Elsevier, vol. 68(2), pages 151-159, November.
    2. Kurz, Mary E. & Askin, Ronald G., 2004. "Scheduling flexible flow lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 159(1), pages 66-82, November.
    3. Kurz, Mary E. & Askin, Ronald G., 2003. "Comparing scheduling rules for flexible flow lines," International Journal of Production Economics, Elsevier, vol. 85(3), pages 371-388, September.
    4. Philip Kaminsky, 2003. "The effectiveness of the longest delivery time rule for the flow shop delivery time problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(3), pages 257-272, April.
    5. Alejandro Reynoso & Nodari Vakhania, 2021. "Theoretical and practical issues in single-machine scheduling with two job release and delivery times," Journal of Scheduling, Springer, vol. 24(6), pages 615-647, 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:72:y:1994:i:1:p:74-81. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.