On Pareto Set for a Bi-criterion Scheduling Problem Under Fuzziness.

Section: Research Paper
Issue
Vol. 18 No. 1 (2021): Volume 18 Issue 1
Published
Jun 25, 2025
Pages
38-44

Abstract

In this paper a bi-criterion fuzzy scheduling problem was presented and the problem under consideration is total fuzzy completion time and maximum earliness, where the processing times and the due dates are triangular fuzzy numbers. Each of jobs is to be processed without interruption on a single machine and becomes available for processing at time zero. A new definition of fuzzy numbers was given namely m-strongly positive fuzzy numbers, through this definition we found an interval which restricts the range of the fuzzy lower bound and presented a relation between the fuzzy lower bound and the fuzzy optimal solution with number of efficient solutions. Also we found the exact solution of the problem through finding the Pareto set.

References

  1. Abdul-Razaq, T. S., and Kawi, H. Y. (2010). Single Machine Scheduling to Minimize A Function of Square Completion Time and Maximum Earliness Simultaneously. Al-Mstansiriyah Journal of Science, 21 (5), 1-18.
  2. Cheng, CH. (1998). A new Approach for Ranking Fuzzy Numbers by Distance Method. Fuzzy Sets and Systems, 95, 307-317.
  3. Duenas, A. and Petrovic, D. (2008). Multi-objective Genetic Algorithm for Single Machine Scheduling Problem under Fuzziness. Fuzzy Optimization and Decision Making,7(1), 87-104.
  4. Hoogeveen, J. A., and Van de Velde, S. L.(1995). Minimizing Total Completion Time and Maximum Cost Simultaneously is Solvable in Polynomial Time. Operations Research Letters, 17, 205-208.
  5. Hsien, Ch. (2010). Solving The Fuzzy Earliness and Tardiness in Scheduling Problems by Using Genetic Algorithms. Expert Systems with Applications, 37, 860-4866.
  6. Ishii, H. and Tada, M. (1995). Single Machine Scheduling Problem with Fuzzy Precedence Relation, European Journal of Operational Research, 87(2), 284-288.
  7. Jayanthi, S.E., Karthigeyan, S. and Anusuya, S. (2017). Minimizing Earliness and Tardiness Costs with Fuzzy Processing Times and Due Dates in Single Machine Scheduling Using QPSO. International Journal of Pure and Applied Mathematics, 115(8), 437-442.
  8. Kurz, M. and Canterbury, S. (2005). Minimizing Total Flowtime and Maximum Earliness on A Single Machine using Multiple Measures of Fitness. Genetic and Evolutionary Computation Conference, GECCO, Proceedings, Washington DC, USA, June 25-29.
  9. Lazarev, A., Arkhipov, D. and Werner, F. (2015). Single Machine Scheduling: Finding the Pareto Set for Jobs with Equal Processing Times with Respect to Criteria and 7th Multidisciplinary International Conference on Scheduling: Theory and Applications, 25-28.
  10. Lei, D. (2009). Multi-objective Production Scheduling: A Survey. International Journal of Advanced Manufacturing Technology, 43, 926-938.
  11. Nguyen, V. and Bao, H. P. (2016). An Efficient Solution to the Mixed Shop Scheduling Problem using A Modified Genetic Algorithm. Procedia Computer Science, 95 (5), 475-482.
  12. Niroomand, S., Hadi-Vencheh, A., Mirzaei, N. and Molla-Alizadeh-Zavardehi. (2016). Hybrid Greedy Algorithms for Fuzzy Tardiness/Earliness Minimisaton in A Special Single Machine Scheduling Problem: Case Study and Generalisation. International Journal of Computer Integrated Manufacturing, 29(8), 870-888.
  13. Tkindt, V.J. and Billaut, C. (2001). Multi-criteria Scheduling Problems: A Survey RAIRO Operations Research, (35)2, 143-163.

Authors

Ayad Ramadan

Department. of Mathematics ,College Of Science, University of Sulaimani,Sulaimani,Iraq.

ORCID

Identifiers

Download this PDF file
PDF

Statistics

How to Cite

Ramadan, A., & ایاد. (2025). On Pareto Set for a Bi-criterion Scheduling Problem Under Fuzziness. IRAQI JOURNAL OF STATISTICAL SCIENCES, 18(1), 38–44. Retrieved from https://rjps.uomosul.edu.iq/index.php/stats/article/view/20669