✦ LIBER ✦

A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops

✍ Scribed by Scott J. Mason; John W. Fowler; W. Matthew Carlyle

Publisher: Springer US
Year: 2002
Tongue: English
Weight: 138 KB
Volume: 5
Category: Article
ISSN: 1094-6136
DOI: 10.1002/jos.102

No coin nor oath required. For personal study only.

✦ Synopsis

Increases in the demand for integrated circuits have highlighted the importance of meeting customer quality and on-time delivery expectations in the semiconductor industry. A modiÿed shifting bottleneck heuristic is developed for minimizing the total weighted tardiness in a semiconductor wafer fabrication facility. This 'complex' job shop is characterized by re-entrant or re-circulating product ow through a number of di erent tool groups (one or more machines operating in parallel). These tool groups typically contain batching machines, as well as machines that are subject to sequence-dependent setups. The disjunctive graph of the complex job shop is presented, along with a description of the proposed heuristic. Preliminary results indicate the heuristic's potential for promoting on-time deliveries by semiconductor manufacturers for their customers' orders.

📜 SIMILAR VOLUMES

A shifting bottleneck heuristic for mini

A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop

✍ Michael Pinedo; Marcos Singer 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 2 views

We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single-machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem.

Heuristics for minimizing total weighted

Heuristics for minimizing total weighted tardiness in flexible flow shops

✍ Ya Yang; Stephan Kreipl; Michael Pinedo 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 156 KB 👁 1 views

Consider a #exible #ow shop with s stages in series and at each stage a number of identical machines in parallel. There are n jobs to be processed and each job has to go through the stages following the same route. Job j has release date r H , due date d H , weight w H and a processing time p HJ at

A large step random walk for minimizing

A large step random walk for minimizing total weighted tardiness in a job shop

✍ Stephan Kreipl 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 116 KB 👁 2 views

We consider a job shop with m machines. There are n jobs and each job has a speciÿed sequence to be processed by the machines. Job j has release date rj, due date dj, weight wj and processing time pij on machine i (1; : : : ; m). The objective is to minimize the total weighted tardiness of the n job