Job selection in heavily loaded shop

Date

1997

Authors

Ghosh, J. B.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
1
views
23
downloads

Citation Stats

Series

Abstract

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

Source Title

Computers and Operations Research

Publisher

Elsevier

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English