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

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

Applying tabu search to multiprocessor task scheduling problem with precedence relations

선행관계를 가진 다중프로세서 작업들의 Makespan 최소화를 위한 변형타부검색

  • Lee Dong-Ju (Industrial Systems Engineering, Kongju National University)
  • 이동주 (공주대학교 산업시스템공학과)
  • Published : 2004.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper concerns on a multiprocessor task scheduling problem with precedence relation, in which each task requires several processors simultaneously. Meta-heuristic generally finds a good solution if it starts from a good solution. In this paper, a tabu search is presented to find a schedule of minimal time to complete all tasks. A modified tabu search is also presented which uses a new initial solution based on the best solution during the previous run as the new starting solution for the next iteration. Numerical results show that a tabu search and a modified tabu search yield a better performance than the previous studies.

Keywords

References

  1. 문기주, 오현승, 이동주; 'A Genetic Algorithm for Scheduling Multiprocessor Tasks on Dedicated Processor', 대한설비관리학회지, 8(2): 5-15, 2003
  2. 신현준, 김성식, 고경석; '작업투입시점과 순서 의존적인 작업준비시간이 존재하는 단일 기계 일정계획 수립을 위한 Tabu Search', 대한산업공학회지, 27(2): 158-168, 2001
  3. 현철주; '혼합모델 조립라인의 생산순서 결정을 위한 다목적 타부검색', 대한설비관리학회지, 7(3): 45-57, 2002
  4. Amoura, A.K., Bampis, E., Manoussakis, Y., and Tuza, Z.; 'A comparison of heurisitics for scheduling multiprocessor ta나s on three dedicated processors', Parallel Computing, 25; 49-61, 1999
  5. Baptiste, P.; 'A note on scheduling multiprocessor tasks with identical processing times', Computers & Operations Research, 30; 2071-2078, 2003
  6. Blazewicz, J., Dell'Olmo, P., Drozdowski, M., and Speranza, M..G.,; 'Scheduling multiprocessor tasks on three dedicated processors', Information Processing Letters; 41; 275-280, 1992
  7. Blazewicz, J., Drozdowski, M., and Weglarz, J.; 'Scheduling Multiprocessor Tasks-A Survey', Microcomputer Applications, 13(2); 89-97, 1994
  8. Chen, J., and Lee, C.-Y.; 'General Multiprocessor Task Scheduling', Naval Research Logistics 46; 57-74, 1999
  9. Confessore, G., Dell'Olmo, P., and Giordani, S.; 'Complexity and approroximation results for scheduling multiprocessor tasks on a ring', Discrete Applied Mathematics, 133; 29-44, 2004
  10. Glover, F., ' Tabu search, Part 1', ORSA journal on Computing, Vol. 1, No. 3, pp.190-206, 1989
  11. Glover, F., 'Tabu search,Part 2', ORSA journal on Computing, Vol. 2, No. 1, pp.4-32, 1990
  12. Goemans, M. X.; 'An approximation algorithm for scheduling on three dedicated machines', Discrete Applied Mathematics, 61; 49-59, 1995
  13. Hoogeveen, J.A., van de Velde, S.L., and Veltman, B.; 'Complexity of sheduling multiprocessor tasks with prespecified processor allocations', Discrete Applied Mathematics, 55; 259-272, 1994
  14. Kim, Y.K., Kim, J.Y., and Kang, S.S.; 'A Tabu Search Approach for Designing a Non-Hierarchical Video-on-Demand Network Architecture', Computers ind. Engng., 33(3-4); 837-840, 1997
  15. Kramer, A.; 'Branch and Bound method for scheduling problems of multiprocessor tasks on Dedicated Processors', Ph.D. dissertation, Department of Mathematics/Informatics, Universitat Osnabruck. 1995
  16. Oguz, C., Y. Zinder, V.H. Do, A. Janiak, and M. Lichtenstein; 'Hybrid flow-shop scheduling problems with multiprocessor task systems', European Journal of Operational Research, 152; 115-131, 2004
  17. Veltmann, B., B.J. Lageweg, and J.K. Lenstra; 'Multiprocessor Scheduling with Communication Delays'. Parallel Computing, 16; 173-182, 1990