Maximizing total job value on a single machine with job selection
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 은준엽 | - |
dc.date.accessioned | 2022-04-09T19:41:17Z | - |
dc.date.available | 2022-04-09T19:41:17Z | - |
dc.date.created | 2022-04-08 | - |
dc.date.issued | 2017-09 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/139816 | - |
dc.description.abstract | This paper describes a single-machine scheduling problem of maximizing total job value with a machine availability constraint. The value of each job decreases over time in a stepwise fashion. Several solution properties of the problem are developed. Based on the properties, a branch-and-bound algorithm and a heuristic algorithm are derived. These algorithms are evaluated in the computational study, and the results show that the heuristic algorithm provides effective solutions within short computation times. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | PALGRAVE MACMILLAN LTD | - |
dc.title | Maximizing total job value on a single machine with job selection | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 은준엽 | - |
dc.identifier.doi | 10.1057/s41274-017-0238-z | - |
dc.identifier.bibliographicCitation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.68, no.9, pp.998 - 1005 | - |
dc.relation.isPartOf | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.citation.title | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.citation.volume | 68 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 998 | - |
dc.citation.endPage | 1005 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | ssci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | branch-and-bound | - |
dc.subject.keywordAuthor | heuristic | - |
dc.subject.keywordAuthor | job value | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | stepwise value function | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.