Maximizing total job value on a single machine with job selection

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 535
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorEun, Joonyupko
dc.contributor.authorSung, Chang Supko
dc.contributor.authorKim, Eun-Seokko
dc.date.accessioned2017-09-08T05:59:38Z-
dc.date.available2017-09-08T05:59:38Z-
dc.date.created2017-09-04-
dc.date.created2017-09-04-
dc.date.issued2017-09-
dc.identifier.citationJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.68, no.9, pp.998 - 1005-
dc.identifier.issn0160-5682-
dc.identifier.urihttp://hdl.handle.net/10203/225806-
dc.description.abstractThis 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.languageEnglish-
dc.publisherPALGRAVE MACMILLAN LTD-
dc.subjectTOTAL NET REVENUE-
dc.subjectORDER ACCEPTANCE-
dc.subjectREJECTION-
dc.subjectTARDINESS-
dc.subjectTIME-
dc.titleMaximizing total job value on a single machine with job selection-
dc.typeArticle-
dc.identifier.wosid000408029600002-
dc.identifier.scopusid2-s2.0-85021101759-
dc.type.rimsART-
dc.citation.volume68-
dc.citation.issue9-
dc.citation.beginningpage998-
dc.citation.endingpage1005-
dc.citation.publicationnameJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY-
dc.identifier.doi10.1057/s41274-017-0238-z-
dc.contributor.localauthorSung, Chang Sup-
dc.contributor.nonIdAuthorEun, Joonyup-
dc.contributor.nonIdAuthorKim, Eun-Seok-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorscheduling-
dc.subject.keywordAuthorjob value-
dc.subject.keywordAuthorstepwise value function-
dc.subject.keywordAuthorbranch-and-bound-
dc.subject.keywordAuthorheuristic-
dc.subject.keywordPlusTOTAL NET REVENUE-
dc.subject.keywordPlusORDER ACCEPTANCE-
dc.subject.keywordPlusREJECTION-
dc.subject.keywordPlusTARDINESS-
dc.subject.keywordPlusTIME-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0