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

  • 제29권2호
  • /
  • Pages.7-12
  • /
  • 2006
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

병렬기계에서의 스케쥴링에 관한 연구

Uniform Parallel Machine Scheduling

  • 김대철 (한양대학교 경영대학 경영학부)
  • 발행 : 2006.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This study considers the problem of scheduling jobs on uniform parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing is bottleneck and the processing speeds of parallel machines in this phase are uniformly different for all jobs. Optimal properties are proved and a simple polynomial time optimal algorithm is developed.

키워드

참고문헌

  1. Baker, K. R., Introduction to Sequencing and Scheduling, N.Y., John Wiley, 1974
  2. Baker, K. R. and Scudder, G. D., 'Sequencing with Earliness and Tardiness Penalties: A Review,' Operations Research, 38 : 22-36, 1990 https://doi.org/10.1287/opre.38.1.22
  3. 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, 47 : 271-292, 1990 https://doi.org/10.1016/0377-2217(90)90215-W
  4. Hall, N. G., 'Single- and Multi-Processor Models for Minimizing Completion Time Variance,' Naval Res. Logist. Quart., 33 : 49-54, 1986 https://doi.org/10.1002/nav.3800330105
  5. Kanet, J. J., 'Minimizing the Average Deviation of Job Completion Times about a Common Due Date,' Naval Research Logistics Quarterly, 28 : 643-651, 1981 https://doi.org/10.1002/nav.3800280411
  6. Martello, S., Soumis, F., and Toth, P., 'Exact and approximation algorithms for makespan minimization on unrelated parallel machines,' Discrete Applied Mathematics, 75 : 169-188, 1977 https://doi.org/10.1016/S0166-218X(96)00087-X
  7. Palekar, U. S., Rama, N., and Toaffe, K., 'Duality based relaxations for makespan minimization for unrelated parallel machines,' TIMS/ORSA Bulletin, 31 (MC2.2) : 21, 1991
  8. Piersma, N. and Van Dijk, W., 'A local search heuristics for unrelated parallel machine scheduling with efficient neighborhood search,' Mathematical Computer Modelling, 24(9) : 11-19, 1996
  9. Pinedo, M. and Pinedo, M., Scheduling: Theory, Algorithm, and Systems, Englewood Cliffs, N.J., Prentice Hall, 1995
  10. Sundararaghavan, P. and Ahmed, M., 'Minimizing the Sum of Lateness in Single-Machine and Multimachine Scheduling,' Naval Res. Logist. Quart., 31 : 325-333, 1984 https://doi.org/10.1002/nav.3800310214
  11. Ventura, J. and Kim, D., 'Parallel Machine Scheduling about an Unrestricted Due Date and Resource Constraints,' IIE Transactions, 32(2) : 147-153, 2000
  12. Ventura, J. and Kim, D., 'Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints,' Computers & OR, 30 : 1945-1958, 2003 https://doi.org/10.1016/S0305-0548(02)00118-1
  13. Yu, L., Smith, H. M., Pfund, M., Carlyle, W. M., and Fowler, J. W., 'Scheduling of unrelated parallel machines: an application to PWB manufacturing,' IIE Transactions, 34 : 921-931, 2002