Minimizing mean absolute deviation of completion time about a common due window subject to maximum tardiness for a single machine

► Minimizing mean absolute deviation of job completion time about a common due window is crucial to customer's satisfaction. ► Maximum tardiness is also considered to prevent customers from being losing patience. ► A branch and bound and a heuristic are proposed to solve this problem.