Browse > Article

Scheduling Algorithm for Nonidentical Parallel Machines Problem with 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)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.33, no.3, 2007 , pp. 329-338 More about this Journal
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
Rework probability; Nonidentical Parallel Machines; Scheduling; Dispatching Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Demirkov, E. and Uzsoy, R. (2000), Decomposition methods for reentrant flow shops with sequence-dependent setup times, Journal of Scheduling, 3,155-177   DOI   ScienceOn
2 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
3 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   DOI   ScienceOn
4 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.
5 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   DOI   ScienceOn
6 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
7 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
8 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   DOI   ScienceOn
9 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   DOI   ScienceOn
10 Zargar, A. M. (1995), Effect Of Rework Strategies On Cycle Time, Computers & Industrial Engineering, 29(1/4),239-243   DOI   ScienceOn
11 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
12 So, K. C., Tang, C. S. (1995), Optimal operating policy for a bottleneck with random rework, Management Science, 41(4), 620-636   DOI   ScienceOn
13 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
14 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   DOI   ScienceOn
15 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   DOI   ScienceOn
16 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   DOI   ScienceOn
17 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   DOI   ScienceOn
18 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   DOI   ScienceOn
19 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   DOI   ScienceOn