Result: Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs.
Further Information
Highlights: [•] A parallel-batching scheduling problem with uniform family due dates is considered. [•] An FPTAS scheme is proposed for the weighed number of tardy jobs. [•] An -time algorithm is provided for the unit weight problem. [•] An -time algorithm is presented for the equal processing time problem. [Copyright &y& Elsevier]
Copyright of Computers & Industrial Engineering is the property of Pergamon Press - An Imprint of Elsevier Science 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.)