Araştırma Makalesi

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

Cilt: 2 Sayı: 1 2 Ağustos 2019
PDF İndir
EN

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

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.

Keywords

Kaynakça

  1. [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. [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. [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. [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. [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. [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. [7] J. Behnamian, S.M.T. Fatemi Ghomi, Multi-objective fuzzy multiprocessor flowshop scheduling, Applied Soft Computing Journal,21, 2014, 139-148.
  8. [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.

Ayrıntılar

Birincil Dil

İngilizce

Konular

Matematik

Bölüm

Araştırma Makalesi

Yayımlanma Tarihi

2 Ağustos 2019

Gönderilme Tarihi

22 Şubat 2019

Kabul Tarihi

28 Mayıs 2019

Yayımlandığı Sayı

Yıl 2019 Cilt: 2 Sayı: 1

Kaynak Göster

APA
Arık, 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, 2(1), 1-15. https://izlik.org/JA99CD53WU
AMA
1.Arık OA. Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems. jmmo. 2019;2(1):1-15. https://izlik.org/JA99CD53WU
Chicago
Arık, Oğuzhan Ahmet. 2019. “Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems”. Journal of Multidisciplinary Modeling and Optimization 2 (1): 1-15. https://izlik.org/JA99CD53WU.
EndNote
Arık OA (01 Ağustos 2019) Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems. Journal of Multidisciplinary Modeling and Optimization 2 1 1–15.
IEEE
[1]O. A. Arık, “Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems”, jmmo, c. 2, sy 1, ss. 1–15, Ağu. 2019, [çevrimiçi]. Erişim adresi: https://izlik.org/JA99CD53WU
ISNAD
Arık, Oğuzhan Ahmet. “Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems”. Journal of Multidisciplinary Modeling and Optimization 2/1 (01 Ağustos 2019): 1-15. https://izlik.org/JA99CD53WU.
JAMA
1.Arık OA. Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems. jmmo. 2019;2:1–15.
MLA
Arık, Oğuzhan Ahmet. “Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems”. Journal of Multidisciplinary Modeling and Optimization, c. 2, sy 1, Ağustos 2019, ss. 1-15, https://izlik.org/JA99CD53WU.
Vancouver
1.Oğuzhan Ahmet Arık. Dissatisfaction levels of earliness and tardiness durations by relaxing common due date on single machine scheduling problems. jmmo [Internet]. 01 Ağustos 2019;2(1):1-15. Erişim adresi: https://izlik.org/JA99CD53WU