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

Reexamination of processing time uncertainty

Author

Listed:
  • Cao, Qidong
  • Patterson, J. Wayne
  • Bai, Xue

Abstract

No abstract is available for this item.

Suggested Citation

  • Cao, Qidong & Patterson, J. Wayne & Bai, Xue, 2005. "Reexamination of processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 164(1), pages 185-194, July.
    • Handle: RePEc:eee:ejores:v:164:y:2005:i:1:p:185-194
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00894-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. Nallan C. Suresh & Jack R. Meredith, 1994. "Coping with the Loss of Pooling Synergy in Cellular Manufacturing Systems," Management Science, INFORMS, vol. 40(4), pages 466-483, April.
    2. Lawrence M. Wein & Philippe B. Chevalier, 1992. "A Broader View of the Job-Shop Scheduling Problem," Management Science, INFORMS, vol. 38(7), pages 1018-1033, July.
    3. Richard L. Daniels & Panagiotis Kouvelis, 1995. "Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production," Management Science, INFORMS, vol. 41(2), pages 363-376, February.
    4. C. T. Baker & B. P. Dzielinski, 1960. "Simulation of a Simplified Job Shop," Management Science, INFORMS, vol. 6(3), pages 311-323, April.
    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. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    2. Şeker, Merve & Noyan, Nilay, 2012. "Stochastic optimization models for the airport gate assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 438-459.
    3. Olorunniwo, Festus & Udo, Godwin, 2002. "The impact of management and employees on cellular manufacturing implementation," International Journal of Production Economics, Elsevier, vol. 76(1), pages 27-38, March.
    4. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
    5. Miri Gilenson & Dvir Shabtay & Liron Yedidsion & Rohit Malshe, 2021. "Scheduling in multi-scenario environment with an agreeable condition on job processing times," Annals of Operations Research, Springer, vol. 307(1), pages 153-173, December.
    6. D'Angelo, Andrea & Gastaldi, Massimo & Levialdi, Nathan, 2000. "Production variability and shop configuration: An experimental analysis," International Journal of Production Economics, Elsevier, vol. 68(1), pages 43-57, October.
    7. Manning, William & Jensen, John, 2006. "Evaluating the shop-wide performance effect of pooling synergy with analytical models," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1009-1020, December.
    8. Gang Xuan & Win-Chin Lin & Shuenn-Ren Cheng & Wei-Lun Shen & Po-An Pan & Chih-Ling Kuo & Chin-Chia Wu, 2022. "A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
    9. repec:dgr:rugsom:95a45 is not listed on IDEAS
    10. Land, Martin & Gaalman, Gerard, 1996. "Workload control concepts in job shops A critical assessment," International Journal of Production Economics, Elsevier, vol. 46(1), pages 535-548, December.
    11. Cemal AKTÜRK & Sevinç GÜLSEÇEN, 2018. "Sipariş Teslim Tarihi Problemi İçin Çok Kriterli ve Çok Yöntemli Karar Destek Sistemi Önerisi," Istanbul Management Journal, Istanbul University Business School, vol. 29(84), pages 65-78, June.
    12. Mark L. Spearman & Rachel Q. Zhang, 1999. "Optimal Lead Time Policies," Management Science, INFORMS, vol. 45(2), pages 290-295, February.
    13. Igor Averbakh & Oded Berman, 2000. "Minmax Regret Median Location on a Network Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 104-110, May.
    14. Mausser, Helmut E. & Laguna, Manuel, 1999. "A heuristic to minimax absolute regret for linear programs with interval objective function coefficients," European Journal of Operational Research, Elsevier, vol. 117(1), pages 157-174, August.
    15. Silva, Marco & Poss, Michael & Maculan, Nelson, 2020. "Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 283(1), pages 70-82.
    16. Gaia Nicosia & Andrea Pacifici & Ulrich Pferschy & Julia Resch & Giovanni Righini, 2021. "Optimally rescheduling jobs with a Last-In-First-Out buffer," Journal of Scheduling, Springer, vol. 24(6), pages 663-680, December.
    17. van der Vaart, Taco & Wijngaard, Jacob, 2007. "The contribution of focus in collaborative planning for make-to-order production situation with large set-up times," International Journal of Production Economics, Elsevier, vol. 108(1-2), pages 436-443, July.
    18. Lin, Jun & Ng, Tsan Sheng, 2011. "Robust multi-market newsvendor models with interval demand data," European Journal of Operational Research, Elsevier, vol. 212(2), pages 361-373, July.
    19. Pei, Zhi & Lu, Haimin & Jin, Qingwei & Zhang, Lianmin, 2022. "Target-based distributionally robust optimization for single machine scheduling," European Journal of Operational Research, Elsevier, vol. 299(2), pages 420-431.
    20. Jian Yang & Gang Yu, 2002. "On the Robust Single Machine Scheduling Problem," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 17-33, March.
    21. Vairaktarakis, George L., 2000. "Robust multi-item newsboy models with a budget constraint," International Journal of Production Economics, Elsevier, vol. 66(3), pages 213-226, July.

    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:164:y:2005:i:1:p:185-194. 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.