Journal of the Korea Management Engineers Society (한국경영공학회지)

Korea Management Engineers Society (한국경영공학회)
권호 표지

A Production Scheduling Scheme for Minimizing Subcontract and Tardy Costs

외주 비용과 납기지연 비용을 고려한 일정계획 수립 방안

  • 임종호 (언스트앤영 어드바이저리(주)) ;
  • 권익현 (인제대학교 시스템경영공학과)
  • Published : 2012.07.31
⟨ Previous Next ⟩

Abstract

This paper addresses production scheduling algorithm for plastic extrusion factories. A plastic extrusion factory usually consists of two work centers called extrusion shop and assembly line. A great portion of jobs requires plating process, and the jobs requiring plating are sent to outside for the process and then brought back into the factory. Each incoming job has its own due-date, and a delay in meeting the due-date incurs penalty cost. If a job is sent to a company outside of the factory for extrusion operation, it is guaranteed that the operation is completed within promised time frame, but this procedure requires subcontract cost. The objective of the study is to minimize sum of subcontract and penalty costs for a given set of jobs. In this paper, a two-phased algorithm is proposed to solve the problem. First, adopting the rolling horizon procedure, it decomposes jobs into time windows to generate subproblems. Then each of sub-problem is solved by sequencing jobs in the subset utilizing the effective priority rule. We conduct various experiments to show the efficiency and the practicality of the proposed algorithm.

Keywords

References

  1. 백종관, 김영호, 김성식 (1999), 플라스틱 사출 공장용 실시간 생산계획 및 통제시스템 개발, IE Interfaces, 12(2), 254-265.
  2. Adams, J., Balas, E. and Zawack, D. (1998), The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, 34(3), 391-401.
  3. Carlier, J. (1982), The One-machine Sequencing Problem, European Journal of Operational Research, 11, 42-47. https://doi.org/10.1016/S0377-2217(82)80007-6
  4. Cheng, T. E. C and Sin, C. C. S. (1990), A State-of-the-art Review of Parallel Machine Scheduling Research, European Journal of Operational Research, 47, 271-292. https://doi.org/10.1016/0377-2217(90)90215-W
  5. Fox, M. S. and Smith, S. F. (1984), ISIS: A Knowledge-Based System for Factory Scheduling, Expert Systems, 1(1), 25-49. https://doi.org/10.1111/j.1468-0394.1984.tb00424.x
  6. Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company.
  7. Harri, A. M. A. and Potts, C. N. (1991), Heuristic for Scheduling Unrelated Parallel Machines, Computers & Operations Research, 18, 323-331. https://doi.org/10.1016/0305-0548(91)90034-O
  8. Karp, R. M. (1972), Reducibility among Combinational Problems: Complexity of Computer Computations, Plenum Press.
  9. Mokotoff, E. (2001), Parallel Machine Scheduling Problems: A Survey, Asia-Pacific Journal of Operational Research, 18, 193-242.
  10. Nahmias, S. (2009), Production and Operations Analysis, McGraw-Hill.
  11. Ovacik, I. M. and Uzsoy, R. (1997), Decomposition Methods for Complex Factory Scheduling Problems, Kluwer Academic Publishers.
  12. Pinedo, M. L. (2008), Scheduling: Theory, Algorithms, and Systems, Springer.
  13. Smith, S. F. (1994), OPIS: A Methodology and Architecture for Reactive Scheduling, Intelligent Scheduling (Eds. Zweben, M. and Fox, M. S.), Morgan Kaufmann Publishers.