IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i7p1029-d1366964.html
   My bibliography  Save this article

Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously

Author

Listed:
  • Ming-Hui Li

    (School of Science, Shenyang Aerospace University, Shenyang 110136, China)

  • Dan-Yang Lv

    (School of Science, Shenyang Aerospace University, Shenyang 110136, China)

  • Yuan-Yuan Lu

    (College of Mathematics and Computer, Jilin Normal University, Siping 136000, China)

  • Ji-Bo Wang

    (School of Science, Shenyang Aerospace University, Shenyang 110136, China)

Abstract

This paper studies the single-machine group scheduling problem with convex resource allocation and learning effect. The number of jobs in each group is different, and the corresponding common due dates are also different, where the processing time of jobs follows a convex function of resource allocation. Under common due date assignment, the objective is to minimize the weighted sum of earliness, tardiness, common due date, resource consumption, and makespan. To solve the problem, we present the heuristic, simulated annealing, and branch-and-bound algorithms. Computational experiments indicate that the proposed algorithms are effective.

Suggested Citation

  • Ming-Hui Li & Dan-Yang Lv & Yuan-Yuan Lu & Ji-Bo Wang, 2024. "Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:1029-:d:1366964
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/7/1029/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/7/1029/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wang, Xiuli & Cheng, T. C. E., 2005. "Single machine scheduling with resource dependent release times and processing times," European Journal of Operational Research, Elsevier, vol. 162(3), pages 727-739, May.
    2. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    3. Ying Chen & Xiaole Ma & Guiqing Zhang & Yongxi Cheng, 2023. "On optimal due date assignment without restriction and resource allocation in group technology scheduling," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-19, March.
    4. Ameni Azzouz & Meriem Ennigrou & Lamjed Ben Said, 2018. "Scheduling problems under learning effects: classification and cartography," International Journal of Production Research, Taylor & Francis Journals, vol. 56(4), pages 1642-1661, February.
    5. Yi-Chun Wang & Ji-Bo Wang, 2023. "Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect," Mathematics, MDPI, vol. 11(14), pages 1-20, July.
    6. Xinyu Sun & Tao Liu & Xin-Na Geng & Yang Hu & Jing-Xiao Xu, 2023. "Optimization of scheduling problems with deterioration effects and an optional maintenance activity," Journal of Scheduling, Springer, vol. 26(3), pages 251-266, June.
    7. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 131(2), pages 747-751, June.
    8. Shabtay, Dvir, 2016. "Optimal restricted due date assignment in scheduling," European Journal of Operational Research, Elsevier, vol. 252(1), pages 79-89.
    9. D Oron, 2014. "Scheduling controllable processing time jobs in a deteriorating environment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(1), pages 49-56, January.
    10. C-C Wu & Y Yin & S-R Cheng, 2013. "Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(1), pages 147-156, January.
    11. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    12. Shabtay, Dvir & Mosheiov, Gur & Oron, Daniel, 2022. "Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work," European Journal of Operational Research, Elsevier, vol. 303(1), pages 66-77.
    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. Ying Chen & Xiaole Ma & Guiqing Zhang & Yongxi Cheng, 2023. "On optimal due date assignment without restriction and resource allocation in group technology scheduling," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-19, March.
    2. Zheng Liu & Ji-Bo Wang, 2024. "Single-Machine Scheduling with Simultaneous Learning Effects and Delivery Times," Mathematics, MDPI, vol. 12(16), pages 1-20, August.
    3. Su, Ling-Huey & Tien, Yi-Yu, 2011. "Minimizing mean absolute deviation of completion time about a common due window subject to maximum tardiness for a single machine," International Journal of Production Economics, Elsevier, vol. 134(1), pages 196-203, November.
    4. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Yuan-Yuan Lu & Na Ren & Ji-Bo Wang, 2023. "Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times," Mathematics, MDPI, vol. 11(19), pages 1-19, September.
    5. Yi-Chun Wang & Ji-Bo Wang, 2023. "Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect," Mathematics, MDPI, vol. 11(14), pages 1-20, July.
    6. Xingong, Zhang & Yong, Wang, 2015. "Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 628-635.
    7. Yurong Zhang & Xi Wang & Li-Han Zhang & Xue Jia & Ji-Bo Wang, 2024. "Different due-window assignment scheduling with deterioration effects," Journal of Combinatorial Optimization, Springer, vol. 48(5), pages 1-21, December.
    8. Li-Han Zhang & Dan-Yang Lv & Ji-Bo Wang, 2023. "Two-Agent Slack Due-Date Assignment Scheduling with Resource Allocations and Deteriorating Jobs," Mathematics, MDPI, vol. 11(12), pages 1-12, June.
    9. Sang, Yao-Wen & Wang, Jun-Qiang & Sterna, Małgorzata & Błażewicz, Jacek, 2023. "Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work," Omega, Elsevier, vol. 121(C).
    10. Lu, Haimin & Pei, Zhi, 2023. "Single machine scheduling with release dates: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 308(1), pages 19-37.
    11. Shabtay, Dvir, 2016. "Optimal restricted due date assignment in scheduling," European Journal of Operational Research, Elsevier, vol. 252(1), pages 79-89.
    12. Xuyin Wang & Weiguo Liu, 2024. "Optimal Different Due-Date Assignment Scheduling with Group Technology and Resource Allocation," Mathematics, MDPI, vol. 12(3), pages 1-17, January.
    13. Jian-You Xu & Win-Chin Lin & Yu-Wei Chang & Yu-Hsiang Chung & Juin-Han Chen & Chin-Chia Wu, 2023. "A Two-Machine Learning Date Flow-Shop Scheduling Problem with Heuristics and Population-Based GA to Minimize the Makespan," Mathematics, MDPI, vol. 11(19), pages 1-21, September.
    14. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Zheng-Guo Lv & Ji-Bo Wang, 2023. "Branch-and-Bound and Heuristic Algorithms for Group Scheduling with Due-Date Assignment and Resource Allocation," Mathematics, MDPI, vol. 11(23), pages 1-14, November.
    15. Lei Pan & Xinyu Sun & Ji-Bo Wang & Li-Han Zhang & Dan-Yang Lv, 2023. "Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-16, May.
    16. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    17. Zigao Wu & Shaohua Yu & Tiancheng Li, 2019. "A Meta-Model-Based Multi-Objective Evolutionary Approach to Robust Job Shop Scheduling," Mathematics, MDPI, vol. 7(6), pages 1-19, June.
    18. Janiak, Adam & Krysiak, Tomasz, 2012. "Scheduling jobs with values dependent on their completion times," International Journal of Production Economics, Elsevier, vol. 135(1), pages 231-241.
    19. 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.
    20. Rong-Rong Mao & Yi-Chun Wang & Dan-Yang Lv & Ji-Bo Wang & Yuan-Yuan Lu, 2023. "Delivery Times Scheduling with Deterioration Effects in Due Window Assignment Environments," Mathematics, MDPI, vol. 11(18), pages 1-18, September.

    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:gam:jmathe:v:12:y:2024:i:7:p:1029-:d:1366964. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.