IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v140y2005i1p163-18810.1007-s10479-005-3970-8.html
   My bibliography  Save this article

On a Fix-and-Relax Framework for a Class of Project Scheduling Problems

Author

Listed:
  • Laureano Escudero
  • Javier Salmeron

Abstract

We consider the following problem: Given a set of projects to be executed along a multi-year time horizon, find a sequencing and scheduling feasible solution that optimizes a merit function. A feasible solution should satisfy availability of storable and non-storable resources with budget carrier and non-carrier periods, and precedence, exclusivity and implication relationships among the projects. This is an NP-hard problem. We present several Fix-and-Relax strategies which partition the set of binary variable into clusters in order to selectively explore the branch-and-bound tree. Computational performance is favorably compared with a state-of-the-art optimization engine over a set of real-life cases. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • Laureano Escudero & Javier Salmeron, 2005. "On a Fix-and-Relax Framework for a Class of Project Scheduling Problems," Annals of Operations Research, Springer, vol. 140(1), pages 163-188, November.
    • Handle: RePEc:spr:annopr:v:140:y:2005:i:1:p:163-188:10.1007/s10479-005-3970-8
    DOI: 10.1007/s10479-005-3970-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-005-3970-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-005-3970-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Escudero, L. F., 1982. "On maintenance scheduling of production units," European Journal of Operational Research, Elsevier, vol. 9(3), pages 264-274, March.
    2. J. T. Linderoth & M. W. P. Savelsbergh, 1999. "A Computational Study of Search Strategies for Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 173-187, May.
    3. WOLSEY, Laurence A., 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," LIDAM Reprints CORE 1605, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. WATERER, Hamish & JOHNSON, Ellis & NOBILI, Paolo & SAVELSBERGH, Martin, 2002. "The relation of time indexed formulations of single machine scheduling problems to the node packing problem," LIDAM Reprints CORE 1585, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Wolsey, L. A., 1997. "MIP modelling of changeovers in production planning and scheduling problems," LIDAM Reprints CORE 1271, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. WOLSEY, Laurence, 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," LIDAM Discussion Papers CORE 2002012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. J.M. van den Akker & C.A.J. Hurkens & M.W.P. Savelsbergh, 2000. "Time-Indexed Formulations for Machine Scheduling Problems: Column Generation," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 111-124, May.
    8. WATERER, Hamish & JOHNSON, Ellis & SAVELSBERGH, Martin, 2002. "The relation of time indexed formulations of single machine scheduling problems to the node packing problem," LIDAM Discussion Papers CORE 2002009, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Dillenberger, Christof & Escudero, Laureano F. & Wollensak, Artur & Zhang, Wu, 1994. "On practical resource allocation for production planning and scheduling with period overlapping setups," European Journal of Operational Research, Elsevier, vol. 75(2), pages 275-286, June.
    10. Wolsey, Laurence A., 1997. "MIP modelling of changeovers in production planning and scheduling problems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 154-165, May.
    11. SOUSA, Jorge P. & WOLSEY, Laurence A., 1992. "A time indexed formulation of non-preemptive single machine scheduling problems," LIDAM Reprints CORE 984, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Klein, Robert, 2000. "Scheduling of resource constrained projects," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 1592, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    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. Aloullal, Afaf & Saldanha-da-Gama, Francisco & Todosijević, Raca, 2023. "Multi-period single-allocation hub location-routing: Models and heuristic solutions," European Journal of Operational Research, Elsevier, vol. 310(1), pages 53-70.
    2. O’Sullivan, Dónal & Newman, Alexandra, 2015. "Optimization-based heuristics for underground mine scheduling," European Journal of Operational Research, Elsevier, vol. 241(1), pages 248-259.
    3. Wei, Wenchao & Guimarães, Luis & Amorim, Pedro & Almada-Lobo, Bernardo, 2017. "Tactical production and distribution planning with dependency issues on the production process," Omega, Elsevier, vol. 67(C), pages 99-114.
    4. Ferreira, Deisemara & Morabito, Reinaldo & Rangel, Socorro, 2009. "Solution approaches for the soft drink integrated production lot sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 196(2), pages 697-706, July.
    5. Asgeir Tomasgard, 2009. "Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(1), pages 30-32, July.
    6. Wei, Mingyuan & Qi, Mingyao & Wu, Tao & Zhang, Canrong, 2019. "Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials," European Journal of Operational Research, Elsevier, vol. 277(2), pages 521-541.
    7. Correa, Renata Naoko & Scarpin, Cassius Tadeu & Ferrari, Linamara Smaniotto & Arce, Julio Eduardo, 2020. "Application of relax-and-fix heuristic in the aggregation of stands for tactical forest scheduling," Forest Policy and Economics, Elsevier, vol. 119(C).
    8. Baptista, Susana & Barbosa-Póvoa, Ana Paula & Escudero, Laureano F. & Gomes, Maria Isabel & Pizarro, Celeste, 2019. "On risk management of a two-stage stochastic mixed 0–1 model for the closed-loop supply chain design problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 91-107.

    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. Francesco Gaglioppa & Lisa A. Miller & Saif Benjaafar, 2008. "Multitask and Multistage Production Planning and Scheduling for Process Industries," Operations Research, INFORMS, vol. 56(4), pages 1010-1025, August.
    2. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    3. Pasquale Avella & Maurizio Boccia & Bernardo D’Auria, 2005. "Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 183-191, May.
    4. Louis-Philippe Bigras & Michel Gamache & Gilles Savard, 2008. "Time-Indexed Formulations and the Total Weighted Tardiness Problem," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 133-142, February.
    5. Natashia Boland & Riley Clement & Hamish Waterer, 2016. "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 14-30, February.
    6. Pasquale Avella & Maurizio Boccia & Carlo Mannino & Igor Vasilyev, 2017. "Time-Indexed Formulations for the Runway Scheduling Problem," Transportation Science, INFORMS, vol. 51(4), pages 1196-1209, November.
    7. 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.
    8. Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    9. Vitoriano, B. & Ortuno, M. T. & Recio, B. & Rubio, F. & Alonso-Ayuso, A., 2003. "Two alternative models for farm management: Discrete versus continuous time horizon," European Journal of Operational Research, Elsevier, vol. 144(3), pages 613-628, February.
    10. Jans, R.F., 2006. "Solving Lotsizing Problems on Parallel Identical Machines Using Symmetry Breaking Constraints," ERIM Report Series Research in Management ERS-2006-051-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    11. Nurre, Sarah G. & Cavdaroglu, Burak & Mitchell, John E. & Sharkey, Thomas C. & Wallace, William A., 2012. "Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem," European Journal of Operational Research, Elsevier, vol. 223(3), pages 794-806.
    12. Beraldi, Patrizia & Ghiani, Gianpaolo & Guerriero, Emanuela & Grieco, Antonio, 2006. "Scenario-based planning for lot-sizing and scheduling with uncertain processing times," International Journal of Production Economics, Elsevier, vol. 101(1), pages 140-149, May.
    13. Raf Jans, 2009. "Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 123-136, February.
    14. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    15. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    16. Baptiste, Philippe & Sadykov, Ruslan, 2010. "Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars," European Journal of Operational Research, Elsevier, vol. 203(2), pages 476-483, June.
    17. Arbib, Claudio & Marinelli, Fabrizio, 2005. "Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application," European Journal of Operational Research, Elsevier, vol. 163(3), pages 617-630, June.
    18. Tiacci, Lorenzo & Saetta, Stefano, 2012. "Demand forecasting, lot sizing and scheduling on a rolling horizon basis," International Journal of Production Economics, Elsevier, vol. 140(2), pages 803-814.
    19. Nourelfath, Mustapha & Nahas, Nabil & Ben-Daya, Mohamed, 2016. "Integrated preventive maintenance and production decisions for imperfect processes," Reliability Engineering and System Safety, Elsevier, vol. 148(C), pages 21-31.
    20. Lukac, Zrinka & Soric, Kristina & Rosenzweig, Visnja Vojvodic, 2008. "Production planning problem with sequence dependent setups as a bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1504-1512, June.

    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:spr:annopr:v:140:y:2005:i:1:p:163-188:10.1007/s10479-005-3970-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.