The single-machine scheduling problem is the basis of scheduling theories. Because some of the production activities are completed earlier or later than standard time, they create several earliness and tardiness penalties. On the other hand, it is necessary to consider just in time philosophy and its importance in the scheduling problems. Therefore, this study seeks to develop a goal function for optimizing single-machine scheduling problems that combines both earliness and tardiness penalties. This study also is determined to minimize the earliness and tardiness penalties in this area. The restricted due date also has multiple effects on the optimum time. This is why that the present study also was aimed to examine the single-machine scheduling problems with focus on the earliness and tardiness penalties that considering restricted due date simultaneously. The proposed model of this study is an efficient method for understanding the importance of just in time in the scheduling problems.
1- Allaoua, H. and Osmane, I., (2010), Variable Parameters Lengths Genetic Algorithm for Minimizing Earliness-Tardiness Penalties of Single Machine Scheduling With a Common Due Date, Electronic Notes in Discrete Mathematics, 36(1): 471-478
2-Baker, K. R., & Scudder, G. D., (1990), Sequencing with earliness and tardiness penalties: A review, Operations Research, 38: 22–36.
3- Behnamian, J. and Zandieh, M., (2011), A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties, Expert Systems with Applications, 38(12):14490-14498
4-Chang, P.C., Chen, S.H., Mani,V., (2009), A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties, Applied Mathematical Modelling, 33(1): 579-596
5-Cheng, T., Gupta, M., (1989), Survey of scheduling research involving due date determination decisions, European Journal of Operational Research, 38: 156–166.
6- Fang, K.T. and Lin, B.M.T., (2013), Parallel-machine scheduling to minimize tardiness penalty and power cost, Computers & Industrial Engineering, 64(1): 224-234
7-Feldmann, M. and Biskup,D., (2003), Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches, Computers & Industrial Engineering, 44(2): 307-323.
8-Hall, N.G., (1986), Single- and multiple-processor models for minimizing completion time variance, Naval Research Logistics Quarterly, 33: 49-54.
9-Hall, N.G., Posner, M.E., (1991), Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date, Operations Research, 39: 836-846.
10-Hino, C.M., Ronconi, D.P., and Mendes, A.B., (2005), Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, European Journal of Operational Research, 160(1): 190-201.
11-Kanet, J. J., (1981), Minimizing the average deviation of job completion times about a common due date, Naval Research Logistics Quarterly, 28: 643–651.
12-Lakshminarayanan, S., Lakshmanan, R., Papineau, R.L., Rochette, R., (1978), Optimal single machine scheduling with earliness–tardiness penalties, Operations Research, 26: 1079–1082.
13-Landa Silva, J. D., Burke, E.K., Petrovic, S., (2004), An introduction to Multi objective Meta heuristics for Scheduling and Timetabling.
14-Panwalker, S., Smith, M. and Seidmann, A., (1982), Common due-date assignment to minimize total penalty for the one machine scheduling problem, Operations Research, 30: 391-399.
15-Seidmann, A., Panwalkar, S.S., Smith, M.L., (1981), Optimal assignment of due dates for a single processor scheduling problem, International Journal of Production Research, 19: 393–399.
16-Sidney, J.B., (1977), Optimal single machine scheduling with earliness and tardiness penalties, Operations Research, 25: 62–69.
17-Sule, R., (1996), Industrial Scheduling, pws publishing company.
18-Ventura, J.A. and Radhakrishnan, S., (2003), Single machine scheduling with symmetric earliness and tardiness penalties, European Journal of Operational Research, 144(3): 598-612.
19- Ying, K.C., (2008), Minimizing earliness–tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm, Computers & Industrial Engineering, 55(2): 494-502
Copyright: © 2013 The Author(s)
Published by Human Resource Management Academic Research Society (www.hrmars.com)
This article is published under the Creative Commons Attribution (CC BY 4.0) license. Anyone may reproduce, distribute, translate and create derivative works of this article (for both commercial and non-commercial purposes), subject to full attribution to the original publication and authors. The full terms of this license may be seen at: http://creativecommons.org/licences/by/4.0/legalcode
