Job selection in heavily loaded shop

View/ Open
Author
Ghosh, J. B.
Date
1997Journal Title
Computers and Operations Research
ISSN
0305-0548
Publisher
Elsevier
Volume
24
Issue
2
Pages
141 - 145
Language
English
Type
Article
Metadata
Show full item recordPlease cite this item using this persistent URL
http://hdl.handle.net/11693/10886Abstract
Recently, 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 Ltd