IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i2d10.1007_s10878-023-00993-z.html
   My bibliography  Save this article

On optimal due date assignment without restriction and resource allocation in group technology scheduling

Author

Listed:
  • Ying Chen

    (Xi’an Jiaotong University)

  • Xiaole Ma

    (CASIC Research Institute of Intelligent Decision Engineering)

  • Guiqing Zhang

    (Xi’an Jiaotong University)

  • Yongxi Cheng

    (Xi’an Jiaotong University
    State Key Lab for Manufacturing Systems Engineering)

Abstract

A single machine group scheduling problem with due date assignment and resource allocation is investigated. Based on production similarities, jobs are classified into groups and it is required that jobs within the same group are processed contiguously, in order to achieve high-volume production efficiency. Jobs in the same group are allowed to have different due dates. The job processing times are resource dependent, and both convex and bounded linear resource consumption functions are considered. The aim is minimizing an aggregate cost which takes into account earliness, tardiness, due date assignment and resource allocation costs, by finding a group schedule, due date assignment and resource allocation for all jobs. For both resource consumption functions, we present properties of the optimal solutions, and for the special case where the size of every group is the same and the minimum of the due date assignment cost and the tardiness cost for each job is identical, we present an algorithm to optimally solve the problem in $$O(n^3)$$ O ( n 3 ) time, where n is the total number of jobs.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-00993-z
    DOI: 10.1007/s10878-023-00993-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-00993-z
    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/s10878-023-00993-z?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. 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.
    2. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    3. Shabtay, Dvir, 2016. "Optimal restricted due date assignment in scheduling," European Journal of Operational Research, Elsevier, vol. 252(1), pages 79-89.
    4. Li-Yan Wang & Mengqi Liu & Ji-Bo Wang & Yuan-Yuan Lu & Wei-Wei Liu & Lei Xie, 2021. "Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology," Complexity, Hindawi, vol. 2021, pages 1-9, March.
    5. 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.
    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. 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.
    2. 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.
    3. 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.

    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. 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.
    2. Shabtay, Dvir, 2016. "Optimal restricted due date assignment in scheduling," European Journal of Operational Research, Elsevier, vol. 252(1), pages 79-89.
    3. Du-Juan Wang & Yunqiang Yin & Shuenn-Ren Cheng & T.C.E. Cheng & Chin-Chia Wu, 2016. "Due date assignment and scheduling on a single machine with two competing agents," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1152-1169, February.
    4. 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.
    5. Dvir Shabtay, 2023. "A new perspective on single-machine scheduling problems with late work related criteria," Annals of Operations Research, Springer, vol. 322(2), pages 947-966, March.
    6. 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).
    7. 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.
    8. 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.
    9. 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.
    10. W-H Kuo & D-L Yang, 2008. "A note on due-date assignment and single-machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 857-859, June.
    11. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    12. 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.
    13. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1994. "Due‐date assignment and early/tardy scheduling on identical parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 17-32, February.
    14. T C E Cheng & L Kang & C T Ng, 2004. "Due-date assignment and single machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 198-203, February.
    15. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    16. Philip Kaminsky & Onur Kaya, 2008. "Scheduling and due‐date quotation in a make‐to‐order supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 444-458, August.
    17. 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.
    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. Adamopoulos, George I. & Pappis, Costas P., 1998. "Scheduling under a common due-data on parallel unrelated machines," European Journal of Operational Research, Elsevier, vol. 105(3), pages 494-501, March.
    20. Enrique Gerstl & Gur Mosheiov, 2013. "Minmax due-date assignment with a time window for acceptable lead-times," Annals of Operations Research, Springer, vol. 211(1), pages 167-177, December.

    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:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-00993-z. 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.