A survey of dispatching rules for operational control in wafer fabrication

Family-based dispatching heuristics aim for improving job flow times by reducing time spent on set-ups. They realise set-up efficiencies by batching similar types of jobs. By their intuitiveness and the simplicity of their decision logic, they may contribute to an easy to implement and viable strategy in many practical settings. Similar to common dispatching rules most existing family-based dispatching heuristics are myopic, i.e. their decision scope is restricted to a single manufacturing stage. Hence, they neglect opportunities for improving shop performance by coordinating batching decisions with other manufacturing stages. Case examples from industry underpin the need for exploring these opportunities. We do so by studying a simple two-stage flow shop, entailing a serial and a batch stage. To facilitate shop coordination we propose extensions to existing family-based dispatching heuristics. Extended heuristics seek to further increase set-up efficiencies by allowing for upstream job re-sequencing, and pro-active set-ups, i.e. set-ups that may be initiated prior to the arrival of a job. Outcomes of an extensive simulation study indicate significant performance gains for extended heuristics vs. existing heuristics. Performance gains are largest for moderate and high set-up to run-time ratios.

“…See Blackstone, Phillips, and Hogg (1982), Jayamohan and Rajendran (2000), Mizrak and Bayhan (2006), and Sarin, Varadarajan, and Wang (2011) for overviews.…”

Section: Literature Reviewmentioning

confidence: 99%

Coordinating batching decisions in manufacturing networks

Zee

2017

“…The job with the highest priority is chosen as the imminent processing job and processed immediately. As for a systematical review of dispatching rules, readers could refer to Sarin, Varadarajan, and Wang (2011).…”

Section: Dispatching Rulesmentioning

confidence: 99%

“…It tries to allocate the limited resources to the most desirable job and makes each job finished on time. The evolution of dispatching rules (Sarin, Varadarajan, and Wang 2011) implies that extensive attention is paid to the upstream and downstream information within the wafer fab.…”

Section: Dispatching Rulesmentioning

confidence: 99%

“…The two-dimensional dispatching means that, at each dispatching decision-making point, we should not only focus on the next processing job (job dimension) but also its start time (time dimension). Note that all the existing dispatching rules (Sarin, Varadarajan, and Wang 2011) choose the job assigned the highest priority to be processed as soon as a machine becomes idle. Their dispatching decisions are one-dimensional (job dimension).…”

Section: Dispatching Rulesmentioning

confidence: 99%

See 1 more Smart Citation

API-based two-dimensional dispatching decision-making approach for semiconductor wafer fabrication with operation due date–related objectives

Jiang

Jia

2016

This paper presents an adjacent pairwise interchanges (API)-based two-dimensional dispatching decision-making approach for semiconductor wafer fabrication with operation due date-related objectives. Each time when a machine becomes idle, the proposed dispatcher chooses a target processing job from the competing jobs and assigns it a start time. Giving the operation due date information of each competing job, we formulate this dispatcher as the mean absolute deviation problem to keep the jobs finished around their operation due dates in a proactive way. Dominance properties of this problem are established using proof by APIs. Then, a heuristic comprised of job selection within candidate set, movement of job cluster and local search is designed to solve this problem more efficiently. Numerical experiments validate the efficiency of the proposed heuristic in a single-machine environment as well as in a simulated wafer fab abstracted from practice. In comparison with four most referenced due date-related dispatching rules, the simulation study reveals the benefits brought by the two-dimensional dispatching decision with different due date tightness taken into account.

“…There are several concepts available for shop floor control, such as first-in-first-out and earliest due date (EDD) (Su and Shiue 2003;Wang et al 2009;Sarin, Varadarajan, and Wang 2011), which contain rules on how orders should be processed in a production system. But the effectiveness of these concepts depends on the type of production system used.…”

Section: Introductionmentioning

confidence: 99%

Comparing concepts for shop floor control of information-processing services in a job shop setting: a case from the financial services sector

Leyer

Moormann

2014

Controlling information-based service processes in the short term is a major challenge. Within these processes, information is collected, generated and transformed while customers are directly involved. Typically, such processes are characterised by a job shop layout that increases complexity relating to shop floor control. In contrast to manufacturing, such settings have rarely been addressed in the literature to date. This is surprising, as information-processing services exist in every industry. Thus, evidence about the impact of concepts for shop floor control in such pure service environments is needed. As a case study, we use one of the most intense information-processing industries -the financial services sector. A simulation model is built using process mining as a novel approach to gather a major part of the relevant data from business information systems. We identify nine concepts for shop floor control and simulate the usage of these in six scenarios. The results show that the concept that prioritises customer orders with the longest expected processing time is superior in cycle time over all six scenarios. The application of this concept leads to a reduction of the average cycle time of almost 50% in the case study.