Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

Autor
Vila, M.; Pereira, J.
Tipus d'activitat
Article en revista
Revista
Computers & operations research
Data de publicació
2013-07
Volum
40
Número
7
Pàgina inicial
1819
Pàgina final
1828
DOI
https://doi.org/10.1016/j.cor.2013.01.019 Obrir en finestra nova
Resum
The present paper studies the single machine, no-idle-time scheduling problem with a weighted quadratic earliness and tardiness objective. We investigate the relationship between this problem and the assignment problem, and we derive two lower bounds and several heuristic procedures based on this relationship. Furthermore, the applicability of the time-indexed integer programming formulation is investigated. The results of a computational experiment on a set of randomly generated instances show ...
Paraules clau
Assignment problem, Dynamic programming, Scheduling, Single machine, Time-indexed formulation
Grup de recerca
OPE-PROTHIUS - Organització de la Producció en Tallers Híbrids

Participants