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

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

Unrelated Parallel Machine Scheduling for PCB Manufacturing

병렬기계로 구성된 인쇄회로기판 제조공정에서의 스케쥴링에 관한 연구

  • Kim Dae-Cheol (School of Business Chungbuk National University)
  • 김대철 (충북대학교 경영대학 경영학부)
  • Published : 2004.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

This research considers the problem of scheduling jobs on unrelated 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 and other production systems is bottleneck and the processing speeds of parallel machines in this phase are different for each job. A zero-one integer programming formulation is presented and two dominance properties are proved. By these dominance properties, it is shown that the problem is reduced to asymmetric assignment problem and is solvable in polynomial time.

Keywords

References

  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, pp. 22-36, 1990
  3. Bertsekas, D.P., Linear Network Optimization, Algorithms and Codes. MIT Press, Cambridge, Mass. 1991
  4. Kanet, J.J., 'Minimizing the Average Deviation of Job Completion Times about a Common Due Date.' Naval Research Logistics Quarterly, 28, pp. 643-651, 1981
  5. Kuhn, N.W., 'The Hungarian Method for the Assignment Problem.' Naval Research Logistics Quarterly, 2, pp. 83-97, 1955
  6. Martello, S., Soumis, F. and Toth, P., 'Exact and approximation algorithms for makespan minimization on unrelated parallel machines,' Discrete Applied Mathematics, 75, pp. 169-188, 1977
  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), pp. 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), pp. 11-19, 1996
  9. 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, pp. 921- 931, 2002