Bibliographic Details
| Title: |
Parallel-machine scheduling with machine unavailability to maximize total early work. |
| Authors: |
Chen, Ke1 (AUTHOR), Shi, Xiaoyu2 (AUTHOR), Yao, Danli3 (AUTHOR), Cheng, T. C. E.4 (AUTHOR), Ji, Min2 (AUTHOR) jimkeen@163.com |
| Source: |
Journal of the Operational Research Society. Aug2026, Vol. 77 Issue 8, p2330-2340. 11p. |
| Subject Terms: |
*Scheduling, *System downtime, *Parallel processing, *Dynamic programming, NP-hard problems, Approximation algorithms, Heuristic algorithms, Time complexity |
| Abstract: |
This article considers a parallel-machine scheduling problem in which machines are unavailable to process jobs for a specified period. The objective is to maximize the total amount of early work, where the early work of a job is the amount of processing time performed before its due date. Since this problem is NP-hard, we propose a pseudo-polynomial time dynamic programming algorithm, and based on it, we further provide a fully polynomial time approximation scheme. The time complexity of these two algorithms is relatively high; to this end, we also offer a 2-approximation ratio heuristic algorithm to help solve large-scale problems, and we show that the bound is tight. [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: |
Business Source Index |
