DC Field | Value | Language |
---|---|---|
dc.contributor.author | Eun, Joonyup | ko |
dc.contributor.author | Sung, Chang Sup | ko |
dc.contributor.author | Kim, Eun-Seok | ko |
dc.date.accessioned | 2017-09-08T05:59:38Z | - |
dc.date.available | 2017-09-08T05:59:38Z | - |
dc.date.created | 2017-09-04 | - |
dc.date.created | 2017-09-04 | - |
dc.date.issued | 2017-09 | - |
dc.identifier.citation | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.68, no.9, pp.998 - 1005 | - |
dc.identifier.issn | 0160-5682 | - |
dc.identifier.uri | http://hdl.handle.net/10203/225806 | - |
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.publisher | PALGRAVE MACMILLAN LTD | - |
dc.subject | TOTAL NET REVENUE | - |
dc.subject | ORDER ACCEPTANCE | - |
dc.subject | REJECTION | - |
dc.subject | TARDINESS | - |
dc.subject | TIME | - |
dc.title | Maximizing total job value on a single machine with job selection | - |
dc.type | Article | - |
dc.identifier.wosid | 000408029600002 | - |
dc.identifier.scopusid | 2-s2.0-85021101759 | - |
dc.type.rims | ART | - |
dc.citation.volume | 68 | - |
dc.citation.issue | 9 | - |
dc.citation.beginningpage | 998 | - |
dc.citation.endingpage | 1005 | - |
dc.citation.publicationname | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | - |
dc.identifier.doi | 10.1057/s41274-017-0238-z | - |
dc.contributor.localauthor | Sung, Chang Sup | - |
dc.contributor.nonIdAuthor | Eun, Joonyup | - |
dc.contributor.nonIdAuthor | Kim, Eun-Seok | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | scheduling | - |
dc.subject.keywordAuthor | job value | - |
dc.subject.keywordAuthor | stepwise value function | - |
dc.subject.keywordAuthor | branch-and-bound | - |
dc.subject.keywordAuthor | heuristic | - |
dc.subject.keywordPlus | TOTAL NET REVENUE | - |
dc.subject.keywordPlus | ORDER ACCEPTANCE | - |
dc.subject.keywordPlus | REJECTION | - |
dc.subject.keywordPlus | TARDINESS | - |
dc.subject.keywordPlus | TIME | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.