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

Single-Machine Group Scheduling Model with Position-Dependent and Job-Dependent DeJong’s Learning Effect

Author

Listed:
  • Jin Qian

    (College of Science, Northeastern University, Shenyang 110819, China)

  • Yu Zhan

    (College of Science, Northeastern University, Shenyang 110819, China)

Abstract

This paper considers the single-group scheduling models with Pegels’ and DeJong’s learning effect and the single-group scheduling models with Pegels’ and DeJong’s aging effect. In a classical scheduling model, Pegels’ and DeJong’s learning effect is a constant or position-dependent, while the learning effect and aging effect are job-dependent in this paper. Compared with the classical learning model and aging model for scheduling, the proposed models are more general and realistic. The objective functions are to minimize the total completion time and makespan. We propose polynomial time methods to solve all the studied problems.

Suggested Citation

  • Jin Qian & Yu Zhan, 2022. "Single-Machine Group Scheduling Model with Position-Dependent and Job-Dependent DeJong’s Learning Effect," Mathematics, MDPI, vol. 10(14), pages 1-9, July.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:14:p:2454-:d:862607
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/14/2454/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/14/2454/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Li Sun & Lei Ning & Jia-zhen Huo, 2020. "Group Scheduling Problems with Time-Dependent and Position-Dependent DeJong’s Learning Effect," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-8, February.
    2. Yang, Suh-Jenq & Yang, Dar-Li, 2010. "Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities," Omega, Elsevier, vol. 38(6), pages 528-533, December.
    3. Min Ji & Xin Zhang & Xiaoying Tang & T.C.E. Cheng & Guiyi Wei & Yuanyuan Tan, 2016. "Group scheduling with group-dependent multiple due windows assignment," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1244-1256, February.
    4. G Mosheiov, 2001. "Parallel machine scheduling with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1165-1169, October.
    5. Gang Li & Mei-Ling Luo & Wen-Jie Zhang & Xiao-Yuan Wang, 2015. "Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation," International Journal of Production Research, Taylor & Francis Journals, vol. 53(4), pages 1228-1241, February.
    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. 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.
    2. Gara-Ali, Ahmed & Finke, Gerd & Espinouse, Marie-Laure, 2016. "Parallel-machine scheduling with maintenance: Praising the assignment problem," European Journal of Operational Research, Elsevier, vol. 252(1), pages 90-97.
    3. Zhang Xingong & Wang Yong & Bai Shikun, 2016. "Single-machine group scheduling problems with deteriorating and learning effect," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(10), pages 2402-2410, July.
    4. Rustogi, Kabir & Strusevich, Vitaly A., 2012. "Simple matching vs linear assignment in scheduling models with positional effects: A critical review," European Journal of Operational Research, Elsevier, vol. 222(3), pages 393-407.
    5. Zoltán Varga & Pál Simon, 2014. "Examination Of Scheduling Methods For Production Systems," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 8(1), pages 111-120, December.
    6. 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.
    7. 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.
    8. Anna Arigliano & Gianpaolo Ghiani & Antonio Grieco & Emanuela Guerriero, 2017. "Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs," 4OR, Springer, vol. 15(2), pages 201-215, June.
    9. 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.
    10. Chung-Lun Li, 2008. "A note on unrelated parallel machine scheduling with time-dependent processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1696-1697, December.
    11. Xu, Dehua & Wan, Long & Liu, Aihua & Yang, Dar-Li, 2015. "Single machine total completion time scheduling problem with workload-dependent maintenance duration," Omega, Elsevier, vol. 52(C), pages 101-106.
    12. Norelhouda Sekkal & Fayçal Belkaid, 0. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-37.
    13. Lu Liu & Jian-Jun Wang & Xiao-Yuan Wang, 2016. "Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1186-1195, February.
    14. Qian, Jianbo & Steiner, George, 2013. "Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine," European Journal of Operational Research, Elsevier, vol. 225(3), pages 547-551.
    15. Peng Liu & Xiaoli Wang, 2017. "Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date," Journal of Optimization, Hindawi, vol. 2017, pages 1-7, April.
    16. Oron, Daniel, 2016. "Scheduling controllable processing time jobs with position-dependent workloads," International Journal of Production Economics, Elsevier, vol. 173(C), pages 153-160.
    17. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    18. A Janiak & R Rudek, 2010. "Scheduling jobs under an aging effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(6), pages 1041-1048, June.
    19. Yang, Dar-Li & Lai, Chien-Jung & Yang, Suh-Jenq, 2014. "Scheduling problems with multiple due windows assignment and controllable processing times on a single machine," International Journal of Production Economics, Elsevier, vol. 150(C), pages 96-103.
    20. Wang, Ji-Bo, 2007. "Single-machine scheduling problems with the effects of learning and deterioration," Omega, Elsevier, vol. 35(4), pages 397-402, August.

    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:10:y:2022:i:14:p:2454-:d:862607. 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.