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. © 2007.
CITATION STYLE
Gordon, V. S., & Tarasevich, A. A. (2009). A note: Common due date assignment for a single machine scheduling with the rate-modifying activity. Computers and Operations Research, 36(2), 325–328. https://doi.org/10.1016/j.cor.2007.10.008
Mendeley helps you to discover research relevant for your work.