| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Logistics and Maritime Studies | en_US |
| dc.creator | Yuan, J | en_US |
| dc.creator | Ng, CT | en_US |
| dc.creator | Cheng, TCE | en_US |
| dc.date.accessioned | 2021-08-20T02:04:28Z | - |
| dc.date.available | 2021-08-20T02:04:28Z | - |
| dc.identifier.issn | 0377-2217 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/90693 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.subject | Machine scheduling | en_US |
| dc.subject | Multi-agent | en_US |
| dc.subject | Multi-criteria | en_US |
| dc.subject | Pareto scheduling | en_US |
| dc.title | Scheduling with release dates and preemption to minimize multiple max-form objective functions | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 860 | en_US |
| dc.identifier.epage | 875 | en_US |
| dc.identifier.volume | 280 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.doi | 10.1016/j.ejor.2019.07.072 | en_US |
| dcterms.abstract | In this paper, we study multi-agent scheduling with release dates and preemption on a single machine, where the scheduling objective function of each agent to be minimized is regular and of the maximum form (max-form). The multi-agent aspect has three versions, namely ND-agent (multiple agents with non-disjoint job sets), ID-agent (multiple agents with an identical job set), and CO-agent (multiple competing agents with mutually disjoint job sets). We consider three types of problems: The first type (type-1) is the constrained scheduling problem, in which one objective function is to be minimized, subject to the restriction that the values of the other objective functions are upper bounded. The second type (type-2) is the weighted-sum scheduling problem, in which a positive combination of the objective functions is to be minimized. The third type (type-3) is the Pareto scheduling problem, for which we aim to find all the Pareto-optimal points and their corresponding Pareto-optimal schedules. We show that the type-1 problems are polynomially solvable, and the type-2 and type-3 problems are strongly NP-hard even when all jobs’ release dates are zero and processing times are one. When the number of the scheduling criteria is fixed and they are all lateness-like, such as minimizing Cmax, Fmax, Lmax, Tmax, and WCmax, where WCmax is the maximum weighted completion time of the jobs, the type-2 and type-3 problems are polynomially solvable. To address the type-3 problems, we develop a new solution technique that guesses the Pareto-optimal points through some elaborately constructed schedule-configurations. | en_US |
| dcterms.accessRights | embargoed access | en_US |
| dcterms.bibliographicCitation | European journal of operational research, 1 Feb. 2020, v. 280, no. 3, p. 860-875 | en_US |
| dcterms.isPartOf | European journal of operational research | en_US |
| dcterms.issued | 2020-02 | - |
| dc.identifier.scopus | 2-s2.0-85070278217 | - |
| dc.identifier.eissn | 1872-6860 | en_US |
| dc.description.validate | 202108 bcvc | en_US |
| dc.description.oa | Not applicable | en_US |
| dc.identifier.FolderNumber | a1007-n03 | - |
| dc.identifier.SubFormID | 2416 | - |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | This research was supported in part by The Hong Kong Polytechnic University under the Fung Yiu King - Wing Hang Bank Endowed Professorship in Business Administration. | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.date.embargo | 2022.02.28 | en_US |
| Appears in Collections: | Journal/Magazine Article | |
Access
View full-text via PolyU eLinks 
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.