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.
|Number of pages||6|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|Publication status||Published - 1 Jan 2001|
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering