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

Continuous filling and emptying of storage systems in constraint-based scheduling

Author

Listed:
  • Sourd, Francis
  • Rogerie, Jerome

Abstract

No abstract is available for this item.

Suggested Citation

  • Sourd, Francis & Rogerie, Jerome, 2005. "Continuous filling and emptying of storage systems in constraint-based scheduling," European Journal of Operational Research, Elsevier, vol. 165(2), pages 510-524, September.
    • Handle: RePEc:eee:ejores:v:165:y:2005:i:2:p:510-524
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00257-7
    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. Poder, Emmanuel & Beldiceanu, Nicolas & Sanlaville, Eric, 2004. "Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption," European Journal of Operational Research, Elsevier, vol. 153(1), pages 239-254, February.
    2. R. Rodosek & M.G. Wallace & M.T. Hajian, 1999. "A new approach to integrating mixed integer programming and constraint logicprogramming," Annals of Operations Research, Springer, vol. 86(0), pages 63-87, January.
    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. Steffen, Bjarne & Weber, Christoph, 2016. "Optimal operation of pumped-hydro storage plants with continuous time-varying power prices," European Journal of Operational Research, Elsevier, vol. 252(1), pages 308-321.
    2. Briskorn, Dirk & Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph & Pinedo, Michael, 2010. "Complexity of single machine scheduling subject to nonnegative inventory constraints," European Journal of Operational Research, Elsevier, vol. 207(2), pages 605-619, December.
    3. Sandra Ulrich Ngueveu & Christian Artigues & Nabil Absi & Safia Kedad-Sidhoum, 2022. "Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs," Journal of Heuristics, Springer, vol. 28(1), pages 93-120, February.
    4. Gehring, Marco & Volk, Rebekka & Schultmann, Frank, 2022. "On the integration of diverging material flows into resource‐constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1071-1087.

    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. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    2. Russell, Robert A. & Urban, Timothy L., 2010. "Multicriteria models for planning power-networking events," European Journal of Operational Research, Elsevier, vol. 207(1), pages 83-91, November.
    3. Tallys Yunes & Ionuţ D. Aron & J. N. Hooker, 2010. "An Integrated Solver for Optimization Problems," Operations Research, INFORMS, vol. 58(2), pages 342-356, April.
    4. Yannis Pavlis & Will Recker, 2009. "A Mathematical Logic Approach for the Transformation of the Linear Conditional Piecewise Functions of Dispersion-and-Store and Cell Transmission Traffic Flow Models into Linear Mixed-Integer Form," Transportation Science, INFORMS, vol. 43(1), pages 98-116, February.
    5. Gedik, Ridvan & Rainwater, Chase & Nachtmann, Heather & Pohl, Ed A., 2016. "Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals," European Journal of Operational Research, Elsevier, vol. 251(2), pages 640-650.
    6. Artigues, Christian & Lopez, Pierre & Haït, Alain, 2013. "The energy scheduling problem: Industrial case-study and constraint propagation techniques," International Journal of Production Economics, Elsevier, vol. 143(1), pages 13-23.
    7. Michela Milano & Greger Ottosson & Philippe Refalo & Erlendur S. Thorsteinsson, 2002. "The Role of Integer Programming Techniques in Constraint Programming's Global Constraints," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 387-402, November.
    8. G Zhu & J F Bard & G Yu, 2005. "Disruption management for resource-constrained project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 365-381, April.

    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:165:y:2005:i:2:p:510-524. 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/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.