Minimizing Makespan on a Single Burn-in Oven in Semiconductor Manufacturing

Cited 81 time in webofscience Cited 0 time in scopus
  • Hit : 260
  • Download : 0
This paper considers a scheduling problem for a single burn-in oven in semiconductor manufacturing industry where the oven is a batch processing machine and each batch processing time is represented by the largest processing time among those of all the jobs contained in the batch. The objective measure of the problem is the maximum completion time (makespan) of all jobs. This paper investigates a static case in which all jobs are available to process at time zero, and also analyzes a dynamic case with different job-release times, for which a branch-and-bound algorithm and several heuristics are exploited. The worst case error performance ratios of the heuristics are also derived. (C) 2000 Elsevier Science B.V. All rights reserved.
Publisher
Elsevier Science Bv
Issue Date
2000-02
Language
English
Article Type
Article
Keywords

BATCH PROCESSING MACHINE; TOTAL COMPLETION-TIME; JOB FAMILIES; ALGORITHMS; OPERATIONS

Citation

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.120, no.3, pp.559 - 574

ISSN
0377-2217
URI
http://hdl.handle.net/10203/71829
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 81 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0