IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v68y2017i7d10.1057_jors.2016.40.html
   My bibliography  Save this article

Single-machine scheduling with times-based and job-dependent learning effect

Author

Listed:
  • Zhongyi Jiang

    (Changzhou University
    School of Management, Fudan University)

  • Fangfang Chen

    (Changzhou University)

  • Xiandong Zhang

    (School of Management, Fudan University)

Abstract

Absract Learning effect is a phenomenon in industrial processes that a machine (plant, worker, etc) can improve its productivity continuously with time, that is the actual processing time of a job decreases after the machine (plant, worker, etc) processes other jobs and gains some experiences. We study single machine scheduling problems with sum-of-processing-time based and job-dependent learning effect. The objectives are to minimize the maximum lateness, the number of tardy jobs, and total weighted completion time. By performing reductions from equal cardinality partition problem, we prove that these problems under investigation are all NP-hard. Two special cases that can be solved in polynomial time are also presented.

Suggested Citation

  • 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.
    • Handle: RePEc:pal:jorsoc:v:68:y:2017:i:7:d:10.1057_jors.2016.40
    DOI: 10.1057/jors.2016.40
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2016.40
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2016.40?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. 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.
    2. Wang, J.-B. & Ng, C.T. & Cheng, T.C.E. & Liu, L.L., 2008. "Single-machine scheduling with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 111(2), pages 802-811, February.
    3. G Mosheiov & J B Sidney, 2005. "Note on scheduling with general learning curves to minimize the number of tardy jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(1), pages 110-112, January.
    4. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    5. Mosheiov, Gur & Sidney, Jeffrey B., 2003. "Scheduling with general job-dependent learning curves," European Journal of Operational Research, Elsevier, vol. 147(3), pages 665-670, June.
    6. 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.
    7. Paul S. Adler & Kim B. Clark, 1991. "Behind the Learning Curve: A Sketch of the Learning Process," Management Science, INFORMS, vol. 37(3), pages 267-281, March.
    8. T.C. Cheng & Guoqing Wang, 2000. "Single Machine Scheduling with Learning Effect Considerations," Annals of Operations Research, Springer, vol. 98(1), pages 273-290, December.
    9. R Rudek, 2014. "Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(8), pages 1170-1176, August.
    10. Koulamas, Christos & Kyparisis, George J., 2007. "Single-machine and two-machine flowshop scheduling with general learning functions," European Journal of Operational Research, Elsevier, vol. 178(2), pages 402-407, April.
    11. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    12. 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.
    13. 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.
    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. Baoyu Liao & Xingming Wang & Xing Zhu & Shanlin Yang & Panos M. Pardalos, 2020. "Less is more approach for competing groups scheduling with different learning effects," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 33-54, January.

    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. 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.
    2. 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.
    3. 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.
    4. Heuser, Patricia & Tauer, Björn, 2023. "Single-machine scheduling with product category-based learning and forgetting effects," Omega, Elsevier, vol. 115(C).
    5. Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Chen, Ke & Cheng, T.C.E. & Huang, Hailiang & Ji, Min & Yao, Danli, 2023. "Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 309(1), pages 24-34.
    11. Wang, J.-B. & Ng, C.T. & Cheng, T.C.E. & Liu, L.L., 2008. "Single-machine scheduling with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 111(2), pages 802-811, February.
    12. Xingong Zhang & Guangle Yan & Wanzhen Huang & Guochun Tang, 2011. "Single-machine scheduling problems with time and position dependent processing times," Annals of Operations Research, Springer, vol. 186(1), pages 345-356, June.
    13. Li, Gang & Wang, Xiao-Yuan & Wang, Ji-Bo & Sun, Lin-Yan, 2013. "Worst case analysis of flow shop scheduling problems with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 142(1), pages 98-104.
    14. Qian, Jin & Lin, Hexiang & Kong, Yufeng & Wang, Yuansong, 2020. "Tri-criteria single machine scheduling model with release times and learning factor," Applied Mathematics and Computation, Elsevier, vol. 387(C).
    15. 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.
    16. Chang, Pei-Chann & Chen, Shih-Hsin & Mani, V., 2009. "A note on due-date assignment and single machine scheduling with a learning/aging effect," International Journal of Production Economics, Elsevier, vol. 117(1), pages 142-149, January.
    17. Radosław Rudek, 2012. "Scheduling problems with position dependent job processing times: computational complexity results," Annals of Operations Research, Springer, vol. 196(1), pages 491-516, July.
    18. Lai, Peng-Jen & Lee, Wen-Chiung, 2011. "Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects," Omega, Elsevier, vol. 39(5), pages 467-471, October.
    19. Jun Pei & Bayi Cheng & Xinbao Liu & Panos M. Pardalos & Min Kong, 2019. "Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time," Annals of Operations Research, Springer, vol. 272(1), pages 217-241, January.
    20. Jun Pei & Xinbao Liu & Panos M. Pardalos & Athanasios Migdalas & Shanlin Yang, 2017. "Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine," Journal of Global Optimization, Springer, vol. 67(1), pages 251-262, January.

    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:pal:jorsoc:v:68:y:2017:i:7:d:10.1057_jors.2016.40. 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.palgrave-journals.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.