Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

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

Scheduling Algorithm for Nonidentical Parallel Machines Problem with Rework

Rework가 존재하는 이종병렬기계에서의 일정계획 수립

  • Kang, Yong Ha (Division of Information Management Engineering, Korea University) ;
  • Kim, Sung Shick (Division of Information Management Engineering, Korea University) ;
  • Park, Jong Hyuck (Division of Information Management Engineering, Korea University) ;
  • Shin, Hyun Joon (Department of Industrial Information and Systems Engineering, Sangmyung University)
  • 강용하 (고려대학교 정보경영공학부) ;
  • 김성식 (고려대학교 정보경영공학부) ;
  • 박종혁 (고려대학교 정보경영공학부) ;
  • 신현준 (상명대학교 산업정보시스템공학과)
  • Published : 2007.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.

Keywords

References

  1. Demirkov, E. and Uzsoy, R. (2000), Decomposition methods for reentrant flow shops with sequence-dependent setup times, Journal of Scheduling, 3,155-177 https://doi.org/10.1002/(SICI)1099-1425(200005/06)3:3<155::AID-JOS39>3.0.CO;2-E
  2. Flapper, S. D. P., Fransoo, J. C., Broekmeulen, R. A. C. M., and Inderfurth, K. (2002), Planning and control of rework in the process industries: review, Production Planning & Control, 13(1), 26-34 https://doi.org/10.1080/09537280110061548
  3. Flapper, S. D. P. and Teunter, R. H. (2004), Logistic planning of rework with deteriorating work in process, International Journal of Production Economics, 88, 51-59 https://doi.org/10.1016/S0925-5273(03)00130-0
  4. Kang, Y. H. (2003), A scheduling scheme for parallel machines where jobs demand repetitive processing, a thesis for a master degree, Dept. of I.E., Korea Univ
  5. Kim, C. O. and Shin, H. J. (2003), Scheduling Jobs on Parallel Machines: A Restricted Tabu Search Approach, International Journal of Advanced Manufacturing Technology, 22(3-4), 278-287 https://doi.org/10.1007/s00170-002-1472-2
  6. Kim, S. C. and Bobrowski, P. M. (1994), Impact on sequence-dependent setup time on job shop scheduling performance, International Journal of Production Research, 32(7), 1503- 1520 https://doi.org/10.1080/00207549408957019
  7. Kuhl, M. E. and Laubisch, G. R. (2004), A simulation study of dispatching rules and rework strategies in semiconductor manufacturing, IEEE/SEMI Advanced Semiconductor Manufacturing Conference
  8. Lee, D. H., Ko, H. H., and Kim, S. S. (2005), A study of strategy for planning of rework in semoconductor monitoring burn in test process, IE interfaces, 18(3), 350-360
  9. Lee, Y. H., Bhaskran, K., and Pinedo, M.(1997), A heuristic to minimize the total weighted tardiness with sequence-dependent setups, lIE Transactions, 29, 45-52
  10. Lee, Y. H. and Pinedo, M. (1997), Scheduling jobs on parallel machines with sequence-dependent setup times, European Journal of Operational Research, 100(3), 464-474 https://doi.org/10.1016/S0377-2217(95)00376-2
  11. Liu, J. J. and Ping, Y. (1996), Optimal lot-sizing in an imperfect production system with homogeneous reworkable jobs, European Journal of Operational Research, 91(3), 517-527 https://doi.org/10.1016/0377-2217(94)00339-4
  12. Park, Y. S., Kim, S. Y., and Lee, Y. H. (2000), Scheduling Jobs on Parallel Machines Applying Neural Network and Heuristic Rules, Computers & Industrial Engineering, 38, 189-202 https://doi.org/10.1016/S0360-8352(00)00038-3
  13. Sha, D. Y., Hsu, S. Y., Che, Z. H., and Chen, C. H. (2006), 'A dispatching rule for photolithography scheduling with an online rework strategy', Computers & Industrial Engineering, 50, 233-247 https://doi.org/10.1016/j.cie.2006.04.002
  14. Shin, H. J., Kim, C. O., and Kim, S. S. (2002), A tabu search for a single machine scheduling with release times, due dates and sequence-dependent setup times, International Journal of Advanced Manufacturing Technology. 19,859-866 https://doi.org/10.1007/s001700200097
  15. So, K. C., Tang, C. S. (1995), Optimal operating policy for a bottleneck with random rework, Management Science, 41(4), 620-636 https://doi.org/10.1287/mnsc.41.4.620
  16. Teunter, R. H. and Flapper, S. D. P. (2003), Lot-sizing for a single-product production system with rework of perishable production defectives, OR Spectrum, 25, 85-96 https://doi.org/10.1007/s00291-002-0105-3
  17. Uzsoy, R., Lee, C. Y. and Martin-Vega, L. A. (1992), A review of product planning and scheduling models in the semiconductor industry Part I : Systems characteristics, performance evaluation and production planning, lIE Transaction on Scheduling and Logistics, 24(4),47-60.
  18. Uzsoy, R, Lee, C. Y. and Martin-Vega, L. A. (1994), A review of product planning and scheduling models in the semiconductor industry Part II : Shop-floor control, lIE Transaction on Scheduling and Logistics, 26(5), 44-55
  19. Zargar, A. M. (1995), Effect Of Rework Strategies On Cycle Time, Computers & Industrial Engineering, 29(1/4),239-243 https://doi.org/10.1016/0360-8352(95)00078-F