IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v22y2019i6d10.1007_s10951-019-00600-2.html
   My bibliography  Save this article

Single machine scheduling with stochastically dependent times

Author

Listed:
  • Wei Wei

    (University of Wisconsin-Milwaukee)

Abstract

This paper examines the behavior of several single machine scheduling problems when presented with times that are random and potentially dependent. A position-based learning effect model is revisited and optimal schedules are derived under several typical performance measures. A sum-of-processing-time based model is proposed to incorporate the learning effects and deteriorations in one unified framework. Optimal schedules are derived to minimize the maximum lateness or jointly minimize the completion times under the proposed model, and the model is used to solve the optimal issuing problem.

Suggested Citation

  • Wei Wei, 2019. "Single machine scheduling with stochastically dependent times," Journal of Scheduling, Springer, vol. 22(6), pages 677-689, December.
    • Handle: RePEc:spr:jsched:v:22:y:2019:i:6:d:10.1007_s10951-019-00600-2
    DOI: 10.1007/s10951-019-00600-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-019-00600-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-019-00600-2?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. Landsberger, Michael & Meilijson, Isaac, 1990. "Demand for risky financial assets: A portfolio analysis," Journal of Economic Theory, Elsevier, vol. 50(1), pages 204-213, February.
    2. Cheng, T. C. E. & Ding, Q. & Lin, B. M. T., 2004. "A concise survey of scheduling with time-dependent processing times," European Journal of Operational Research, Elsevier, vol. 152(1), pages 1-13, January.
    3. Mark Brown & Sheldon M. Ross, 1973. "Optimal Issuing Policies," Management Science, INFORMS, vol. 19(11), pages 1292-1294, July.
    4. Belzunce, Félix & Martínez-Puertas, Helena & Ruiz, José M., 2013. "On allocation of redundant components for systems with dependent components," European Journal of Operational Research, Elsevier, vol. 230(3), pages 573-580.
    5. Wei, Wei, 2017. "Joint stochastic orders of high degrees and their applications in portfolio selections," Insurance: Mathematics and Economics, Elsevier, vol. 76(C), pages 141-148.
    6. Cai, Jun & Wei, Wei, 2015. "Notions of multivariate dependence and their applications in optimal portfolio selections with dependent risks," Journal of Multivariate Analysis, Elsevier, vol. 138(C), pages 156-169.
    7. Masaaki Kijima & Masamitsu Ohnishi, 1996. "Portfolio Selection Problems Via The Bivariate Characterization Of Stochastic Dominance Relations1," Mathematical Finance, Wiley Blackwell, vol. 6(3), pages 237-277, July.
    8. D-L Yang & W-H Kuo, 2007. "Single-machine scheduling with an actual time-dependent learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(10), pages 1348-1353, October.
    9. Biskup, Dirk, 2008. "A state-of-the-art review on scheduling with learning effects," European Journal of Operational Research, Elsevier, vol. 188(2), pages 315-329, July.
    10. Kuo, Wen-Hung & Yang, Dar-Li, 2006. "Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1184-1190, October.
    11. Cheng-Shang Chang & David D. Yao, 1993. "Rearrangement, Majorization and Stochastic Scheduling," Mathematics of Operations Research, INFORMS, vol. 18(3), pages 658-684, August.
    12. Cai, Jun & Wei, Wei, 2014. "Some new notions of dependence with applications in optimal allocation problems," Insurance: Mathematics and Economics, Elsevier, vol. 55(C), pages 200-209.
    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. Wei Wei, 2018. "Properties of Stochastic Arrangement Increasing and Their Applications in Allocation Problems," Risks, MDPI, vol. 6(2), pages 1-12, April.
    2. Li, Chen & Li, Xiaohu, 2020. "Preservation of weak SAI’s under increasing transformations with applications," Statistics & Probability Letters, Elsevier, vol. 164(C).
    3. Zhongyi Jiang & Fangfang Chen & Xiandong Zhang, 2022. "Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 116-139, January.
    4. Wen-Hung Kuo, 2012. "Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect," Annals of Operations Research, Springer, vol. 196(1), pages 349-359, July.
    5. Li, Chen & Li, Xiaohu, 2019. "Preservation of WSAI under default transforms and its application in allocating assets with dependent realizable returns," Insurance: Mathematics and Economics, Elsevier, vol. 86(C), pages 84-91.
    6. Kai-biao Sun & Hong-xing Li, 2009. "Some single-machine scheduling problems with actual time and position dependent learning effects," Fuzzy Information and Engineering, Springer, vol. 1(2), pages 161-177, June.
    7. Jiang, Zhongyi & Chen, Fangfang & Kang, Huiyan, 2013. "Single-machine scheduling problems with actual time-dependent and job-dependent learning effect," European Journal of Operational Research, Elsevier, vol. 227(1), pages 76-80.
    8. Zhongyi Jiang & Fangfang Chen & Xiandong Zhang, 2017. "Single-machine scheduling with times-based and job-dependent learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 809-815, July.
    9. Qi Feng & J. George Shanthikumar, 2018. "Arrangement Increasing Resource Allocation," Methodology and Computing in Applied Probability, Springer, vol. 20(3), pages 935-955, September.
    10. Dar-Li Yang & Wen-Hung Kuo, 2009. "Single-machine scheduling with both deterioration and learning effects," Annals of Operations Research, Springer, vol. 172(1), pages 315-327, November.
    11. Li, Xiaohu & Li, Chen, 2016. "On allocations to portfolios of assets with statistically dependent potential risk returns," Insurance: Mathematics and Economics, Elsevier, vol. 68(C), pages 178-186.
    12. Wei, Wei, 2017. "Joint stochastic orders of high degrees and their applications in portfolio selections," Insurance: Mathematics and Economics, Elsevier, vol. 76(C), pages 141-148.
    13. Wen-Hung Wu & Yunqiang Yin & T C E Cheng & Win-Chin Lin & Juei-Chao Chen & Shin-Yi Luo & Chin-Chia Wu, 2017. "A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 111-120, February.
    14. W-H Kuo & D-L Yang, 2011. "A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 206-210, January.
    15. You, Yinping & Li, Xiaohu, 2015. "Functional characterizations of bivariate weak SAI with an application," Insurance: Mathematics and Economics, Elsevier, vol. 64(C), pages 225-231.
    16. Yinping You & Xiaohu Li & Rui Fang, 2021. "On coverage limits and deductibles for SAI loss severities," Annals of Operations Research, Springer, vol. 297(1), pages 341-357, February.
    17. J-B Wang, 2010. "Single-machine scheduling with a sum-of-actual-processing-time-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 172-177, January.
    18. Heuser, Patricia & Tauer, Björn, 2023. "Single-machine scheduling with product category-based learning and forgetting effects," Omega, Elsevier, vol. 115(C).
    19. Cai, Jun & Wei, Wei, 2015. "Notions of multivariate dependence and their applications in optimal portfolio selections with dependent risks," Journal of Multivariate Analysis, Elsevier, vol. 138(C), pages 156-169.
    20. Lodree Jr., Emmett J. & Geiger, Christopher D., 2010. "A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration," European Journal of Operational Research, Elsevier, vol. 201(2), pages 644-648, March.

    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:jsched:v:22:y:2019:i:6:d:10.1007_s10951-019-00600-2. 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.