Optimizing parallel batch scheduling on uniform machines: a focus on equal job durations with varied release dates and sizes.
Saved in:
| Title: | Optimizing parallel batch scheduling on uniform machines: a focus on equal job durations with varied release dates and sizes. |
|---|---|
| Authors: | Li, Shuguang1 (AUTHOR) sgliytu@hotmail.com, Zhang, Yuming1 (AUTHOR), Liang, Zijian1 (AUTHOR), Irangabiye, Armand Jean Noel1 (AUTHOR) |
| Source: | RAIRO: Operations Research (2804-7303). Mar/Apr2026, Vol. 60 Issue 2, p831-844. 14p. |
| Subjects: | Batch processing, Scheduling, Approximation algorithms, Deterministic algorithms |
| Abstract: | In this paper, we explore a parallel batch scheduling problem, focusing on scenarios where jobs, equal in duration, differ in release dates and sizes, and are processed on uniform machines with varied batch capacities. The objective function to be minimized is makespan, i.e., the maximum completion time of all the jobs. We present two exact algorithms tailored for a scenario characterized by jobs whose sizes are sequentially divisible. Addressing the general context where this divisibility does not hold, we introduce a 2-approximation algorithm which is considered the best achievable in some sense, since improving the approximation ratio superior to 2 is improbable without resolving the P versus NP problem. [ABSTRACT FROM AUTHOR] |
| Copyright of RAIRO: Operations Research (2804-7303) is the property of EDP Sciences 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 193984830 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Optimizing parallel batch scheduling on uniform machines: a focus on equal job durations with varied release dates and sizes. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Li%2C+Shuguang%22">Li, Shuguang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> sgliytu@hotmail.com</i><br /><searchLink fieldCode="AR" term="%22Zhang%2C+Yuming%22">Zhang, Yuming</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Liang%2C+Zijian%22">Liang, Zijian</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Irangabiye%2C+Armand+Jean+Noel%22">Irangabiye, Armand Jean Noel</searchLink><relatesTo>1</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22RAIRO%3A+Operations+Research+%282804-7303%29%22">RAIRO: Operations Research (2804-7303)</searchLink>. Mar/Apr2026, Vol. 60 Issue 2, p831-844. 14p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Batch+processing%22">Batch processing</searchLink><br /><searchLink fieldCode="DE" term="%22Scheduling%22">Scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Approximation+algorithms%22">Approximation algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Deterministic+algorithms%22">Deterministic algorithms</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: In this paper, we explore a parallel batch scheduling problem, focusing on scenarios where jobs, equal in duration, differ in release dates and sizes, and are processed on uniform machines with varied batch capacities. The objective function to be minimized is makespan, i.e., the maximum completion time of all the jobs. We present two exact algorithms tailored for a scenario characterized by jobs whose sizes are sequentially divisible. Addressing the general context where this divisibility does not hold, we introduce a 2-approximation algorithm which is considered the best achievable in some sense, since improving the approximation ratio superior to 2 is improbable without resolving the P versus NP problem. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of RAIRO: Operations Research (2804-7303) is the property of EDP Sciences 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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193984830 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1051/ro/2026027 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 14 StartPage: 831 Subjects: – SubjectFull: Batch processing Type: general – SubjectFull: Scheduling Type: general – SubjectFull: Approximation algorithms Type: general – SubjectFull: Deterministic algorithms Type: general Titles: – TitleFull: Optimizing parallel batch scheduling on uniform machines: a focus on equal job durations with varied release dates and sizes. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Li, Shuguang – PersonEntity: Name: NameFull: Zhang, Yuming – PersonEntity: Name: NameFull: Liang, Zijian – PersonEntity: Name: NameFull: Irangabiye, Armand Jean Noel IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar/Apr2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 28047303 Numbering: – Type: volume Value: 60 – Type: issue Value: 2 Titles: – TitleFull: RAIRO: Operations Research (2804-7303) Type: main |
| ResultId | 1 |
