Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474807 | Computers & Operations Research | 2009 | 4 Pages |
Abstract
In this paper we study the single machine common due date assignment and scheduling problem with the possibility to perform a rate-modifying activity (RMA) for changing the processing times of the jobs following this activity. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs. Placing the RMA to some position in the schedule can decrease the objective function value. Several properties of the problem are considered which in some cases can reduce the complexity of the solution algorithm.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Valery S. Gordon, Alexander A. Tarasevich,