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

Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound

Author

Listed:
  • Gutjahr, W. J.
  • Hellmayr, A.
  • Pflug, G. Ch.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:117:y:1999:i:2:p:396-413
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00279-3
    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. Panwalkar, S. S. & Smith, M. L. & Koulamas, C. P., 1993. "A heuristic for the single machine tardiness problem," European Journal of Operational Research, Elsevier, vol. 70(3), pages 304-310, November.
    2. Vladimir I. Norkin & Yuri M. Ermoliev & Andrzej Ruszczyński, 1998. "On Optimal Allocation of Indivisibles Under Uncertainty," Operations Research, INFORMS, vol. 46(3), pages 381-395, June.
    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. Alcaide, David & Rodriguez-Gonzalez, Andrés & Sicilia, Joaquín, 2003. "An approach to solve a hierarchical stochastic sequential ordering problem," Omega, Elsevier, vol. 31(3), pages 169-187, June.
    2. 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.
    3. Semih Atakan & Kerem Bülbül & Nilay Noyan, 2017. "Minimizing value-at-risk in single-machine scheduling," Annals of Operations Research, Springer, vol. 248(1), pages 25-73, January.
    4. Krishna Chepuri & Tito Homem-de-Mello, 2005. "Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method," Annals of Operations Research, Springer, vol. 134(1), pages 153-181, February.
    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.
    6. 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.

    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. Alidaee, Bahram & Kochenberger, Gary A. & Amini, Mohammad M., 2001. "Greedy solutions of selection and ordering problems," European Journal of Operational Research, Elsevier, vol. 134(1), pages 203-215, October.
    2. Quddus, Md Abdul & Shahvari, Omid & Marufuzzaman, Mohammad & Ekşioğlu, Sandra D. & Castillo-Villar, Krystel K., 2021. "Designing a reliable electric vehicle charging station expansion under uncertainty," International Journal of Production Economics, Elsevier, vol. 236(C).
    3. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.
    4. Koulamas, Christos, 1996. "Single-machine scheduling with time windows and earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 91(1), pages 190-202, May.
    5. Gyana R. Parija & Shabbir Ahmed & Alan J. King, 2004. "On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 73-83, February.
    6. Adenso-Diaz, Belarmino, 1996. "An SA/TS mixture algorithm for the scheduling tardiness problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 516-524, February.
    7. Walter Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    8. Sigrún Andradóttir & Andrei A. Prudius, 2009. "Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 193-208, May.
    9. Christos Koulamas, 1997. "Decomposition and hybrid simulated annealing heuristics for the parallel‐machine total tardiness problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 109-125, February.
    10. Walter J. Gutjahr & Alois Pichler, 2016. "Stochastic multi-objective optimization: a survey on non-scalarizing methods," Annals of Operations Research, Springer, vol. 236(2), pages 475-499, January.
    11. B.J. Lence & A. Ruszczynski, 1996. "Managing Water Quality under Uncertainty: Application of a New Stochastic Branch and Bound Method," Working Papers wp96066, International Institute for Applied Systems Analysis.
    12. Bilge, Umit & Kurtulan, Mujde & Kirac, Furkan, 2007. "A tabu search algorithm for the single machine total weighted tardiness problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1423-1435, February.
    13. Quddus, Md Abdul & Shahvari, Omid & Marufuzzaman, Mohammad & Usher, John M. & Jaradat, Raed, 2018. "A collaborative energy sharing optimization model among electric vehicle charging stations, commercial buildings, and power grid," Applied Energy, Elsevier, vol. 229(C), pages 841-857.
    14. Alidaee, Bahram & Gopalan, Suresh, 1997. "A note on the equivalence of two heuristics to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 96(3), pages 514-517, February.
    15. Eun, Joonyup & Kim, Sang-Phil & Yih, Yuehwern & Tiwari, Vikram, 2019. "Scheduling elective surgery patients considering time-dependent health urgency: Modeling and solution approaches," Omega, Elsevier, vol. 86(C), pages 137-153.
    16. Sigurdur Ólafsson, 2004. "Two-Stage Nested Partitions Method for Stochastic Optimization," Methodology and Computing in Applied Probability, Springer, vol. 6(1), pages 5-27, March.
    17. El-Bouri, Ahmed & Balakrishnan, Subramaniam & Popplewell, Neil, 2000. "Sequencing jobs on a single machine: A neural network approach," European Journal of Operational Research, Elsevier, vol. 126(3), pages 474-490, November.
    18. Alrefaei, Mahmoud H. & Alawneh, Ameen J., 2004. "Selecting the best stochastic system for large scale problems in DEDS," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 64(2), pages 237-245.
    19. Söhnke Maecker & Liji Shen, 2020. "Solving parallel machine problems with delivery times and tardiness objectives," Annals of Operations Research, Springer, vol. 285(1), pages 315-334, February.
    20. Russell, Randolph M. & Holsenback, J. Edward, 1997. "Evaluation of leading heuristics for the single machine tardiness problem," European Journal of Operational Research, Elsevier, vol. 96(3), pages 538-545, 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:ejores:v:117:y:1999:i:2:p:396-413. 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.