.png){kind=icon}
.png){kind=icon}
Return
Scheduling a single batch processing machine with secondary resource constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/S0278-6125(98)80008-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies the problems of minimizing total completion time (Sigma C-i) and makespan (Cmax) on a single batch processing machine with job families and secondary resource constraints. The motivation for this problem is the burn-in operation in the final testing stage of semiconductor manufacturing, where both oven capacity and the number of boards available may constrain scheduling decisions. Because both problems are NP-hard, integer programming formulations are developed for special cases and are then used to develop heuristics. Extensive computational experiments show that the heuristics are capable of consistently obtaining good solutions in modest CPU times.
Keywords:
scheduling
semiconductor manufacturing
batch processing machines
heuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
14.2
Papers:
2.7K
Citations:
1.6W
Organization
No organization information available