Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 732437, 5 pages
Research Article

Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

College of Science, East China Institute of Technology, Nanchang, Jiangxi 330013, China

Received 31 August 2014; Accepted 15 September 2014

Academic Editor: Chin-Chia Wu

Copyright © 2015 Ting Wang and Dehua Xu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.