Browse > Article
http://dx.doi.org/10.11627/jkise.2014.38.1.65

A Genetic Algorithm for Minimizing Total Tardiness with Non-identical Parallel Machines  

Choi, Yu-Jun (Department of Business Administration, Dong-A University)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.38, no.1, 2015 , pp. 65-73 More about this Journal
Abstract
This paper considers a parallel-machine scheduling problem with dedicated and common processing machines using GA (Genetic Algorithm). Non-identical setup times, processing times and order lot size are assumed for each machine. The GA is proposed to minimize the total-tardiness objective measure. In this paper, heuristic algorithms including EDD (Earliest Due-Date), SPT (Shortest Processing Time) and LPT (Longest Processing Time) are compared with GA. The effectiveness and suitability of the GA are derived and tested through computational experiments.
Keywords
Non-Identical Parallel-Machine Scheduling; Total-Tardiness; Genetic Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Choi, Y.J., Song, H.S., and Lee, I.S., A Genetic Algorithm for Minimizing Completion Time with Non-identical Parallel Machines. Korean management science review, 2013, Vol. 30, No. 3, pp. 81-97.   DOI
2 Choi, Y.J., Yu, J.D., Song, H.S., and Lee, I.S., The Batch Scheduling for Heat-Treatment Process with Parallel Machines Environments. Journal of the Korean Production and Operations Management Society, 2011, Vol. 22, No. 4, pp. 451-467.
3 Dobson, G. and Nabinadom, R.S., The batch loading and scheduling problem. Research Repot, Simon Graduate School of Business Administration, University of Rochester, 1992.
4 Du, J. and Leung, J.Y.T., Minimizing total tardiness on one machine is NP-hard. Mathematics of operations research, 1990, Vol. 15, No. 3, pp. 483-495.   DOI
5 Garey, M.R. and Johnson, D.S., Computer and intractability : A guide to the theory of NP-completeness, San Francisco : W.H. Freeman, 1979.
6 Hall, N.G., Single-and multiple-processor models for minimizing completion time variance. Naval Research Logistics Quarterly, 1986, Vol. 33, No. 1, pp. 49-54.   DOI
7 Jeon, T.J. and Park, S.H., A Proof of Transitivity of Job-Pair Comparison Rule to Minimize Total Tardiness in a Single Machine. Korean Management Science Review, 2001, Vol. 18, No. 1, pp. 147-153.
8 Kanet, J.J., Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 1981, Vol. 28, No. 4, pp. 643-651.   DOI
9 Lawler, E.L., A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1997, Vol. 1, pp. 331-342.
10 Lee, Y.H. and Pinedo, M., Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research, 1997, Vol. 100, No. 3, pp. 464-474.   DOI
11 Lenstra, J.K. and Rinnooy Kan, A.H.G., Complexity of scheduling under precedence constraints. Operations Research, 1978, Vol. 26, pp. 22-35.   DOI
12 Lenstra, J.K., Kan, A.R., and Brucker, P., Complexity of machine scheduling problems. Ann. Discrete Math, 1977, Vol. 1, pp. 343-362.   DOI
13 Leung, J.Y.T. and Young, G.H., Minimizing total tardiness on a single machine with precedence constraints. ORSA Journal on Computing, 1990, Vol. 2, No. 4, pp. 346-352.   DOI
14 Logendran, R., McDonell, B., and Smucker, B., Scheduling unrelated parallel machines with sequence-dependent setups. Computers and Operations Research, 2007, Vol. 34, No. 11, pp. 3420-3438.   DOI
15 Min, L. and Cheng, W., A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines. Artificial Intelligence in Engineering, 1999, Vol. 13, pp. 399-403.   DOI
16 Monma, C.L. and Potts, C.N., On the complexity of scheduling with batch setup time. Operations Research, 1989, Vol. 37, No. 5, pp. 798-804.   DOI
17 Park, M.W., A Genetic Algorithm for the Parallel-Machine Total Weighted Tardiness Problem. Journal of the Korean Institute of Industrial Engineers, 2000, Vol. 26, No. 2, pp. 183-192.
18 Piersma, N. and van Dijk W., A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. Mathematical and Computer Modelling, 1996, Vol. 24, No. 9, pp. 11-19.   DOI
19 Rinnooy, Kan A.H.G., Machine scheduling problems : Classification, complexity and computations. The Hague : Martinus Nijhoff, 1976.
20 Schutten, J.M.J. and Leussink, R.A.M., Parallel machine scheduling with release dates, due dates and family setup times. International Journal of Production Economics, 1996, Vol. 46, pp. 119-125.
21 Wilkerson, L.J. and Irwin, J.D., An improved method for scheduling independent tasks. AIIE Transactions, 1971, Vol. 3, No. 3, pp. 239-245.   DOI
22 Baker, K.R. and Baker, K.R., Introduction to sequencing and scheduling, New York : Wiley; 1974. Vol. 31.
23 Balin, S., Non-identical parallel machine scheduling using genetic algorithm. Expert Systems with Applications, 2011, Vol. 38, No. 6, pp. 6814-6821.   DOI
24 Bilge, U., Kirac, F., Kurtulan, M., and Pekgun, P., A tabu search algorithm for parallel machine total tardiness problem. Computers and Operations Research, 2004, Vol. 31, No. 3, pp. 397-414.   DOI
25 Cheng, T.C.E. and Sin, C.C.S., A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 1990, Vol. 47, No. 3, pp. 271-292.   DOI