A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times Academic Article

abstract

• We consider single-resource scheduling when candidate jobs may be accepted (producing job-specific profit) or rejected. Our solution approaches seek to maximize the profitability of the resulting schedule under job-specific tardiness costs and reducible processing times (at a cost). We present an algorithm that maximizes schedule profit for a given sequence of jobs, along with two heuristic approaches for generating good job sequences. A set of computational tests on randomly generated problem instances demonstrates the relative effectiveness of our proposed heuristic approaches. 2007 Elsevier Ltd. All rights reserved.

authors

• Geunes, Joseph

published proceedings

• COMPUTERS & INDUSTRIAL ENGINEERING

author list (cited authors)

• Yang, B., & Geunes, J.

citation count

• 25

complete list of authors

• Yang, Bibo||Geunes, Joseph

publication date

• October 2007

publisher

• Elsevier  Publisher

published in

• Computers and Industrial Engineering  Journal

keywords

• Heuristics
• Job-selection
• Scheduling

Digital Object Identifier (DOI)

• 10.1016/j.cie.2007.02.005

start page

• 420

end page

• 432

volume

• 53

issue

• 3

URL

• http://dx.doi.org/10.1016/j.cie.2007.02.005