IE interfaces (산업공학)

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

An Algorithm Design and Information System Development for Production Scheduling under Make-to-Order Environments

수주생산환경에서 생산일정계획 알고리듬 설계 및 정보 시스템 구현: 변압기 제조공정의 권선공정 적용사례

  • Received : 20030100
  • Accepted : 20030500
  • Published : 2003.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper deals with a realistic production scheduling under a make-to-order production environment. The practical case is studied on the transformer winding process in the 'H' company. The transformer winding is a process that rolls a coil that is coated with an electric insulation material in order to generate the required voltage using the voltage fluctuation. This process occupies an important position among the production processes in the transformer manufacturing company. And this process is composed of parallel machines with different performances according to the voltage capacity and winding type. In this paper, we propose a practical heuristic algorithm for production scheduling to satisfy the customer’s due date under a make-to-order production environment. Also, we implement the production scheduling system based on the proposed heuristic algorithm. Consequently, the proposed heuristic algorithm and the implemented production scheduling system are currently working in the transformer production factory of the ‘H’ company.

Keywords

References

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