Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

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

이종 병렬설비 공정의 납기지연시간 최소화를 위한 유전 알고리즘

  • Choi, Yu-Jun (Department of Business Administration, Dong-A University)
  • 최유준 (동아대학교 경영대학 경영학과)
  • Received : 2014.12.03
  • Accepted : 2015.03.03
  • Published : 2015.03.31
Download PDF
⟨ Previous Next ⟩

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

References

  1. Baker, K.R. and Baker, K.R., Introduction to sequencing and scheduling, New York : Wiley; 1974. Vol. 31.
  2. Balin, S., Non-identical parallel machine scheduling using genetic algorithm. Expert Systems with Applications, 2011, Vol. 38, No. 6, pp. 6814-6821. https://doi.org/10.1016/j.eswa.2010.12.064
  3. 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. https://doi.org/10.1016/S0305-0548(02)00198-3
  4. 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. https://doi.org/10.1016/0377-2217(90)90215-W
  5. 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. https://doi.org/10.7737/KMSR.2013.30.3.081
  6. 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.
  7. Dobson, G. and Nabinadom, R.S., The batch loading and scheduling problem. Research Repot, Simon Graduate School of Business Administration, University of Rochester, 1992.
  8. 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. https://doi.org/10.1287/moor.15.3.483
  9. Garey, M.R. and Johnson, D.S., Computer and intractability : A guide to the theory of NP-completeness, San Francisco : W.H. Freeman, 1979.
  10. 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. https://doi.org/10.1002/nav.3800330105
  11. 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.
  12. 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. https://doi.org/10.1002/nav.3800280411
  13. Lawler, E.L., A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1997, Vol. 1, pp. 331-342.
  14. 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. https://doi.org/10.1016/S0377-2217(95)00376-2
  15. Lenstra, J.K. and Rinnooy Kan, A.H.G., Complexity of scheduling under precedence constraints. Operations Research, 1978, Vol. 26, pp. 22-35. https://doi.org/10.1287/opre.26.1.22
  16. Lenstra, J.K., Kan, A.R., and Brucker, P., Complexity of machine scheduling problems. Ann. Discrete Math, 1977, Vol. 1, pp. 343-362. https://doi.org/10.1016/S0167-5060(08)70743-X
  17. 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. https://doi.org/10.1287/ijoc.2.4.346
  18. 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. https://doi.org/10.1016/j.cor.2006.02.006
  19. 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. https://doi.org/10.1016/S0954-1810(99)00021-7
  20. 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. https://doi.org/10.1287/opre.37.5.798
  21. 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.
  22. 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. https://doi.org/10.1016/0895-7177(96)00150-1
  23. Rinnooy, Kan A.H.G., Machine scheduling problems : Classification, complexity and computations. The Hague : Martinus Nijhoff, 1976.
  24. 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.
  25. Wilkerson, L.J. and Irwin, J.D., An improved method for scheduling independent tasks. AIIE Transactions, 1971, Vol. 3, No. 3, pp. 239-245. https://doi.org/10.1080/05695557108974812

Cited by

  1. 전용기계가 있는 혼합흐름공정의 생산 일정 계획 수립을 위한 2단계 접근법 vol.47, pp.4, 2015, https://doi.org/10.7469/jksqm.2019.47.4.823