SavedAdd your journal

Journals / Journal of Multidisciplinary Modeling and Optimization / 2019 / Cilt: 2 - Sayı: 1

Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems

Oğuzhan Ahmet ARIK
Pages
1–15
Publication Date
2019-08-02
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Then, this paper uses dissatisfaction levels in order to introduce a new objective criterion that minimizes the products of earliness and tardiness durations with dissatisfaction levels.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:This paper investigates single machine earliness/tardiness problem considering the decision maker’s tolerances for earliness and tardiness durations in case of a restrictive common due date.
📊
Key Findings & Data:In many classical or basic earliness/tardiness problems, due dates are accepted as deterministic or rigid numbers.
💡
Conclusion & Impact:Then, this paper uses dissatisfaction levels in order to introduce a new objective criterion that minimizes the products of earliness and tardiness durations with dissatisfaction levels.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Earliness · tardiness · single machine

Abstract

This paper investigates single machine earliness/tardiness problem considering the decision maker’s tolerances for earliness and tardiness durations in case of a restrictive common due date. In many classical or basic earliness/tardiness problems, due dates are accepted as deterministic or rigid numbers. In this paper, common due date in a single machine scheduling problem is relaxed with lower and upper bounds and these bounds are used for illustrating the decision maker’s tolerances or satisfaction levels by using fuzzy sets. As a complementary set of satisfaction levels, dissatisfaction levels can be encoded with fuzzy sets. Then, this paper uses dissatisfaction levels in order to introduce a new objective criterion that minimizes the products of earliness and tardiness durations with dissatisfaction levels.

🔖

Cite This Article

ARIK, O. A. (2019). Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems. Journal of Multidisciplinary Modeling and Optimization, Cilt: 2 - Sayı: 1, 1–15. https://ajindex.com/articles/836273

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (12)

  1. O.A. Arık, M.D. Toksarı, Multi-objective fuzzy parallel machine scheduling problems under fuzzy job deterioration and learning effects, International Journal of Production Research 55, 2017, 1-18
  2. S.E. Jayanthi, S. Karthigeyan, S. Anusuya, Minimizing earliness and tardiness costs with fuzzy processing times and fuzzy due dates in single machine scheduling using QPSO, International Journal of Pure and Applied Mathematics,115(8), 2017, Special Issue,437-442
  3. S. Niroomand, A. Hadi-Vencheh, N. Mirzaei, S. Molla-Alizadeh-Zavardehi, Hybrid greedy algorithms for fuzzy tardiness/earliness minimisation in a special single machine scheduling problem: case study and generalisation, International Journal of Computer Integrated Manufacturing,29(8), 2016, 870-888
  4. J.C. Geng, Z. Cui, X.S. Gu, Scatter search based particle swarm optimization algorithm for earliness/tardiness flowshop scheduling with uncertainty, International Journal of Automation and Computing, 13(3), 2016, 285-295
  5. S. Kir and H.R. Yazgan, A sequence dependent single machine scheduling problem with fuzzy axiomatic design for the penalty costs, Computers and Industrial Engineering, 92,2016, 95-104
  6. J. Li, J. Zhang, A 2-Approximation algorithm for the single machine due date assignment scheduling problem in fuzzy environment to minimize the total costs, Proceedings - 2015 11th International Conference on Computational Intelligence and Security, CIS 2015, 2016
  7. J. Behnamian, S.M.T. Fatemi Ghomi, Multi-objective fuzzy multiprocessor flowshop scheduling, Applied Soft Computing Journal,21, 2014, 139-148
  8. O. Engin, M.K. Yılmaz, M.E. Baysal, A.,Solving fuzzy job shop scheduling problems with availability constraints using a scatter search method, Journal of Multiple-Valued Logic and Soft Computing,21(3-4), 2013,317-334
  9. P. Yan, M.-H. Jiao, L.-Q. Zhao, Scheduling a fuzzy flowshop problem to minimize weighted earliness-tardiness, 25th Chinese Control and Decision Conference, CCDC 2013
  10. Z. Xu, X. Gu, Research on zero-wait scheduling problems in multiproduct processes with due dates, Communications in Computer and Information Science, 355, 2013, 322-332
  11. J. Li, X. Yuan, E.S. Lee, D. Xu, Setting due dates to minimize the total weighted possibilistic mean value of the weighted earlinesstardiness costs on a single ma-chine,Computers and Mathematics with Applications, 62(11), 2011,4126-4139
  12. B.Y. Lu, C.F. Huang, Z.H. Jia, Research on multi-objective scheduling a single