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

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

A Heuristic Scheduling Algorithm for Transformer Winding Process with Non-identical Parallel Machines

이종병렬기계로 구성된 변압기 권선공정의 생산일정계획

  • Published : 2003.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes a heuristic scheduling algorithm to satisfy the customer's due date in the production process under make to order environment. The goal is to achieve the machine scheduling in the transformer winding process, in which consists of parallel machines with different machine performances. The winding is important production process in the transformer manufacturing company. The efficiency of the winding machines is different according to the voltage capacity and the winding type. This paper introduces a heuristic approach in the transformer winding process where the objective function is to minimize the total tardiness of jobs over due dates. The numerical experiment is illustrated to evaluate the performance.

Keywords

References

  1. Chen, Z-L., 'Scheduling with batch setup times and earliness-tardiness penalties', European Journal of Operational Research, 96 : 518-537, 1997
  2. Dagramici, A. and Surkis, J., 'Scheduling Independent Jobs on Parallel Identical Processor', Management Science, 25(12) ; 846-857, 1979
  3. Dorit, S. H and Dan. L., 'Scheduling with batching : minimizing the weight number of tardy jobs', Operations Research Letters, 16(2) : 79-86, 1994 https://doi.org/10.1016/0167-6377(94)90063-9
  4. Guinet, A., 'Textile Production Systems, A Succession of Non-identical Parallel Processor Systems', Journal of the Operational Research Society, 13 : 330-348, 1988
  5. Hariri, A. M. and Potts, C. N., 'Heuristics for Scheduling Unrelated Parallel Machine', Computers and Operations Research, 18(3) : 323-331, 1991
  6. Ibarra, O. H, and Kim, C. E., 'Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors', Journal of ACM, 24(2), 280-289, 1977
  7. Kanet, J. J. and Balakrishnan, N., 'Early/Tardy scheduling with sequence dependent setups on uniform parallel machines', Computer and Operations Research, 26 ; 127-141, 1999
  8. Karp, R. M., 'Reducibility among Combinatorial Problems', Complexity of Computations(Edited by R. E. Miller and 1. W. Thatcher), Plenum Press, NewYork, pp. 85-103, 1972
  9. Kise, H., Ibaraki, T. and Mine, H., 'A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times'. Operations Research, 26(1) :121-126, 1978
  10. Wilkerson, J. L. and Irwin, J. D., 'An Improved Method for Scheduling Independent Tasks', AIlE Transactions, 3(3) ; 239-245, 1971
  11. Zdrzalka, S., 'Preemptive scheduling with release dates, delivery times and sequence independent setup times', European Journal of Operational Research, 7 6 ; 60-71. 1994