Minimizing weighted earliness–tardiness on a single machine with a common due date using quadratic models
AbstractIn this paper we study the problem of minimizing weighted earliness and tardiness on a single machine when all the jobs share the same due date. We propose two quadratic integer programming models for solving both cases of unrestricted and restricted due dates, an auxiliary model based on unconstrained quadratic integer programming and an algorithmic scheme for solving each instance, according to its size and characteristics, in the most efficient way. The scheme is tested on a set of well-known test problems. By combining the solutions of the three models we prove the optimality of the solutions obtained for most of the problems. For large instances, although optimality cannot be proved, we actually obtain optimal solutions for all the tested instances. Copyright Sociedad de Estadística e Investigación Operativa 2012
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal TOP.
Volume (Year): 20 (2012)
Issue (Month): 3 (October)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=120409
Find related papers by JEL classification:
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.:
- Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
- Hoogeveen, J. A. & van de Velde, S. L., 1991. "Scheduling around a small common due date," European Journal of Operational Research, Elsevier, vol. 55(2), pages 237-242, November.
- Plateau, M.-C. & Rios-Solis, Y.A., 2010. "Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations," European Journal of Operational Research, Elsevier, vol. 201(3), pages 729-736, March.
- Hino, Celso M. & Ronconi, Debora P. & Mendes, Andre B., 2005. "Minimizing earliness and tardiness penalties in a single-machine problem with a common due date," European Journal of Operational Research, Elsevier, vol. 160(1), pages 190-201, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.