Scheduling with agreeable release times and due dates on a batch processing machine

Chung Lun Li, Chung Yee Lee

Research output: Journal article publicationJournal articleAcademic researchpeer-review

97 Citations (Scopus)

Abstract

We consider the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. The job release times and due dates are assumed to be agreeable. Two different objective functions are considered: minimize the maximum tardiness and minimize the number of tardy jobs. We study the complexity of the problems. Efficient algorithms are also provided for the case when the job release times, due dates, and processing times are agreeable, which generalize those provided by Lee, Uzsoy and Martin-Vega (1992).
Original languageEnglish
Pages (from-to)564-569
Number of pages6
JournalEuropean Journal of Operational Research
Volume96
Issue number3
Publication statusPublished - 1 Feb 1997
Externally publishedYes

Keywords

  • Computational complexity
  • Dynamic programming
  • Scheduling

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this