Capacity-filtering algorithms for finite-capacity planning of a flexible flow line

Cited 9 time in webofscience Cited 0 time in scopus
  • Hit : 385
  • Download : 0
This paper addresses finite-capacity planning (or medium-term scheduling) issues in a flexible flow line such as a semiconductor fabrication (Fab), liquid crystal display (LCD) Fab, or printed circuit board (PCB) Fab. In such a flexible flow line, medium-term schedules such as release schedules and output schedules are critical to achieving the goal of full-capacity and on-time production. However, existing finite-capacity planning methods do not adequately reflect the actual capacity profiles of the Fab. This paper presents capacity-filtering algorithms for generating a finite-capacity loading-profile from an infinite-capacity loadingprofile at a processing stage in a Fab. In addition, two types of finite-capacity planning problems are described, and ways to use the algorithms in solving these problems presented. Performance analyses using a real-life case study show that the proposed method is superior to existing methods. It is postulated that the results presented can be used as a building block for obtaining medium-term schedules for the entire Fab.
Publisher
TAYLOR FRANCIS LTD
Issue Date
2009
Language
English
Article Type
Article
Keywords

SEMICONDUCTOR WAFER FABRICATION; JOB-SHOP ENVIRONMENT; RELEASE; POLICIES; MODEL; TIMES; PULL; MRP

Citation

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.47, no.12, pp.3363 - 3386

ISSN
0020-7543
DOI
10.1080/00207540701644201
URI
http://hdl.handle.net/10203/98148
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0