98
Views
24
CrossRef citations to date
0
Altmetric
TECHNICAL NOTE

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

, &
Pages 685-690 | Accepted 01 Oct 2000, Published online: 27 Apr 2007
 

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.

Notes

Corresponding author

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.