Minimizing mean absolute deviation of completion time about a common due window subject to maximum tardiness for a single machine
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
- Biskup, Dirk & Feldmann, Martin, 2005. "On scheduling around large restrictive common due windows," European Journal of Operational Research, Elsevier, vol. 162(3), pages 740-761, May.
- Shabtay, Dvir, 2010. "Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs," International Journal of Production Economics, Elsevier, vol. 123(1), pages 235-242, January.
- Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 131(2), pages 747-751, June.
- Liman, Surya D. & Panwalkar, Shrikant S. & Thongmee, Sansern, 1996. "Determination of common due window location in a single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 93(1), pages 68-74, August.
- Seo, Jong Hwa & Kim, Chae-Bogk & Lee, Dong Hoon, 2001. "Minimizing mean squared deviation of completion times with maximum tardiness constraint," European Journal of Operational Research, Elsevier, vol. 129(1), pages 95-104, February.
- Li, Lei & Fonseca, Daniel J. & Chen, Der-San, 2006. "Earliness-tardiness production planning for just-in-time manufacturing: A unifying approach by goal programming," European Journal of Operational Research, Elsevier, vol. 175(1), pages 508-515, November.
When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:134:y:2011:i:1:p:196-203. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.