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.
Similar content being viewed by others
Data availability
The datasets generated during and/or analyzed during the current study are available from the corresponding author upon reasonable request.
Abbreviations
- \(n\) :
-
Number of jobs
- \(m\) :
-
Number of machines
- \(j\) :
-
Index of jobs \(j\in \{\mathrm{1,2},...,n\}\)
- \(i\) :
-
Index of machines \(i\in \{\mathrm{1,2},...,m\}\)
- \(d\) :
-
The common due date for all jobs
- \({E}_{j}\) :
-
Earliness of job \(j\)
- \({T}_{j}\) :
-
Tardiness of job \(j\)
- \({C}_{j}\) :
-
Completion time of job \(j\)
- \({f}_{j}^{E}\) :
-
Cost effect of early job \(j\) in the objective function
- \({f}_{j}^{T}\) :
-
Cost effect of tardy job \(j\) in the objective function
- \(\Delta\) :
-
The sum of processing times that are processed after the common due date and until completion of the job \(j\)
- \({C}_{j}^{\pi },{C}_{k}^{\pi },{C}_{j}^{{\pi }^{\prime}}\) and \({C}_{k}^{{\pi }^{\prime}}\) :
-
Completion times of jobs (\(j,k\)) in schedules (\(\pi\), \({\pi }^{\prime}\))
References
Biskup, D., Cheng, T.C.E.: Multiple-machine scheduling with earliness, tardiness and completion time penalties. Comput. Oper. Res. 26, 45–57 (1999). https://doi.org/10.1016/S0305-0548(98)00044-6
Arık, O.A., Toksarı, M.D.: Multi-objective fuzzy parallel machine scheduling problems under fuzzy job deterioration and learning effects. Int. J. Prod. Res. 56, 2488–2505 (2018). https://doi.org/10.1080/00207543.2017.1388932
Su, L.-H.: Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system. Comput. Oper. Res. 36, 461–471 (2009). https://doi.org/10.1016/j.cor.2007.09.013
Sivrikaya-Şrifoǧlu, F., Ulusoy, G.: Parallel machine scheduling with earliness and tardiness penalties. Comput. Oper. Res. 26, 773–787 (1999). https://doi.org/10.1016/S0305-0548(98)00090-2
Weng, M.X., Lu, J., Ren, H.: Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int. J. Prod. Econ. 70, 215–226 (2001). https://doi.org/10.1016/S0925-5273(00)00066-9
Bilge, Ü., Kiraç, F., Kurtulan, M., Pekgün, P.: A tabu search algorithm for parallel machine total tardiness problem. Comput. Oper. Res. 31, 397–414 (2004). https://doi.org/10.1016/S0305-0548(02)00198-3
Liaw, C.-F., Lin, Y.-K., Cheng, C.-Y., Chen, M.: Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput. Oper. Res. 30, 1777–1789 (2003). https://doi.org/10.1016/S0305-0548(02)00105-3
Radhakrishnan, S., Ventura, J.A.: Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times. Int. J. Prod. Res. 38, 2233–2252 (2000). https://doi.org/10.1080/00207540050028070
Cheng, R., Gen, M., Tozawa, T.: Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms. Comput. Ind. Eng. 29, 513–517 (1995). https://doi.org/10.1016/0360-8352(95)00126-L
Balakrishnan, N., Kanet, J.J., Sridharan, S.V.: Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput. Oper. Res. 26, 127–141 (1999). https://doi.org/10.1016/S0305-0548(98)00051-3
Cheng, T.C., Chen, Z.-L.: Parallel-machine scheduling problems with earliness and tardiness penalties. J. Oper. Res. Soc. 45, 685–695 (1994). https://doi.org/10.1057/jors.1994.106
Toksarı, M.D., Güner, E.: Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int. J. Adv. Manuf. Technol. 38, 801–808 (2008). https://doi.org/10.1007/s00170-007-1128-3
Biskup, D., Herrmann, J., Gupta, J.N.D.: Scheduling identical parallel machines to minimize total tardiness. Int. J. Prod. Econ. 115, 134–142 (2008). https://doi.org/10.1016/j.ijpe.2008.04.011
Shim, S.-O., Kim, Y.-D.: Scheduling on parallel identical machines to minimize total tardiness. Eur. J. Oper. Res. 177, 135–146 (2007). https://doi.org/10.1016/j.ejor.2005.09.038
Bank, J., Werner, F.: Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties. Math. Comput. Model. 33, 363–383 (2001). https://doi.org/10.1016/S0895-7177(00)00250-8
Yin, Y., Chen, Y., Qin, K., Wang, D.: Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria. J. Sched. 22, 315–333 (2019). https://doi.org/10.1007/s10951-018-0583-z
Arık, O.A.: Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness/tardiness scheduling problems. Evol. Intell. 13, 415–425 (2020). https://doi.org/10.1007/s12065-019-00305-7
Arık, O.A., Schutten, M., Topan, E.: Weighted earliness/tardiness parallel machine scheduling problem with a common due date. Expert Syst. Appl. 187, 115916 (2022). https://doi.org/10.1016/J.ESWA.2021.115916
Arik, O.A.: A heuristic for single machine common due date assignment problem with different earliness/tardiness weights. Opsearch 60, 1561–1574 (2023). https://doi.org/10.1007/s12597-023-00652-1
Kordmostafapour, A., Rezaeian, J., Mahdavi, I., Farjad, M.Y.: Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost. Opsearch 59, 1438–1470 (2022). https://doi.org/10.1007/s12597-022-00587-z
Chen, Y., Xu, Y., Zhang, G., Cheng, Y.: A single machine group scheduling problem with due date assignment and position-dependent costs. Asia-Pac. J. Oper. Res. (2023). https://doi.org/10.1142/S0217595923400079
Geng, X.-N., Sun, X., Wang, J., Pan, L.: Scheduling on proportionate flow shop with job rejection and common due date assignment. Comput. Ind. Eng. 181, 109317 (2023). https://doi.org/10.1016/j.cie.2023.109317
Pan, L., Sun, X., Wang, J.-B., Zhang, L.-H., Lv, D.-Y.: Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs. J. Comb. Optim. 45, 100 (2023). https://doi.org/10.1007/s10878-023-01025-6
Mosheiov, G., Sarig, A.: A common due-date assignment problem with job rejection on parallel uniform machines. Int. J. Prod. Res. (2023). https://doi.org/10.1080/00207543.2023.2217277
Wang, W.: Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times. J. Appl. Math. Comput. 68, 1013–1031 (2022). https://doi.org/10.1007/s12190-021-01555-4
Nasrollahi, V., Moslehi, G., Reisi-Nafchi, M.: 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. Oper. Res. 22, 1403–1442 (2022). https://doi.org/10.1007/s12351-020-00577-3
Falq, A.-E., Fouilhoux, P., Kedad-Sidhoum, S.: Dominance inequalities for scheduling around an unrestrictive common due date. Eur. J. Oper. Res. 296, 453–464 (2022). https://doi.org/10.1016/j.ejor.2021.03.048
Qian, J., Han, H.: The due date assignment scheduling problem with the deteriorating jobs and delivery time. J. Appl. Math. Comput. (2021). https://doi.org/10.1007/s12190-021-01607-9
Adamopoulos, G.I., Pappis, C.P.: Scheduling under a common due-date on parallel unrelated machines. Eur. J. Oper. Res. 105, 494–501 (1998). https://doi.org/10.1016/S0377-2217(97)00057-X
Toksarı, M.D., Güner, E.: The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration. Expert Syst. Appl. 37, 92–112 (2010). https://doi.org/10.1016/j.eswa.2009.05.014
Panwalkar, S.S., Smith, M.L., Seidmann, A.: Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper. Res. 30, 391–399 (1982). https://doi.org/10.1287/opre.30.2.391
Arık, O.A.: Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date. Grey Syst. 11, 95–109 (2021). https://doi.org/10.1108/GS-01-2020-0010
Kumar, S.P.: Computationally simple and efficient method for solving real-life mixed ıntuitionistic fuzzy 3D assignment problems. Int. J. Softw. Sci. Comput. Intell. (IJSSCI) 14, 1–42 (2022). https://doi.org/10.4018/IJSSCI.291715
Senthil Kumar, P.: Developing a new approach to solve solid assignment problems under intuitionistic fuzzy environment. Int. J. Fuzzy Syst. Appl. 9, 1–34 (2020). https://doi.org/10.4018/IJFSA.2020010101
Kumar, P.S. (2019) The PSK Method for Solving Fully Intuitionistic Fuzzy Assignment Problems With Some Software Tools. 149–202. https://doi.org/10.4018/978-1-5225-8458-2.CH009
Senthil Kumar, P.: Intuitionistic fuzzy solid assignment problems: a software-based approach. Int. J. Syst. Assur. Eng. Manag. 10, 661–675 (2019). https://doi.org/10.1007/S13198-019-00794-W/FIGURES/6
Senthil Kumar, P.: Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set. Int. J. Syst. Assur. Eng. Manag. 11, 189–222 (2020). https://doi.org/10.1007/S13198-019-00941-3/FIGURES/9
Toksarı, M.D., Arık, O.A.: Single machine scheduling problems under position-dependent fuzzy learning effect with fuzzy processing times. J. Manuf. Syst. (2017). https://doi.org/10.1016/j.jmsy.2017.08.006
Toksarı, M.D., Arık, O.A.: Genetic algorithm applied to the flow shop scheduling problem under effects of fuzzy learning and deterioration with a common fuzzy due date. New Trends Issues Proc. Hum. Soc. Sci. 4, 306–316 (2017)
Arık, O.A., Toksarı, M.D.: Fuzzy chance constrained programming technique for single machine earliness/tardiness scheduling problem under effects of fuzzy learning and deterioration. Sak. Univ. J. Sci. 22, 1–1 (2018). https://doi.org/10.16984/saufenbilder.299354
Arık, O.A., Toksarı, M.D.: Fuzzy parallel machine scheduling problem under fuzzy job deterioration and learning effects with fuzzy processing times. In: Ram, M. (ed.) Advanced Fuzzy Logic Approaches in Engineering Science. pp. 49–67. IGI Global (2019)
Arık, O.A., Toksarı, M.D.: Minimizing makespan with fuzzy processing times under job deterioration and learning effect. J. Mech. Eng. 31, 1–17 (2020). https://doi.org/10.4018/978-1-5225-5709-8.CH003ARINDAM
Rostami, M., Pilerood, A.E., Mazdeh, M.M.: Multi-objective parallel machine scheduling problem with job deterioration and learning effect under fuzzy environment. Comput. Ind. Eng. 85, 206–215 (2015). https://doi.org/10.1016/j.cie.2015.03.022
Arık, O.A.: Credibility based chance constrained programming for project scheduling with fuzzy activity durations. Int. J. Optim. Control Theor. Appl. 9, 208–215 (2019). https://doi.org/10.11121/ijocta.01.2019.00631
Arık, O.A.: Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems. J. Multidiscip. Model. Optim. 2, 1–15 (2019)
Zadeh, L.A.: The concept of a linguistic variable and its application to approximate reasoning-I. Inf. Sci. (Ny) 8, 199–249 (1975)
Allahviranloo, T., Lotfi, F.H., Kiasary, M.K.: Solving fully fuzzy linear programming problem by the ranking function. Appl. Math. Sci. 2, 19–32 (2008)
Kumar, A., Kaur, J., Singh, P.: A new method for solving fully fuzzy linear programming problems. Appl. Math. Model. 35, 817–823 (2011). https://doi.org/10.1016/j.apm.2010.07.037
Kumar, A., Kaur, J., Singh, P.: Fuzzy optimal solution of fully fuzzy linear programming problems with inequality constraints. Int. J. Math. Comput. Sci. 6, 37–41 (2010)
Jayalakshmi, M., Pandian, P.: A new method for finding an optimal fuzzy solution for fully fuzzy linear programming problems. Ijera. Com. 2, 247–254 (2012)
Lai, Y.-J., Hwang, C.-L.: A new approach to some possibilistic linear programming problems. Fuzzy Sets Syst. 49, 121–133 (1992)
Fullér, R.: On a special type of fuzzy linear programming. Colloq. Math. Soc. Janos Bolyai. 50, 511–519 (1986)
Liu, B., Iwamura, K.: Chance constrained programming with fuzzy parameters. Fuzzy Sets Syst. 94, 227–237 (1998). https://doi.org/10.1016/S0165-0114(96)00236-9
Funding
Not applicable.
Author information
Authors and Affiliations
Contributions
OAA designed the investigated problem and he contributed to the design of the proposed algorithm and experimental study in the paper. OAA edited and wrote the paper. Also, OAA read and approved the final manuscript.
Corresponding author
Ethics declarations
Conflict of interest
The author declares that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Arık, O.A. Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling. OPSEARCH (2024). https://doi.org/10.1007/s12597-024-00750-8
Accepted:
Published:
DOI: https://doi.org/10.1007/s12597-024-00750-8
Keywords
- Unrelated parallel machine
- Common due date
- Earliness
- Tardiness
- The sum of completion times
- Optimal policy