Article ID: | iaor20119196 |
Volume: | 134 |
Issue: | 1 |
Start Page Number: | 196 |
End Page Number: | 203 |
Publication Date: | Nov 2011 |
Journal: | International Journal of Production Economics |
Authors: | Su Ling-Huey, Tien Yi-Yu |
Keywords: | heuristics, programming: branch and bound |
This study deals with the problem of scheduling jobs on a single machine to minimize the mean absolute deviation of the job completion time about a large common due window subject to the maximum tardiness constraint. Using the well‐known three‐field notation, the problem is identified as