Journal Article10.1016/0167-6377(86)90104-5
Efficient scheduling algorithms for a single batch processing machine
Yoshiro Ikura,Mark Gimple +1 more
293
TL;DR: This work gives efficient algorithms to find a feasible schedule, if any, which minimizes the final completion time under the assumption such that for r"i > r"j, d"i >= d"j.
read more
About: This article is published in Operations Research Letters. The article was published on 01 Jul 1986. The article focuses on the topics: Batch processing & Single-machine scheduling.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient algorithms for scheduling semiconductor burn-in operations
TL;DR: 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.
464
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.
427
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.
389
A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor
TL;DR: A literature review, classification schemes and a simple meta-analysis for scheduling of batch processors (SBP) research in semiconductor manufacturing (SM) are presented and show that there is an increasing trend in SBP research in SM.
319
A Self-Adaptive Differential Evolution Algorithm for Scheduling a Single Batch-Processing Machine With Arbitrary Job Sizes and Release Times
TL;DR: A self-adaptive differential evolution algorithm is developed for addressing a single BPM scheduling problem with unequal release times and job sizes and results demonstrate that the proposed self- Adaptive algorithm is more effective than other algorithms for this scheduling problem.
217
References
Recent Developments in Deterministic Sequencing and Scheduling: A Survey
E. L. Lawler,J. K. Lenstra,A. H. G. Rinnooy Kan +2 more
- 01 Jan 1982
TL;DR: A survey of deterministic sequencing and scheduling can be found in this article, where the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory.
342
A fast algorithm for multiprocessor scheduling
Barbara Simons
- 13 Oct 1980
TL;DR: An algorithm with running time O(n310g n) which schedules all the jobs while minimizing the maximum job completion time is described.
21
•Journal Article
CIMS in semiconductor manufacturing
TL;DR: In this article, the concept of CIMS is defined and decrit la mise au point d'un CIM s is decrit, i.e., le mieux adapte aux caracteristiques uniques de production des circuits LSI.
1
Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
TL;DR: This work provides an $O(n\log n)$ algorithm based on the concept of “forbidden regions” for the one-processor case, a generalization that considerably increases the difficulty of the problem even for only a single processor.
A fast algorithm for single processor scheduling
Barbara Simons
- 16 Oct 1978
TL;DR: The problem is to find a feasible schedule in which each job is run for the same amount of time p, and the processing is nonpreemptive in that once a job is started it continues executing until it has run for precisely p units of time.