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

Enriched workflow modelling and Stochastic Branch-and-Bound

Author

Listed:
  • Doerner, Karl
  • Gutjahr, Walter J.
  • Kotsis, Gabriele
  • Polaschek, Martin
  • Strauss, Christine

Abstract

No abstract is available for this item.

Suggested Citation

  • Doerner, Karl & Gutjahr, Walter J. & Kotsis, Gabriele & Polaschek, Martin & Strauss, Christine, 2006. "Enriched workflow modelling and Stochastic Branch-and-Bound," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1798-1817, December.
    • Handle: RePEc:eee:ejores:v:175:y:2006:i:3:p:1798-1817
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00477-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. Gutjahr, W. J. & Hellmayr, A. & Pflug, G. Ch., 1999. "Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound," European Journal of Operational Research, Elsevier, vol. 117(2), pages 396-413, September.
    2. Yau, Chuk & Ritchie, Eric, 1990. "Project compression: A method for speeding up resource constrained projects which preserve the activity schedule," European Journal of Operational Research, Elsevier, vol. 49(1), pages 140-152, November.
    3. Thomas J. Hindelang & John F. Muth, 1979. "A Dynamic Programming Algorithm for Decision CPM Networks," Operations Research, INFORMS, vol. 27(2), pages 225-241, April.
    4. J Dehnert & J Freiheit & A Zimmermann, 2002. "Modelling and evaluation of time aspects in business processes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(9), pages 1038-1047, September.
    5. W. J. Gutjahr & C. Strauss & E. Wagner, 2000. "A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 125-135, May.
    Full references (including those not matched with items on IDEAS)

    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. Doerner, K.F. & Gutjahr, W.J. & Hartl, R.F. & Strauss, C. & Stummer, C., 2008. "Nature-inspired metaheuristics for multiobjective activity crashing," Omega, Elsevier, vol. 36(6), pages 1019-1037, December.
    2. W. J. Gutjahr & C. Strauss & E. Wagner, 2000. "A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 125-135, May.
    3. Siqian Shen & J. Cole Smith & Shabbir Ahmed, 2010. "Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths," Management Science, INFORMS, vol. 56(10), pages 1794-1814, October.
    4. Zafra-Cabeza, Ascensión & Ridao, Miguel A. & Camacho, Eduardo F., 2008. "Using a risk-based approach to project scheduling: A case illustration from semiconductor manufacturing," European Journal of Operational Research, Elsevier, vol. 190(3), pages 708-723, November.
    5. Karl F. Doerner & Vittorio Maniezzo, 2018. "Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 331-356, June.
    6. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
    7. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    8. Chen, Shih-Pin & Tsai, Ming-Jiun, 2011. "Time-cost trade-off analysis of project networks in fuzzy environments," European Journal of Operational Research, Elsevier, vol. 212(2), pages 386-397, July.
    9. Li, Haitao & Womer, Norman K., 2015. "Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 246(1), pages 20-33.
    10. Eleni Hadjiconstantinou & Evelina Klerides, 2010. "A new path-based cutting plane approach for the discrete time-cost tradeoff problem," Computational Management Science, Springer, vol. 7(3), pages 313-336, July.
    11. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    12. Zahid, Taiba & Kühn, Mathias & Völker, Michael & Schmidt, Thorsten, 2015. "Investigation of Scheduling Techniques for Uncertain Conditions," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Blecker, Thorsten & Kersten, Wolfgang & Ringle, Christian M. (ed.), Operational Excellence in Logistics and Supply Chains: Optimization Methods, Data-driven Approaches and Security Insights. Proceedings of the Hamburg , volume 22, pages 171-202, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    13. Gutjahr, Walter J., 2015. "Bi-Objective Multi-Mode Project Scheduling Under Risk Aversion," European Journal of Operational Research, Elsevier, vol. 246(2), pages 421-434.
    14. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    15. Manuel A. Nunez & Lynn Kuo & I. Robert Chiang, 2022. "Managing risk-adjusted resource allocation for project time-cost tradeoffs," Annals of Operations Research, Springer, vol. 317(2), pages 717-735, October.
    16. André Schnabel & Carolin Kellenbrink & Stefan Helber, 2018. "Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints," Business Research, Springer;German Academic Association for Business Research, vol. 11(2), pages 329-356, September.
    17. Marcin Anholcer & Helena Gaspars-Wieloch, 2011. "Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 5-18.
    18. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    19. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    20. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, 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:ejores:v:175:y:2006:i:3:p:1798-1817. 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.