Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/90697
Title: | Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work | Authors: | Zhang, Y Yuan, J Ng, CT Cheng, TCE |
Issue Date: | Apr-2021 | Source: | Naval research logistics, Apr. 2021, v. 68, no. 3, p. 378-393 | Abstract: | We consider three-agent scheduling on a single machine in which the criteria of the three agents are to minimize the total weighted completion time, the weighted number of tardy jobs, and the total weighted late work, respectively. The problem is to find the set of all the Pareto-optimal points, that is, the Pareto frontier, and their corresponding Pareto-optimal schedules. Since the above problem is unary NP-hard, we study the problem under the restriction that the jobs of the first agent have inversely agreeable processing times and weights, that is, the smaller the processing time of a job is, the greater its weight is. For this restricted problem, which is NP-hard, we present a pseudo-polynomial-time algorithm to find the Pareto frontier. We also show that, for various special versions, the time complexity of solving the problem can be further reduced. | Keywords: | Scheduling Three-agent Pareto-optimization Total weighted completion time Total weighted late work Weighted number of tardy jobs |
Publisher: | John Wiley & Sons | Journal: | Naval research logistics | ISSN: | 0894-069X | EISSN: | 1520-6750 | DOI: | 10.1002/nav.21961 | Rights: | © 2020 Wiley Periodicals LLC This is the peer reviewed version of the following article: Zhang, Y, Yuan, J, Ng, CT, Cheng, TCE. Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work. Naval Research Logistics. 2021; 68: 378– 393, which has been published in final form at https://doi.org/10.1002/nav.21961. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. This article may not be enhanced, enriched or otherwise transformed into a derivative work, without express permission from Wiley or by statutory rights under applicable legislation. Copyright notices must not be removed, obscured or modified. The article must be linked to Wiley’s version of record on Wiley Online Library and any embedding, framing or otherwise making available the article or pages thereof by third parties from platforms, services and websites other than Wiley Online Library must be prohibited. |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhang_Pareto-Optimization_Three-Agent_Jobs.pdf | Pre-Published version | 407.43 kB | Adobe PDF | View/Open |
Page views
118
Last Week
0
0
Last month
Citations as of May 5, 2024
Downloads
16
Citations as of May 5, 2024
SCOPUSTM
Citations
12
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
13
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.