Elsevier

CIRP Annals

Volume 61, Issue 1, 2012, Pages 467-470
CIRP Annals

A proposal on optimized scheduling methodology and its application to an actual-scale semiconductor manufacturing problem

https://doi.org/10.1016/j.cirp.2012.03.077Get rights and content

Abstract

Semiconductor manufacturing process flows typically include several hundred process steps, using hundreds of machines repeatedly. The production schedule for such a re-entrant flexible flow shop is extremely difficult to be optimized. Furthermore, in recent years, it has become increasingly difficult to use machines effectively because of the product mix increase and also the production lot size decrease. In this paper we apply the well-known cooperative scheduling method, Lagrangian Decomposition and Coordination method, into an actual large scale model in semiconductor manufacturing. Then we show that the proposed method successfully creates a well-performed production schedule as we expected.

Introduction

After the late 1990s, because of the emergence of new business models such as foundry companies in Taiwan and fab-less companies in the U.S., the Japanese semiconductor industry has shifted from low-mix high-volume memory production to high-mix low-volume microcomputer production. Therefore, delivery has come to pose a key challenge that must be solved continuously from the perspective of non-price competitiveness.

However, because semiconductor manufacturing process flows typically comprise hundreds of processing steps using hundreds of machines repeatedly, the production schedule of such a re-entrant flexible flow shop is extremely difficult to optimize. Furthermore, in recent years, it has become increasingly difficult to use machines effectively because product mixes have become much more complex and production lots have become much smaller. Consequently, the number of scheduled jobs has increased dramatically. Therefore, it is indispensable to integrate various scheduling methods into the solution to achieve high productivity. Such methods include flexible lot batching, finely tuned lot dispatching, and adaptability to large-scale models performing comprehensive production-line control [1].

Previous studies have assessed many methods to improve productivity through lot dispatching methods. One proposal specifically examines only aspects of the production process [2]. Another provides decision-making support [3] to improve productivity solely through the production capacity enhancement. Nevertheless, they have not brought comprehensive optimization.

Lagrangian Decomposition and Coordination method, a cooperative scheduling method, was developed by Luh and Hoitomt [4] for a parallel machine scheduling problem. They extended it to a job shop model [5]. Nishi et al. applied this method successfully to a flow shop model [6]. Jiang and Tang [7] applied it into the re-entrant flexible flow shop model such as a semiconductor manufacturing process and demonstrated its effectiveness for a small scale model. However, they left challenges for the large-scale problem. Furthermore, the authors’ previous research [8] was applied to semiconductor production systems, but the objective was to create a schedule capable of facilitating proper maintenance in a small scale model.

For this study, we apply a well-known cooperative scheduling method, Lagrangian Decomposition and Coordination method, to an abstracted small scheduling model based on an actual semiconductor production line. Thereby we verify that the proposed method can create a production schedule effectively. We also verify the effectiveness of the proposed method's application to larger models and clarify issues related to its application to an actual large-scale model.

Section snippets

Objective system

A re-entrant flexible flow shop production system, which uses the same machine in different processing steps repeatedly, is shown in Fig. 1. Most processes in this system have alternative available machines.

The problem examined in this paper is minimization of the total tardiness of each job, where the number of jobs is I. The re-entrant flexible flow-shop includes M machines.

Nomenclature

The following symbols are used for this study.

Di: tardiness of job i
ι: number of job (i = 1,2,…, I)
j: number of processing

Experimental conditions

We prepared three job types based on the re-entrant flexible flow shop model depicted in Fig. 1. Experimental job process flow of each job type is described in Table 1.

For example, job type 1 has four consecutive processing steps (2, 1, 3, 1), which are processed three times repeatedly. Furthermore, the third processing step has five machines in Fig. 1, but only three machines are available in this processing step of job type 1. Job type 3 with short process flow corresponds to R&D lots in

Conclusion

This study verified the practical effectiveness of the proposed method, not only for a small scale model, but also for a large scale model through comparison with the traditional dispatching method. Computational experiments showed that the proposed method can create a production schedule for a wide range of models related to the number of machines and jobs.

The calculation time, an important index for application of the proposed method to an actual production line for optimizing production

References (8)

There are more references available in the full text version of this article.

Cited by (10)

View all citing articles on Scopus
View full text