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

Year 2019, Volume: 2 Issue: 1, 1 - 15, 02.08.2019

Oğuzhan Ahmet Arık

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

Earliness, tardiness, single machine, scheduling, fuzzy sets, dissatisfaction levels, common due date

References

• [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 batch-processing machine with non-identical job sizes under fuzzy environment, Kongzhi yu Juece/Control and Decision, 26(11), 2011,1675-1684.
• [13] H.P. Wang, L. Shi, Improved genetic algorithm for solving the fuzzy multiobjective Job Shop problem, Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management.
• [14] C. Wang, Y. Zhao, S. Wei, Genetic algorithm for the single machine earliness and tardiness scheduling problem with fuzzy processing times, Proceedings of the 29th Chinese Control Conference,2010.
• [15] B. Wang, Q. Li, X. Yang, X. Wang, Robust and satisfactory Job Shop scheduling under fuzzy processing times and flexible due dates, 2010 IEEE International Conference on Automation and Logistics.
• [16] H.C. Wu, Solving the fuzzy earliness and tardiness in scheduling problems by using genetic algorithms, Expert Systems with Applications,37(7), 2010,4860-4866.
• [17] J. Li, K. Sun, D. Xu, H. Li, Single machine due date assignment scheduling problem with customer service level in fuzzy environment, Applied Soft Computing Journal,10(3), 2010, 849-858.
• [18] P.J. Lai, H.C. Wu, Using genetic algorithms to solve fuzzy flow shop scheduling problems based on possibility and necessity measures, International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems,16(3), 2008,409-433.
• [19] Y. Dong, One machine fuzzy scheduling to minimize total weighted tardiness, earliness, and recourse cost, International Journal of Smart Engineering System Design,5(3),2003,135-147.
• [20] S.S. Lam, X. Cai, Earliness and tardiness scheduling with a fuzzy due date and job dependent weights, Journal of the Chinese Institute of Industrial Engineers,17(5), 2000,477-487.
• [21] S.S. Lam, X. Cai, Early-tardy scheduling under fuzzy due dates using a genetic algorithm, Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999,2,1079-1084
• [22] T. Murata, M. Gen, H. Ishibuchi, Multi-objective scheduling with fuzzy due-date, Computers and Industrial Engineering,35(3-4), 1998, 439-442
• [23] H. Ishibuchi, T. Murata, K.H. Lee, Relations between conventional scheduling problems and fuzzy scheduling problems, 1996, Proceedings of the IEEE Conference on Decision and Control.