IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v46-47y1996i1p13-26.html
   My bibliography  Save this article

Using metaheuristics for solving a production scheduling problem in a chemical firm. A case study

Author

Listed:
  • Fortemps, Ph.
  • Ost, Ch.
  • Pirlot, M.
  • Teghem, J.
  • Tuyttens, D.

Abstract

No abstract is available for this item.

Suggested Citation

  • Fortemps, Ph. & Ost, Ch. & Pirlot, M. & Teghem, J. & Tuyttens, D., 1996. "Using metaheuristics for solving a production scheduling problem in a chemical firm. A case study," International Journal of Production Economics, Elsevier, vol. 46(1), pages 13-26, December.
    • Handle: RePEc:eee:proeco:v:46-47:y:1996:i:1:p:13-26
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0925-5273(95)00168-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.

    Citations

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


    Cited by:

    1. Ho, Nhu Binh & Tay, Joc Cing & Lai, Edmund M.-K., 2007. "An effective architecture for learning and evolving flexible job-shop schedules," European Journal of Operational Research, Elsevier, vol. 179(2), pages 316-333, June.
    2. Winker, Peter & Gilli, Manfred, 2004. "Applications of optimization heuristics to estimation and modelling problems," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 211-223, September.
    3. Portmann, M. -C. & Vignier, A. & Dardilhac, D. & Dezalay, D., 1998. "Branch and bound crossed with GA to solve hybrid flowshops," European Journal of Operational Research, Elsevier, vol. 107(2), pages 389-400, June.
    4. Allahverdi, Ali & Soroush, H.M., 2008. "The significance of reducing setup times/setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 978-984, June.
    5. Ristl, Robin & Xi, Dong & Glimm, Ekkehard & Posch, Martin, 2018. "Optimal exact tests for multiple binary endpoints," Computational Statistics & Data Analysis, Elsevier, vol. 122(C), pages 1-17.
    6. Nait Tahar, Djamel & Yalaoui, Farouk & Chu, Chengbin & Amodeo, Lionel, 2006. "A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 63-73, February.

    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:proeco:v:46-47:y:1996:i:1:p:13-26. 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/ijpe .

    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.