PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 2002Journal of Scheduling193 citations

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

View Full Paper
SMScott J. MasonJFJohn FowlerWCW. Matthew Carlyle

Key Points

Key points are not available for this paper at this time.

Abstract

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 modified 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 flow through a number of different 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. Copyright © 2002 John Wiley & Sons, Ltd.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Mason et al. (2002) studied this question.

synapsesocial.com/papers/6a1efdd095bd0d03bde6b543https://doi.org/10.1002/jos.102
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop1999 · 171 citations
  2. 2A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING1992 · 601 citations
  3. 3Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm1969 · 403 citations
  4. 4Complexity of Machine Scheduling Problems1977 · 2,197 citations
  5. 5Scheduling semiconductor manufacturing plants1994 · 136 citations