IE interfaces (산업공학)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Genetic Algorithm with an Effective Dispatching Method for Unrelated Parallel Machine Scheduling with Sequence Dependent and Machine Dependent Setup Times

작업순서와 기계 의존적인 작업준비시간을 고려한 이종병렬기계의 일정계획을 위한 효과적인 작업할당 방법을 이용한 유전알고리즘

  • Joo, Cheol-Min (Department of Industrial and Management Engineering, Dongseo University) ;
  • Kim, Byung-Soo (Graduate School of Management of Technology, Pukyong National University)
  • 주철민 (동서대학교 산업경영공학과) ;
  • 김병수 (부경대학교 기술경영(MOT) 일반대학원)
  • Received : 2011.08.11
  • Accepted : 2012.04.05
  • Published : 2012.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers a unrelated parallel machine scheduling problem with ready times, due times and sequence and machine-dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of machines to minimize the total tardy time. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, a genetic algorithm using an effective dispatching method is proposed. The performance of the proposed genetic algorithm is evaluated using several randomly generated examples.

Keywords

References

  1. Agarwal, A., Colak, C., Jacob, V., and Pirkul, H. (2006), Heuristics and augmented neural networks for task scheduling with non-identical machines, European Journal of Operational Research, 175(1), 296-317. https://doi.org/10.1016/j.ejor.2005.03.045
  2. Balin, S. (2011), Non-identical parallel machine scheduling using genetic algorithm, Expert Systems with Applications, 38, 6814-6821. https://doi.org/10.1016/j.eswa.2010.12.064
  3. Behnamian, J., Zandieh M., and Ghomi, F. (2009), Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm, Expert Systems with Applications, 36, 9637-9644. https://doi.org/10.1016/j.eswa.2008.10.007
  4. Bobrowski, P. M. and Kim, S. C. (1994), The impact of sequence dependent setup time on job shop scheduling performance, International Journal of Production Research, 32, 1503-1520. https://doi.org/10.1080/00207549408957019
  5. Jou, C. (2005), A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines, Computers and Industrial Engineering, 48, 39-54. https://doi.org/10.1016/j.cie.2004.07.007
  6. Flynn, B. B. (1987), The effects of setup time on output capacity in cellular manufacturing, International Journal of Production Research, 25, 1761-1772.
  7. Frederickson, G., Hecht, M. S., and Kim, C. E. (1978), Approximation algorithm for some routing problems, SIAM Journal on Computing, 7, 178-193. https://doi.org/10.1137/0207017
  8. Gen, M., and Cheng, R. (2000), Genetic Algorithms and Engineering Optimization, New York : Wiley.
  9. Gharehgozli, A. H., Tavakkoli-Moghaddam, R., and Zaerpour, N. (2009), A fuzzy- mixed-integer goal programming mode for a parallel-machine scheduling problem with sequence-dependent setup times and release dates, Robotics and Computer-Integrated Manufacturing, 25, 853-859. https://doi.org/10.1016/j.rcim.2008.12.005
  10. Holland, J. H. (1975), Adaptation in natural and artificial systems, Ann Arbor, IL : University of Michigan Press.
  11. Hop, N. V. and Nagarur, N. N. (2004), The scheduling problem of PCBs for multiple non-identical parallel machines, European Journal of Operational Research, 158, 577-594 https://doi.org/10.1016/S0377-2217(03)00376-X
  12. Nait, T. D., Chu, C., Yalaoui, F., and Amodeo, L. (2003), A new approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times based on linear programming, In International conference on industrial engineering and production management (IEPM), 3, 266-274.
  13. Tavakkoli-Moghaddam, R., Taheri, F., Bazzazi, M., Izadi, M., and Sassani, F. (2009), Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints, Computers and Operations Research, 36, 3224-3230. https://doi.org/10.1016/j.cor.2009.02.012
  14. Sveltana, A., Kravchenko, S., and Werner, F. (2001), A heuristic algorithm for minimizing mean flow time with unit setups, Information Processing Letters, 79, 291-296. https://doi.org/10.1016/S0020-0190(01)00136-3
  15. Vallada, E. and Ruiz, R. (2011), A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times, European Journal of Operational Research, 211, 612-622. https://doi.org/10.1016/j.ejor.2011.01.011
  16. Yalaoui, F. and Chu, C. (2003), An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times, IIE Transactions, 35(2), 183-190. https://doi.org/10.1080/07408170304382

Cited by

  1. Heuristics for Non-Identical Parallel Machine Scheduling with Sequence Dependent Setup Times vol.40, pp.3, 2014, https://doi.org/10.7232/JKIIE.2014.40.3.305