Job shop scheduling techniques in semiconductor manufacturing

Abstract

This paper presents a brief review on job shop scheduling techniques in semiconductor manufacturing. The manufacturing environment in a semiconductor industry is considered a highly complex job shop, involving multiple types of work centers, large and changing varieties of products, sequencedependent setup times, reentrant process flow, etc., in a dynamic scheduling environment. Due to the stubborn nature of the deterministic job shop scheduling problem itself, many of the solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been investigated from a variety of perspectives resulting in several analytical techniques combining generic as well as problem-specific strategies. In this paper, we seek to provide a brief overview of the problem, the techniques used and the researchers involved in solving this problem.

Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study

“…In the manufacturing world, scheduling problems are extensively implementing the dispatching rules. The procedures designed to provide good solutions to complex problems in a real-time production environment [6]. Most of the previous researchers, until this current time, are using dispatching rules to optimize the job-shop scheduling problem [6], [7], [9], and [11].…”

“…The procedures designed to provide good solutions to complex problems in a real-time production environment [6]. Most of the previous researchers, until this current time, are using dispatching rules to optimize the job-shop scheduling problem [6], [7], [9], and [11]. Impacts generated by the dispatching procedure in the queuing networks are very difficult to be explained using analytical techniques [8].…”

A simulation module for supporting the manufacture of high value added electronics manufacturing

“…Different methods have been explored in the dynamic job shop scheduling literature (refer to review papers [8,9] for examples) aiming to solve this problem. The proposed techniques can be classified as dispatching rules, mathematical methods, neighbourhood search methods and artificial intelligence techniques.…”

“…The proposed techniques can be classified as dispatching rules, mathematical methods, neighbourhood search methods and artificial intelligence techniques. All of these categories are characterised by different advantages and drawbacks [8]. Some of them require little effort to implement making them practical for industry to apply, but oversimplify the problem (e.g.…”

“…Later on Mignon, et al proposed in [7] a simulation engine to evaluate the impact of uncertainty on different schedule strategies. The simulation engine consists of a Monte-Carlo simulation and the simulation software BATCHES [8]. The authors proposed two meaningful metrics for the evaluation of scheduling strategies in uncertain systems i.e.…”