• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.2
• /
• pp.107-119
• /
• 2004

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.