A Job Shop Scheduling Heuristic for Varying Reward Structures

Abstract

In this paper, a job shop scheduling problem of assigning preemptive tasks with precedence constraints to flexible resources is defined. A significant characteristic of this problem is that each task has a reward structure that defines the amount of reward based on its completion time. The objective is to maximize the total reward in the job shop. An optimal solution to this problem cannot be realistically obtained, as even significantly simpler problems are strongly NP-hard; therefore, a heuristic is proposed to obtain applicable solutions. The method is based on calculating (heuristic) penalty indices for each task as a function of time in order to allocate tasks to resources. A mathematical programming technique is then used to optimally minimize the penalty. This approach combines sound management science principles in order to emphasize analytical solutions to complicated real-life problems.

Department(s)

Engineering Management and Systems Engineering

Keywords and Phrases

Mathematical Model; Penality Index; Precedence Constraint; Reward; Applied mathematics; Resource allocation

International Standard Serial Number (ISSN)

0895-7177

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2005 Elsevier, All rights reserved.

Publication Date

01 Jan 2005

Link to Full Text

Share

 
COinS