Heuristics for the single machine scheduling problem with early and quadratic tardy penalties

• Tipo: Artigo em Revista Científica Internacional
• Data: 2007

Autores

Jorge M S Valente (Autor) FEP

Revista

Título: European Journal of Industrial Engineering

Vol. 1

Páginas: 431-448

ISSN: 1751-5254

Editora: Inderscience Publishers

Indexação

ISI Web of Knowledge - 24 Citações

ISI Web of Science

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Engenharia civil

CORDIS: Ciências Sociais > Economia > Estudos de gestão

Outras Informações

ID Authenticus: P-004-D3J

DOI: 10.1504/ejie.2007.015391

Abstract (EN): This paper considers the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. Several dispatching heuristics are proposed, and their performance is analysed on a wide range of instances. The heuristics include simple scheduling rules, as well as a procedure that takes advantage of the strengths of these rules, Linear early/quadratic tardy dispatching rules are also considered, as well as a greedy-type procedure. Extensive experiments are performed to determine appropriate values for the parameters required by some of the heuristics. The computational tests show that the best results are given by the linear early/quadratic tardy dispatching rule. This procedure is also quite efficient, and can quickly solve even very large instances. [Received 15 December 2006; Revised 20 July 2007; Accepted 24 July 2007]

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 18