Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/6037
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Janiak, A | - |
dc.creator | Kovalyov, MY | - |
dc.date.accessioned | 2014-12-11T08:24:30Z | - |
dc.date.available | 2014-12-11T08:24:30Z | - |
dc.identifier.issn | 1052-6234 | - |
dc.identifier.uri | http://hdl.handle.net/10397/6037 | - |
dc.language.iso | en | en_US |
dc.publisher | Society for Industrial and Applied Mathematics | en_US |
dc.rights | © 1998 Society for Industrial and Applied Mathematics | en_US |
dc.subject | Single machine scheduling | en_US |
dc.subject | Resource allocation | en_US |
dc.subject | Bicriterion scheduling | en_US |
dc.subject | Approximation | en_US |
dc.title | Bicriterion single machine scheduling with resource dependent processing times | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 617 | - |
dc.identifier.epage | 630 | - |
dc.identifier.volume | 8 | - |
dc.identifier.issue | 2 | - |
dc.identifier.doi | 10.1137/S1052623495288192 | - |
dcterms.abstract | A bicriterion problem of scheduling jobs on a single machine is studied. The processing time of each job is a linear decreasing function of the amount of a common discrete resource allocated to the job. A solution is specified by a sequence of the jobs and a resource allocation. The quality of a solution is measured by two criteria, F₁ and F₂. The first criterion is the maximal or total (weighted) resource consumption, and the second criterion is a regular scheduling criterion depending on the job completion times. Both criteria have to be minimized. General schemes for the construction of the Pareto set and the Pareto set ϵ-approximation are presented. Computational complexities of problems to minimize F₁ subject to F₂ ≤ K and to minimize F₂ subject to F₁≤ K, where K is any number, are studied for various functions F₁ and F₂. Algorithms for solving these problems and for the construction of the Pareto set and the Pareto set ϵ-approximation for the corresponding bicriterion problems are presented. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | SIAM journal on optimization, May 1998, v. 8, no. 2, p. 617-630 | - |
dcterms.isPartOf | SIAM Journal on optimization | - |
dcterms.issued | 1998-05 | - |
dc.identifier.isi | WOS:000073302100017 | - |
dc.identifier.scopus | 2-s2.0-0032222091 | - |
dc.identifier.eissn | 1095-7189 | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Cheng_Bicriterion_Single_Machine.pdf | 388.87 kB | Adobe PDF | View/Open |
Page views
123
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
213
Citations as of Apr 14, 2024
SCOPUSTM
Citations
73
Last Week
1
1
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
71
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.