title: Scheduling jobs and a variable maintenance on a single machine with common due-date assignment.
abstract: We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.
authors.affiliation: School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, China.
authors.forename: Long
authors.initials: L
authors.lastname: Wan
mesh_terms: D000465:Algorithms; D008962:Models, Theoretical