Browse > Article

A Scheduling Scheme for Restricted Parallel Machines with Cycling Process  

Ko, Hyo-Heon (Department of Industrial Systems and Information Engineering, Korea University)
Baek, Jong-Kwan (Department of Industrial System Management, Seoil College)
Kang, Yong-Ha (Department of Industrial Systems and Information Engineering, Korea University)
Kim, Sung-Shick (Department of Industrial Systems and Information Engineering, Korea University)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.30, no.2, 2004 , pp. 107-119 More about this Journal
Abstract
A study on the following parallel machine problem is addressed in this research. An order is completed only when a given number of processes (cycle) are repeated. Anew cycle is possible only upon the completion of the previous cycle. Orders are classified into job group according to product feature. For a machine to switch to a different job group from the currently processing one a major setup is required while a minor setup time is inserted in between two jobs of the same job group. The objective of the study is to find a schedule that minimizes total weighted tardiness. An initial solution is obtained by the RATCS(Restricted Apparent Tardiness Cost with Setup) rule, and a Tabu search is applied to improve the solution. Numerical examples are also presented.
Keywords
parallel machines; cycling process; restricted tools; sequence dependent major and minor setup;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Bitran, G. R. and Gilbert, S. M.(1990), "Sequencing Production on Parallel Machine with Two Magnitudes of Sequence-dependant Setup Cost", Journal of' Manufacturing and Operations Management, 3, 190-206
2 Islam A. and Eksioglu, M.(1997), "A tabu search approach for the single-machine mean tardiness problem," Journal of the Operational Research Society, 48(7),751-755   DOI   ScienceOn
3 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
4 Lee, Y. H., Bhaskran, K. and Pinedo, M.(1997), "A heuristic to minimize the total weighted tardiness with sequence-dependent setups,"IIE Transactions, 29,45-52
5 Schutten.T, M. J. and Leussink, R. A. M.(1996), "Parallel machine scheduling with release dates, due dates and family setup times," International Journal of Production Economics, 46, 119-126
6 Shin H.-J., Kim S. S. and Ko K. S.(2001), "A Tabu Search Algorithm for single machines scheduling Problem with Job Release Times and Sequence-dependent Set up Times" Journal ofkorean Institute of Industrial Engineering, 27 , 2, 158-168
7 Tang, C. S. and Wittrock R. J.(1985), "Parallel machines scheduling with major and minor setups", York Town Heights, NY, RC 11412 IBM TJ Watson Research Center
8 Vepsalainen, A. and Morton, T. E.(1987), "Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs," Management Science, 33, 1036-1047
9 Baker, K. R. and Su, Z. S.(1974), "Sequencing with due-dates and early start times to minimize maximum tardiness", Naval Research Logistics Quarterly,21, 171-176
10 James, R. J. W.(1997), "Using tabu search to solve the commondue date early/tardy machine scheduling problem," Computers and Operations research, 24(3), 199-208   DOI   ScienceOn
11 Garey, M. R. and Johnson, D. S.(1979), Computers and intractability: A guide to the theory ofNP completeness, San Francisco
12 Eom, D-H., Shin, H-J., Kwun, I-H., Shim J-K., and Kim, S-S.(2002), "Scheduling Jobs on Parallel Machines with Sequence Dependent Family Set-up Times", International Journal of Advanced Manufacturing Technology, 19, 926-932
13 Kim, S. Y., Lee Y. H. and Agnihotri, O.(1995), "A hybrid approach to sequencing jobs using heuristic rules and neural networks," Production Planning& Control, 6, 445-454
14 Monma, C, and Potts. C. N.(1994), "Analysis of huristic for preemptive parallel machine scheduling with batch setup times," Operation Research, 32, 1243-1263
15 Raman, N., Rachamadugu, R. V. and Talbot, F. B.(1989), "Realtime scheduling on an automated machine center," European Journal of Operational Research, 40, 222-242
16 Lee, Y. H. and Pinedo, M.(1997), "Scheduling jobs on parallel machines with sequence-dependent setup times," European Journal of Operations Research, 100, 464-474
17 Laguna, M., Barnes, J. W. and Glover, F.(1991), "Tabu search methods for single machine scheduling problem," Journal of Intelligent Manufacturing, 2, 63-74
18 So K. C.(1990), "Some heuristics for scheduling jobs on parallel machines with setup," Management Science, 36, 467-475
19 Tang, C. S.(1990), "Scheduling batches on parallel machines with major and minor setups," European Journal of Operation Research, 46,28-3