IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v387y2020ics0096300319305260.html
   My bibliography  Save this article

Tri-criteria single machine scheduling model with release times and learning factor

Author

Listed:
  • Qian, Jin
  • Lin, Hexiang
  • Kong, Yufeng
  • Wang, Yuansong

Abstract

In this paper, we consider the single machine scheduling problem with release times and a learning effect. The actual processing time of a job is a function that is the total processing time of the jobs already processed. The objective is to minimize the weighted sum of makespan, total completion time and maximum tardiness. This problem is NP-hard, some heuristic algorithms and branch-and-bound algorithm based on the Depth-first Search algorithm are proposed to solve the problem. Computational experiments are conducted to evaluate the performance of the heuristic and branch-and-bound algorithms.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:apmaco:v:387:y:2020:i:c:s0096300319305260
    DOI: 10.1016/j.amc.2019.06.057
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300319305260
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2019.06.057?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. 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.
    2. Ji-Bo Wang & Jian Xu & Jing Yang, 2018. "Bicriterion Optimization for Flow Shop with a Learning Effect Subject to Release Dates," Complexity, Hindawi, vol. 2018, pages 1-12, October.
    3. 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.
    4. J-B Wang & Z-Q Xia, 2005. "Flow-shop scheduling with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(11), pages 1325-1330, November.
    5. Ji-Bo Wang & Ming-Zheng Wang & Ping Ji, 2012. "Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs," International Journal of Systems Science, Taylor & Francis Journals, vol. 43(5), pages 861-868.
    6. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    7. Yuan-Yuan Lu & Fei Teng & Zhi-Xin Feng, 2015. "Scheduling Jobs with Truncated Exponential Sum-of-Logarithm-Processing-Times Based and Position-based Learning Effects," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(04), pages 1-17.
    8. Mosheiov, Gur, 2001. "Scheduling problems with a learning effect," European Journal of Operational Research, Elsevier, vol. 132(3), pages 687-693, August.
    9. 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.
    10. 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.
    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. Zheng-Guo Lv & Li-Han Zhang & Xiao-Yuan Wang & Ji-Bo Wang, 2024. "Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization," Mathematics, MDPI, vol. 12(4), pages 1-15, February.
    2. Jin Qian & Yu Zhan, 2021. "The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect," Mathematics, MDPI, vol. 9(23), pages 1-14, November.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Xu, Zhiyong & Sun, Linyan & Gong, Juntao, 2008. "Worst-case analysis for flow shop scheduling with a learning effect," International Journal of Production Economics, Elsevier, vol. 113(2), pages 748-753, June.
    9. Heuser, Patricia & Tauer, Björn, 2023. "Single-machine scheduling with product category-based learning and forgetting effects," Omega, Elsevier, vol. 115(C).
    10. 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.
    11. Lee, Wen-Chiung & Wu, Chin-Chia & Hsu, Peng-Hsiang, 2010. "A single-machine learning effect scheduling problem with release times," Omega, Elsevier, vol. 38(1-2), pages 3-11, February.
    12. Bai, Danyu & Tang, Mengqian & Zhang, Zhi-Hai & Santibanez-Gonzalez, Ernesto DR, 2018. "Flow shop learning effect scheduling problem with release dates," Omega, Elsevier, vol. 78(C), pages 21-38.
    13. Finke, Gerd & Gara-Ali, Ahmed & Espinouse, Marie-Laure & Jost, Vincent & Moncel, Julien, 2017. "Unified matrix approach to solve production-maintenance problems on a single machine," Omega, Elsevier, vol. 66(PA), pages 140-146.
    14. 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.
    15. 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.
    16. Shang-Chia Liu, 2015. "Common Due-Window Assignment and Group Scheduling with Position-Dependent Processing Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-19, December.
    17. 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.
    18. Yang, Wen-Hua & Chand, Suresh, 2008. "Learning and forgetting effects on a group scheduling problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1033-1044, June.
    19. Janiak, Adam & Rudek, RadosLaw, 2010. "A note on a makespan minimization problem with a multi-ability learning effect," Omega, Elsevier, vol. 38(3-4), pages 213-217, June.
    20. 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.

    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:apmaco:v:387:y:2020:i:c:s0096300319305260. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.