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

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

Minimizing Weighted Tardiness using Decomposition Method

분할법을 이용한 가중납기지연 최소화 문제

  • Byeon, Eui-Seok (Department of Knowledge & Industrial Engineering, Sun Moon University) ;
  • Hong, Sung-Wook (Department of Business Administration, Halla University)
  • 변의석 (선문대학교 지식정보산업공학과) ;
  • 홍성욱 (한라대학교 경영학과)
  • Published : 2006.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

Exact solutions for practical-size problems in job shop will be highly inefficient. Scheduling heuristics, therefore, are typically found in the literature. If we consider real-life situations such as machine breakdowns, the existing scheduling methods will be even more limited. Scheduling against due-dates addresses one of the most critical issues in modern manufacturing systems. In this paper, the method for weighted tardiness schedule using a graph theoretic decomposition heuristic is presented. It outstands the efficiency of computation as well as the robustness of the schedule.

Keywords

References

  1. Adams. J., Balas, E. and Zawack, D. (1988), The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Science, 34, 391-401 https://doi.org/10.1287/mnsc.34.3.391
  2. Applegate, D. and Cook, W. (1991), A Computational Study of the Job-Shop scheduling Problem, ORSA Journal on Computing, 3, 149-156 https://doi.org/10.1287/ijoc.3.2.149
  3. Baker, K. and Kanet, J. (1983), Job Shop Scheduling with Modified Due Dates, Journal of Operations Management, 4, 11-22 https://doi.org/10.1016/0272-6963(83)90022-0
  4. Balas, E. (1979), Disjunctive Programming, Annals of Discrete Mathematics, 5, 3-51 https://doi.org/10.1016/S0167-5060(08)70342-X
  5. Bean, J., Birge, J., Mittentha1, J. and Noon, C. (1991), Matchup Scheduling with Multiple Resources, Release Dates and Disruptions, Operations Research, 39, 470-481 https://doi.org/10.1287/opre.39.3.470
  6. Kim, D. (2004), Unrelated Parallel Machine Scheduling for PCB Manufacturing, Journal of the Society of Korea Industrial and Systems Engineering, 27, 141-146
  7. Kong, M. and Kim, J. (2000), A Heuristic Algorithm for Resource Constrained Multi-Project Scheduling, IE Interfaces, 13, 110-119
  8. Lawler, E. (1977), A 'Pseudopolynomial' Algorithm for Sequencing Jobs to Minimize Total Tardiness, Annals of Discrete Mathematics, 1, 331-342 https://doi.org/10.1016/S0167-5060(08)70742-8
  9. Lawrence, S. and Morton, T. (1993), Resource Constrained Multi-Project Scheduling with Tardy Costs: Comparing Myopic, Bottleneck, and Resource Pricing Heuristics,' European Journal of Operational Research, 64, 168-187 https://doi.org/10.1016/0377-2217(93)90175-M
  10. Morton, T., Lawrence, S., Rajagopalan, S. and Kerke, S. (1988), SCHED-STAR: A Price-Based Shop Scheduling Module, Journal of Manufacturing and Operations Management, 1, 131-18l
  11. Potts, C. and van Wassenhove, L. (1982), A Decomposition Algorithm for the Single Machine Total Tardiness Problem, Operations Research Letters, 1, 177-181 https://doi.org/10.1016/0167-6377(82)90035-9
  12. Pritsker, A. and Watters, L. (1968), A Zero-One Programming Approach to Scheduling with Limited Resources, The RAND Corporation, RM-5561-PR
  13. Ross, G. and Soland, R. (1975), A Branch and Bound Algorithm for the Generalized Assignment Problem, Mathematical Programming, 8, 91-103 https://doi.org/10.1007/BF01580430
  14. Roundy, R., Maxwell, Y., Herer, S. and Getzler, A. (1991), A Price-Directed Approach to Real Time Scheduling of Production Operations, IIE Transaction, 23, 149-160 https://doi.org/10.1080/07408179108963850
  15. Sidney, J. (1975), Decomposition Algorithms for Single Machine Sequencing with Precedence Relations and Deferral Costs, Operations Research, 23, 283-298 https://doi.org/10.1287/opre.23.2.283
  16. Ullman, J. (1975), NP-Complete Scheduling Problems, Journal of Computers and Systems Science, 10, 384-391 https://doi.org/10.1016/S0022-0000(75)80008-0
  17. Vepsalainen, A. and Morton, T. (1987), Priority Rules for Job Shops with Weighted Tardy Costs, Management Science, 33, 95-103 https://doi.org/10.1287/mnsc.33.1.95