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 completion time about a common due window subject to maximum tardiness for a single machine

0.00 Avg rating0 Votes
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: ,
Keywords: heuristics, programming: branch and bound
Abstract:

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 MAD/large DueWindow/T max. The common due window is set to be large enough to allow idle time prior to the beginning of a schedule to investigate the effect of the T max constraint. Penalties arise if a job is completed outside the due window. A branch and bound algorithm and a heuristic are proposed. Many properties of the solutions and precedence relationships are identified. Our computational results reveal that the branch and bound algorithm is capable of solving problems of up to 50 jobs and the heuristic algorithm yields approximate solutions that are very close to the exact solution.

Reviews

Required fields are marked *. Your email address will not be published.