Show simple item record

dc.contributor.authorGhosh, J. B.en_US
dc.date.accessioned2015-07-28T11:56:10Z
dc.date.available2015-07-28T11:56:10Z
dc.date.issued1997en_US
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/10886
dc.description.abstractRecently, Slotnick and Morton address a job selection problem in a heavily loaded shop, where a tradeoff is sought between the reward obtained when a job is accepted for processing and the lateness penalty incurred when such a job is actually delivered. They provide a branch and bound algorithm and a couple of heuristics for the problem's solution. They do not;however, resolve the issue of problem complexity. In this note. we first establish that the problem is NP-hard. We then go on to provide two pseudo-polynomial time algorithms which also show that the problem is solvable in polynomial time if either the job processing times or the job weights for the lateness penalty are equal. We further provide a fully polynomial time approximation scheme which always generates a solution within a specified percentage of the optimal. Copyright © 1997 Elsevier Science Ltden_US
dc.language.isoEnglishen_US
dc.source.titleComputers and Operations Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/S0305-0548(96)00045-7en_US
dc.subjectJob selectionen_US
dc.subjectHeavily loaded shopen_US
dc.subjectSlotnicken_US
dc.subjectMortonen_US
dc.titleJob selection in heavily loaded shopen_US
dc.typeArticleen_US
dc.departmentDepartment of Managementen_US
dc.citation.spage141en_US
dc.citation.epage145en_US
dc.citation.volumeNumber24en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1016/S0305-0548(96)00045-7en_US
dc.publisherElsevieren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record