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

Johnson's problem with stochastic processing times and optimal service level

Author

Listed:
  • Portougal, Victor
  • Trietsch, Dan

Abstract

No abstract is available for this item.

Suggested Citation

  • Portougal, Victor & Trietsch, Dan, 2006. "Johnson's problem with stochastic processing times and optimal service level," European Journal of Operational Research, Elsevier, vol. 169(3), pages 751-760, March.
    • Handle: RePEc:eee:ejores:v:169:y:2006:i:3:p:751-760
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00141-4
    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. Allahverdi, Ali & Mittenthal, John, 1995. "Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function," European Journal of Operational Research, Elsevier, vol. 81(2), pages 376-387, March.
    2. Charles E. Clark, 1961. "The Greatest of a Finite Set of Random Variables," Operations Research, INFORMS, vol. 9(2), pages 145-162, April.
    3. Kamburowski, Jerzy, 1999. "Stochastically minimizing the makespan in two-machine flow shops without blocking," European Journal of Operational Research, Elsevier, vol. 112(2), pages 304-309, January.
    4. Michael Pinedo, 1982. "Minimizing the Expected Makespan in Stochastic Flow Shops," Operations Research, INFORMS, vol. 30(1), pages 148-162, February.
    5. Soroush, H. M., 1999. "Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 113(2), pages 450-468, March.
    6. V Portougal & D Trietsch, 2001. "Stochastic scheduling with optimal customer service," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(2), pages 226-233, February.
    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. Framinan, Jose M. & Perez-Gonzalez, Paz, 2015. "On heuristic solutions for the stochastic flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 246(2), pages 413-420.
    2. Faicel Hnaien & Taha Arbaoui, 2023. "Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown," Annals of Operations Research, Springer, vol. 328(2), pages 1437-1460, September.
    3. Yuri N. Sotskov & Natalja M. Matsveichuk & Vadzim D. Hatsura, 2020. "Schedule Execution for Two-Machine Job-Shop to Minimize Makespan with Uncertain Processing Times," Mathematics, MDPI, vol. 8(8), pages 1-51, August.
    4. Baker, Kenneth R. & Altheimer, Dominik, 2012. "Heuristic solution methods for the stochastic flow shop problem," European Journal of Operational Research, Elsevier, vol. 216(1), pages 172-177.

    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. J Jackman & Z Guerra de Castillo & S Olafsson, 2011. "Stochastic flow shop scheduling model for the Panama Canal," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 69-80, January.
    2. P J Kalczynski & J Kamburowski, 2004. "Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1358-1362, December.
    3. Gourgand, Michel & Grangeon, Nathalie & Norre, Sylvie, 2003. "A contribution to the stochastic flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 415-433, December.
    4. Gourgand, Michel & Grangeon, Nathalie & Norre, Sylvie, 2005. "Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity," European Journal of Operational Research, Elsevier, vol. 161(1), pages 126-147, February.
    5. Kamburowski, Jerzy, 2000. "On three-machine flow shops with random job processing times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 440-448, September.
    6. Bolduc, Denis & Kaci, Mustapha, 1993. "Estimation des modèles probit polytomiques : un survol des techniques," L'Actualité Economique, Société Canadienne de Science Economique, vol. 69(3), pages 161-191, septembre.
    7. David Bergman & Carlos Cardonha & Jason Imbrogno & Leonardo Lozano, 2023. "Optimizing the Expected Maximum of Two Linear Functions Defined on a Multivariate Gaussian Distribution," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 304-317, March.
    8. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 1997. "Using "look ahead" techniques in job-shop scheduling with random operations," International Journal of Production Economics, Elsevier, vol. 50(1), pages 13-22, May.
    9. Lof, Matthijs & van Bommel, Jos, 2023. "Asymmetric information and the distribution of trading volume," Journal of Corporate Finance, Elsevier, vol. 82(C).
    10. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    11. Faicel Hnaien & Taha Arbaoui, 2023. "Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown," Annals of Operations Research, Springer, vol. 328(2), pages 1437-1460, September.
    12. Elmaghraby, Salah E., 2000. "On criticality and sensitivity in activity networks," European Journal of Operational Research, Elsevier, vol. 127(2), pages 220-238, December.
    13. Elmaghraby, S. E. & Fathi, Y. & Taner, M. R., 1999. "On the sensitivity of project variability to activity mean duration," International Journal of Production Economics, Elsevier, vol. 62(3), pages 219-232, September.
    14. Hajivassiliou, Vassilis A. & Ruud, Paul A., 1986. "Classical estimation methods for LDV models using simulation," Handbook of Econometrics, in: R. F. Engle & D. McFadden (ed.), Handbook of Econometrics, edition 1, volume 4, chapter 40, pages 2383-2441, Elsevier.
    15. Martinetti, Davide & Geniaux, Ghislain, 2017. "Approximate likelihood estimation of spatial probit models," Regional Science and Urban Economics, Elsevier, vol. 64(C), pages 30-45.
    16. Bhat, Chandra R., 2018. "New matrix-based methods for the analytic evaluation of the multivariate cumulative normal distribution function," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 238-256.
    17. Baker, Kenneth R. & Trietsch, Dan, 2009. "Safe scheduling: Setting due dates in single-machine problems," European Journal of Operational Research, Elsevier, vol. 196(1), pages 69-77, July.
    18. D'Amato, Rebecca M. (Rebecca Marie) & D'Aquila, Richard T. & Wein, Lawrence M., 1998. "Management of antiretroviral therapy for HIV infection : analyzing when to change therapy," Working papers WP 4043-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    19. Ali Salmasnia & Mostafa Khatami & Reza Kazemzadeh & Seyed Zegordi, 2015. "Bi-objective single machine scheduling problem with stochastic processing times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 275-297, April.
    20. Federica Bomboi & Christoph Buchheim & Jonas Pruente, 2022. "On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency," 4OR, Springer, vol. 20(2), pages 217-239, June.

    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:169:y:2006:i:3:p:751-760. 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.