On a Single Machine Due Date Assignment and Scheduling Problem with the Rate-Modifying Activity

Abstract

In this paper we consider single machine common due date assignment and scheduling problem. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs. There exists a possibility to perform some action (rate-modifying activity) to change processing times of the jobs following this activity. Thus, placing the ratemodifying… (More)
DOI: 10.1007/3-540-32539-5_106