Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

Chung-Yee Lee, Reha Uzsoy and Louis A. Martin-Vega
Operations Research
Vol. 40, No. 4 (Jul. - Aug., 1992), pp. 764-775
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/171006
Page Count: 12
  • Download ($30.00)
  • Cite this Item
Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
764
    764
  • Thumbnail: Page 
765
    765
  • Thumbnail: Page 
766
    766
  • Thumbnail: Page 
767
    767
  • Thumbnail: Page 
768
    768
  • Thumbnail: Page 
769
    769
  • Thumbnail: Page 
770
    770
  • Thumbnail: Page 
771
    771
  • Thumbnail: Page 
772
    772
  • Thumbnail: Page 
773
    773
  • Thumbnail: Page 
774
    774
  • Thumbnail: Page 
775
    775