Bibliographic Details
| Title: |
Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed. |
| Authors: |
Azizoglu, M., Koksalan, M., Koksalan, S.K. |
| Source: |
Journal of the Operational Research Society. Jun2003, Vol. 54 Issue 6, p661. 4p. |
| Subjects: |
Production scheduling, Algorithms, Polynomials |
| Abstract: |
We address the bi-criteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its minimum value of zero is polynomially solvable. We present polynomial time algorithms for the maximum earliness problem subject to no tardy jobs and the maximum earliness problem for a given set of tardy jobs. Finally, we discuss the use of the latter algorithm in generating all efficient schedules. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of the Operational Research Society 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.) |
| Database: |
Engineering Source |
