 Minimizing mean absolute deviation of completion time about a common due window subject to maximum tardiness for a single machineLing-Huey Su and Yi-Yu Tien International Journal of Production Economics, 2011, vol. 134, issue 1, 196-203 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/Tmax. 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 Tmax 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. Keywords: Scheduling; Single; machine; Common; due; window; Mean; absolute; deviation; Maximum; tardiness (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:134:y:2011:i:1:p:196-203 Access Statistics for this article International Journal of Production Economics is currently edited by Stefan Minner More articles in International Journal of Production Economics from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.