Journal ArticleDOI
Efficient algorithms for scheduling semiconductor burn-in operations
Reads0
Chats0
TLDR
In this article, the problem of scheduling semiconductor burn-in operations is modeled as batch processing machines, where the processing time of a batch is equal to the largest processing time among all jobs in the batch.Abstract:
In this paper, we study the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. A batch processing machine is one that can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. We present efficient dynamic programming-based algorithms for minimizing a number of different performance measures on a single batch processing machine. We also present heuristics for a number of problems concerning parallel identical batch processing machines and we provide worst case error bounds.read more
Citations
More filters
Journal ArticleDOI
Scheduling with batching: A review
TL;DR: This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results about efficient dynamic programming algorithms for solving batching problems.
Journal ArticleDOI
A review of production planning and scheduling models in the semiconductor industry part ii: shop-floor control
TL;DR: In this paper, the relationship between shop-floor control and production planning is discussed, and the relative advantages and disadvantages of the various approaches are discussed, as well as future research directions.
Journal ArticleDOI
Scheduling a batching machine
Peter Brucker,Andrei Gladky,Han Hoogeveen,Mikhail Y. Kovalyov,Chris N. Potts,Thomas Tautenhahn,Steef van de Velde +6 more
TL;DR: In this paper, the problem of scheduling n jobs on a batching machine to minimize regular scheduling criteria that are non-decreasing in the job completion times was studied, and it was shown that minimizing the weighted number of tardy jobs and the total weighted tardiness are NP-hard problems.
Journal ArticleDOI
Scheduling groups of jobs on a single machine
Scott Webster,Kenneth R. Baker +1 more
TL;DR: This paper reviews the rapidly growing literature on single-machine scheduling models that incorporate benefits from job grouping and focuses on three basic models known as family scheduling with item availability, family scheduling for batch availability, and batch processing.
Journal ArticleDOI
Scheduling a single batch processing machine with non-identical job sizes
TL;DR: In this paper, the problem of scheduling jobs with non-identical capacity requirements or sizes on a single batch processing machine to minimize total completion time and makespan is studied, and heuristics are developed for both problems.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Scheduling semiconductor wafer fabrication
TL;DR: In this paper, a variety of input control and sequencing rules are evaluated using a simulation model of a representative, but fictitious, semiconductor wafer fabrication, and the simulation results indicate that scheduling has a significant impact on average throughput time, with larger improvements coming from discretionary imput control than from lot sequencing.
Journal ArticleDOI
Closed-loop job release control for VLSI circuit manufacturing
TL;DR: In this paper, a closed-loop job release mechanism for job shops where the main source of randomness is due to machine failure and repair is introduced, which adapts concepts of the reorder-point method of inventory control to the context of job shop scheduling.
Related Papers (5)
Efficient scheduling algorithms for a single batch processing machine
Yoshiro Ikura,Mark Gimple +1 more