Scheduling jobs with release dates and deadlines on a batch processing machine

Edwin Tai Chiu Cheng, Z. Liu, W. Yu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

39 Citations (Scopus)

Abstract

In this paper, we investigate the unbounded version of scheduling jobs with release dates and deadlines on a batch processing machine. NP-completeness is established for the case where all jobs have agreeable processing times and deadlines. Polynomial time algorithms are presented for the following cases: agreeable release dates and deadlines; agreeable release dates and processing times; a fixed number of distinct release dates, distinct processing times or distinct deadlines.
Original languageEnglish
Pages (from-to)685-690
Number of pages6
JournalIIE Transactions (Institute of Industrial Engineers)
Volume33
Issue number8
DOIs
Publication statusPublished - 1 Jan 2001

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this