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

A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop

Author

Listed:
  • Hariri, A. M. A.
  • Potts, C. N.

Abstract

No abstract is available for this item.

Suggested Citation

  • Hariri, A. M. A. & Potts, C. N., 1989. "A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop," European Journal of Operational Research, Elsevier, vol. 38(2), pages 227-226, January.
    • Handle: RePEc:eee:ejores:v:38:y:1989:i:2:p:227-226
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(89)90107-0
    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. Lodree, Emmett & Jang, Wooseung & Klein, Cerry M., 2004. "A new rule for minimizing the number of tardy jobs in dynamic flow shops," European Journal of Operational Research, Elsevier, vol. 159(1), pages 258-263, November.
    2. Koulamas, Christos, 1998. "On the complexity of two-machine flowshop problems with due date related objectives," European Journal of Operational Research, Elsevier, vol. 106(1), pages 95-100, April.
    3. Bertel, S. & Billaut, J. -C., 2004. "A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation," European Journal of Operational Research, Elsevier, vol. 159(3), pages 651-662, December.
    4. Vincent T’kindt & Federico Della Croce & Jean-Louis Bouquard, 2007. "Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 64-72, February.
    5. Biskup, Dirk & Herrmann, Jan & Gupta, Jatinder N.D., 2008. "Scheduling identical parallel machines to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 115(1), pages 134-142, September.
    6. E. Dhouib & J. Teghem & T. Loukil, 2018. "Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic," Annals of Operations Research, Springer, vol. 267(1), pages 101-134, August.
    7. Naderi, Bahman & Roshanaei, Vahid, 2020. "Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 286(3), pages 811-827.
    8. Della Croce, Federico & Gupta, Jatinder N. D. & Tadei, Roberto, 2000. "Minimizing tardy jobs in a flowshop with common due date," European Journal of Operational Research, Elsevier, vol. 120(2), pages 375-381, January.

    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:38:y:1989:i:2:p:227-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.

    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.