IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v61y2024i3d10.1007_s12597-024-00750-8.html
   My bibliography  Save this article

Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling

Author

Listed:
  • Oğuzhan Ahmet Arık

    (Erciyes University)

Abstract

This paper considers an unrelated parallel machine scheduling problem with a common due date where the objective is to minimize the sum of completion times, earliness, and tardiness durations of the jobs. This paper discovers some properties of the considered problem for restricted and unrestricted common due dates. By using these properties, the paper shows the existence of some optimal policies for the problem. Furthermore, optimal policies for the problem are found. According to our main findings, optimal policies for the problem are to increase the number of early jobs, to use the shortest processing time dispatching rule for tardy jobs, and to distribute tardy jobs on machines with tardy workloads that differ from each other as much as possible. These strategies for the problem are new to the literature and the problem has the potential to be extended. Using these strategies, the paper presents a novel heuristic algorithm for the problem that is rarely studied in the literature. Furthermore, the proposed heuristic is compared with two existing algorithms by generating some test instances for experimental study. The experimental study shows that the proposed heuristic outperforms other algorithms. Furthermore, the paper discusses which components of our proposed solution approach have impacts on the solution quality.

Suggested Citation

  • Oğuzhan Ahmet Arık, 2024. "Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling," OPSEARCH, Springer;Operational Research Society of India, vol. 61(3), pages 1654-1680, September.
    • Handle: RePEc:spr:opsear:v:61:y:2024:i:3:d:10.1007_s12597-024-00750-8
    DOI: 10.1007/s12597-024-00750-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00750-8
    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/s12597-024-00750-8?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. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    2. Oğuzhan Ahmet Arik, 2023. "A heuristic for single machine common due date assignment problem with different earliness/tardiness weights," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1561-1574, September.
    3. 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.
    4. Ying Chen & Yi Xu & Guiqing Zhang & Yongxi Cheng, 2023. "A Single Machine Group Scheduling Problem with Due Date Assignment and Position-Dependent Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(04), pages 1-20, August.
    5. P. Senthil Kumar, 2019. "Intuitionistic fuzzy solid assignment problems: a software-based approach," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(4), pages 661-675, August.
    6. Vahid Nasrollahi & Ghasem Moslehi & Mohammad Reisi-Nafchi, 2022. "Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem," Operational Research, Springer, vol. 22(2), pages 1403-1442, April.
    7. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    8. 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.
    9. Shim, Sang-Oh & Kim, Yeong-Dae, 2007. "Scheduling on parallel identical machines to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 177(1), pages 135-146, February.
    10. Yunqiang Yin & Youhua Chen & Kaida Qin & Dujuan Wang, 2019. "Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria," Journal of Scheduling, Springer, vol. 22(3), pages 315-333, June.
    11. Falq, Anne-Elisabeth & Fouilhoux, Pierre & Kedad-Sidhoum, Safia, 2022. "Dominance inequalities for scheduling around an unrestrictive common due date," European Journal of Operational Research, Elsevier, vol. 296(2), pages 453-464.
    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. Li Cheng & Liu Conglin, 2023. "Game analysis and pricing strategy of duopoly airlines based on service," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(3), pages 1103-1124, June.
    2. P. Senthil Kumar, 2019. "PSK Method for Solving Mixed and Type-4 Intuitionistic Fuzzy Solid Transportation Problems," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 10(2), pages 20-53, April.
    3. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
    4. Abdelmalek Ouannou & Adil Brouri & Laila Kadi & Hafid Oubouaddi, 2022. "Identification of switched reluctance machine using fuzzy model," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(6), pages 2833-2846, December.
    5. Saeedeh Bazari & Alireza Pooya & Omid Soleimani Fard & Pardis Roozkhosh, 2023. "Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 877-915, June.
    6. Zhi-Ming Chen & Cheng-Hsiung Lee & Hung-Lin Lai, 2022. "Speedup the optimization of maximal closure of a node-weighted directed acyclic graph," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1413-1437, December.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. Rafał Różycki & Joanna Józefowska & Krzysztof Kurowski & Tomasz Lemański & Tomasz Pecyna & Marek Subocz & Grzegorz Waligóra, 2022. "A Quantum Approach to the Problem of Charging Electric Cars on a Motorway," Energies, MDPI, vol. 16(1), pages 1-20, December.
    17. Sourabh Devidas Kulkarni & Priyanka Verma, 2023. "A fuzzy-QFD approach to manufacturing strategy formulation," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1407-1432, September.
    18. 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.
    19. 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.
    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:spr:opsear:v:61:y:2024:i:3:d:10.1007_s12597-024-00750-8. 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.