- -

Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models

Mostrar el registro sencillo del ítem

Ficheros en el ítem

[Cerrado]
Nombre: 2012_Earliness_TOP.pdf
Tamaño: 435.7Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Alvarez-Valdes Olaguibel, Ramon es_ES
dc.contributor.author Crespo, Enric es_ES
dc.contributor.author Manuel Tamarit, Jose es_ES
dc.contributor.author Villa Juliá, Mª Fulgencia es_ES
dc.date.accessioned 2016-10-03T11:25:48Z
dc.date.available 2016-10-03T11:25:48Z
dc.date.issued 2012-10
dc.identifier.issn 1134-5764
dc.identifier.uri http://hdl.handle.net/10251/70904
dc.description.abstract In 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. es_ES
dc.description.sponsorship This study has been partially supported by the Spanish Ministry of Science and Technology, DPI2008-02700, cofinanced by FEDER funds, and by Project PCI08-0048-8577, Consejeria de Ciencia y Tecnologia, Junta de Comunidades de Castilla-La Mancha, and Generalitat Valenciana ACOMP/2009/264. en_EN
dc.language Inglés es_ES
dc.publisher Springer Verlag (Germany) es_ES
dc.relation.ispartof TOP es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Scheduling es_ES
dc.subject One machine es_ES
dc.subject Earliness-tardiness es_ES
dc.subject Heuristics es_ES
dc.subject Quadratic programming es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1007/s11750-010-0163-7
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//DPI2008-02700/ES/OPEC2: DESARROLLOS AVANZADOS PARA LA OPTIMIZACION DE PROCESOS INDUSTRIALES DE EMPAQUETAMIENTO Y CORTE/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/Generalitat Valenciana//ACOMP%2F2009%2F264/ES/OPEC2: Desarrollos avanzados para la optimización de procesos industriales de empaquetamiento y corte/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/Junta de Comunidades de Castilla-La Mancha//PCI08-0048-8577/ES/Desarrollo de Nuevas Técnicas Metaheurísticas y Aplicaciones a Problemas de Minería de Datos/ es_ES
dc.rights.accessRights Cerrado es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.description.bibliographicCitation Alvarez-Valdes Olaguibel, R.; Crespo, E.; Manuel Tamarit, J.; Villa Juliá, MF. (2012). Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models. TOP. 20(3):754-767. https://doi.org/10.1007/s11750-010-0163-7 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1007/s11750-010-0163-7 es_ES
dc.description.upvformatpinicio 754 es_ES
dc.description.upvformatpfin 767 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 20 es_ES
dc.description.issue 3 es_ES
dc.relation.senia 239207 es_ES
dc.contributor.funder Generalitat Valenciana es_ES
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES
dc.contributor.funder Junta de Comunidades de Castilla-La Mancha es_ES
dc.contributor.funder European Regional Development Fund es_ES
dc.description.references Alidaee B, Kochenberger G, Ahmadian A (1994) 0–1 Quadratic programming approach for optimum solutions of two scheduling problems. Int J Syst Sci 25:401–408 es_ES
dc.description.references Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22–36 es_ES
dc.description.references Billionnet A, Elloumi S (2007) Using a mixed integer quadratic programming solver for the unconstrained quadratic 0–1 problem. Math Program 109:55–68 es_ES
dc.description.references Billionnet A, Elloumi S, Plateau MC (2009) Improving the performance of standard solvers for quadratic 0–1 programs by a tight convex reformulation: the QCR method. Discrete Appl Math 157:1185–1197 es_ES
dc.description.references Biskup D, Feldman M (2001) Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates. Comput Oper Res 28:787–801 es_ES
dc.description.references Cheng TCE, Kahlbacher HG (1991) A proof for the longest-job-first in one-machine scheduling. Nav Res Log 38:715–720 es_ES
dc.description.references De P, Gosh JB, Wells CE (1990) CON due-date determination and sequencing. Comput Oper Res 17:333–342 es_ES
dc.description.references Feldman M, Biskup D (2003) Single machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Comput Ind Eng 44:307–323 es_ES
dc.description.references Józefowska J (2007) Just-in-time scheduling. Springer, Berlin es_ES
dc.description.references Kanet JJ (1981) Minimizing the average deviation of job completion times about a common due date. Nav Res Log 28:643–651 es_ES
dc.description.references Kedad-Sidhoum S, Sourd F (2010) Fast neighborhood search for the single machine earliness–tardiness problem. Comput Oper Res 37:1464–1471 es_ES
dc.description.references Hall NG, Posner ME (1991) Earliness–tardiness scheduling problem, I: Weighted deviation of completion times about a common due date. Oper Res 39:836–846 es_ES
dc.description.references Hall NG, Kubiak W, Sethi SP (1991) Earliness–tardiness scheduling problem, II: Deviation of completion times about a restrictive common due date. Oper Res 39:847–856 es_ES
dc.description.references Hino CM, Ronconi DP, Mendes AB (2005) Minimizing earliness and tardiness penalties in a single-machine problem with a common due date. Eur J Oper Res 55:190–201 es_ES
dc.description.references Hoogeveen JA, van de Velde SL (1991) Scheduling around a small common due date. Eur J Oper Res 55:237–242 es_ES
dc.description.references Liao CJ, Cheng CC (2007) A variable neighbourhood search for minimizing single machine weighted earliness and tardiness with common due date. Comput Ind Eng 52:404–413 es_ES
dc.description.references Lin S-W, Chou S-Y, Ying K-C (2007) A sequential exchange approach for minimizing earliness–tardiness penalties of single-machine scheduling with a common due date. Eur J Oper Res 177:1294–1301 es_ES
dc.description.references Nearchou AC (2008) A differential evolution approach for the common due date early/tardy job scheduling problem. Comput Oper Res 35:1329–1343 es_ES
dc.description.references Oral M, Kettani O (1987) Equivalent formulations of nonlinear integer problems for efficient optimization. Manag Sci 36:115–119 es_ES
dc.description.references Panwalkar SS, Smith ML, Seidman A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30:391–399 es_ES
dc.description.references Plateau MC, Rios-Solis Y (2010) Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations. Eur J Oper Res 201:729–736 es_ES
dc.description.references Skutella M (2001) Convex quadratic and semidefinite programming relaxations in scheduling. J ACM 48:206–242 es_ES
dc.description.references Sourd F (2009) New exact algorithms for on-machine earliness–tardiness scheduling. INFORMS J Comput 21:167–175 es_ES
dc.description.references Sourd F, Kedad-Sidhoum S (2003) The one machine problem with earliness and tardiness penalties. J Sched 6:533–549 es_ES
dc.description.references Sourd F, Kedad-Sidhoum S (2008) A faster branch-and-bound algorithm for the earliness–tardiness scheduling problem. J Sched 11:49–58 es_ES
dc.description.references Tanaka S, Fujikuma S, Araki M (2009) An exact algorithm for single-machine scheduling without machine idle time. J Sched 12:575–593 es_ES
dc.description.references Webster ST (1997) The complexity of scheduling job families about a common due date. Oper Res Lett 20:65–74 es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem