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

Necessary and sufficient conditions of optimality for some classical scheduling problems

Author

Listed:
  • Lin, Yixun
  • Wang, Xiumei

Abstract

No abstract is available for this item.

Suggested Citation

  • Lin, Yixun & Wang, Xiumei, 2007. "Necessary and sufficient conditions of optimality for some classical scheduling problems," European Journal of Operational Research, Elsevier, vol. 176(2), pages 809-818, January.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:809-818
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00719-8
    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. He, Cheng & Lin, Yixun & Yuan, Jinjiang, 2010. "A note on the single machine scheduling to minimize the number of tardy jobs with deadlines," European Journal of Operational Research, Elsevier, vol. 201(3), pages 966-970, March.
    2. Della Croce, Federico & T’kindt, Vincent & Ploton, Olivier, 2021. "Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    3. Marjan Akker & Han Hoogeveen & Judith Stoef, 2018. "Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times," Journal of Scheduling, Springer, vol. 21(6), pages 607-617, December.
    4. Yakov Shafransky & Viktor Shinkarevich, 2020. "On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty," Journal of Scheduling, Springer, vol. 23(6), pages 745-749, December.
    5. Peter Brucker & Natalia V. Shakhlevich, 2016. "Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines," Journal of Scheduling, Springer, vol. 19(6), pages 659-685, 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:176:y:2007:i:2:p:809-818. 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.