IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v58y1999i2p115-129.html
   My bibliography  Save this article

A hierarchical planning system for energy intensive production environments

Author

Listed:
  • Ozdamar, Linet
  • Birbil, Sevket Ilker

Abstract

No abstract is available for this item.

Suggested Citation

  • Ozdamar, Linet & Birbil, Sevket Ilker, 1999. "A hierarchical planning system for energy intensive production environments," International Journal of Production Economics, Elsevier, vol. 58(2), pages 115-129, January.
    • Handle: RePEc:eee:proeco:v:58:y:1999:i:2:p:115-129
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(98)00076-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.

    References listed on IDEAS

    as
    1. Ozdamar, Linet & Bozyel, M. Ali & Birbil, S. Ilker, 1998. "A hierarchical decision support system for production planning (with case study)," European Journal of Operational Research, Elsevier, vol. 104(3), pages 403-422, February.
    2. Cattrysse, Dirk & Maes, Johan & Van Wassenhove, Luk N., 1990. "Set partitioning and column generation heuristics for capacitated dynamic lotsizing," European Journal of Operational Research, Elsevier, vol. 46(1), pages 38-47, May.
    3. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    4. Cheng, T. C. E. & Sin, C. C. S., 1990. "A state-of-the-art review of parallel-machine scheduling research," European Journal of Operational Research, Elsevier, vol. 47(3), pages 271-292, August.
    5. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    6. Matthew J. Liberatore & Tan Miller, 1985. "A Hierarchical Production Planning System," Interfaces, INFORMS, vol. 15(4), pages 1-11, August.
    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. Rapine, Christophe & Goisque, Guillaume & Akbalik, Ayse, 2018. "Energy-aware lot sizing problem: Complexity analysis and exact algorithms," International Journal of Production Economics, Elsevier, vol. 203(C), pages 254-263.
    2. Hajo Terbrack & Thorsten Claus & Frank Herrmann, 2021. "Energy-Oriented Production Planning in Industry: A Systematic Literature Review and Classification Scheme," Sustainability, MDPI, vol. 13(23), pages 1-32, December.
    3. Waldemarsson, Martin & Lidestam, Helene & Rudberg, Martin, 2013. "Including energy in supply chain planning at a pulp company," Applied Energy, Elsevier, vol. 112(C), pages 1056-1065.
    4. Gahm, Christian & Denz, Florian & Dirr, Martin & Tuma, Axel, 2016. "Energy-efficient scheduling in manufacturing companies: A review and research framework," European Journal of Operational Research, Elsevier, vol. 248(3), pages 744-757.
    5. Rudberg, Martin & Waldemarsson, Martin & Lidestam, Helene, 2013. "Strategic perspectives on energy management: A case study in the process industry," Applied Energy, Elsevier, vol. 104(C), pages 487-496.
    6. Waldemarsson, Martin & Lidestam, Helene & Karlsson, Magnus, 2017. "How energy price changes can affect production- and supply chain planning – A case study at a pulp company," Applied Energy, Elsevier, vol. 203(C), pages 333-347.
    7. Rapine, Christophe & Penz, Bernard & Gicquel, Céline & Akbalik, Ayse, 2018. "Capacity acquisition for the single-item lot sizing problem under energy constraints," Omega, Elsevier, vol. 81(C), pages 112-122.
    8. S Eom & E Kim, 2006. "A survey of decision support system applications (1995–2001)," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(11), pages 1264-1278, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ozdamar, Linet & Birbil, Sevket Ilker, 1998. "Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions," European Journal of Operational Research, Elsevier, vol. 110(3), pages 525-547, November.
    2. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    3. Vicens, E. & Alemany, M. E. & Andres, C. & Guarch, J. J., 2001. "A design and application methodology for hierarchical production planning decision support systems in an enterprise integration context," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 5-20, December.
    4. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    5. Xue, Guisen & Felix Offodile, O. & Zhou, Hong & Troutt, Marvin D., 2011. "Integrated production planning with sequence-dependent family setup times," International Journal of Production Economics, Elsevier, vol. 131(2), pages 674-681, June.
    6. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
    7. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Fabrizio Marinelli & Maria Nenni & Antonio Sforza, 2007. "Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company," Annals of Operations Research, Springer, vol. 150(1), pages 177-192, March.
    9. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    10. Jing Wu & Dan Zhang & Yang Yang & Gongshu Wang & Lijie Su, 2022. "Multi-Stage Multi-Product Production and Inventory Planning for Cold Rolling under Random Yield," Mathematics, MDPI, vol. 10(4), pages 1-21, February.
    11. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    12. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    13. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    14. Chou, Jui-Sheng & Truong, Dinh-Nhat, 2021. "A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean," Applied Mathematics and Computation, Elsevier, vol. 389(C).
    15. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.
    16. Yalaoui, F. & Chu, C., 2006. "New exact method to solve the Pm/rj/[summation operator]Cj schedule problem," International Journal of Production Economics, Elsevier, vol. 100(1), pages 168-179, March.
    17. Thibaud Deguilhem & Juliette Schlegel & Jean-Philippe Berrou & Ousmane Djibo & Alain Piveteau, 2024. "Too many options: How to identify coalitions in a policy network?," Post-Print hal-04689665, HAL.
    18. Sainathuni, Bhanuteja & Parikh, Pratik J. & Zhang, Xinhui & Kong, Nan, 2014. "The warehouse-inventory-transportation problem for supply chains," European Journal of Operational Research, Elsevier, vol. 237(2), pages 690-700.
    19. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
    20. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.

    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:58:y:1999:i:2:p:115-129. 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.

    If CitEc recognized a bibliographic 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.

    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.