Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
Scheduling jobs with release dates and deadlines on a batch processing machine. |
| Συγγραφείς: |
T.C. Edwin Cheng1 mscheng@polyu.edu.hk, Zhaohui Liu1,2, Wenci Yu2 |
| Πηγή: |
IIE Transactions. Aug2001, Vol. 33 Issue 8, p685. 6p. 1 Chart. |
| Θεματικοί όροι: |
*Deadlines, *Production scheduling, *Management science, *Continuous processing, *Batch processing, *Electronic data processing, *Algorithms, *Manufacturing processes, Batch processing in electronic data processing |
| Περίληψη: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of IIE Transactions is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |