Improved heuristics for the early/tardy scheduling problem with no idle time

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

Autores

Valente, JMS (Autor) FEP; Alves, RAFS (Autor) FEP

Revista

Título: Computers and Operations Research

Vol. 32

Páginas: 557-569

ISSN: 0305-0548

Editora: Elsevier

Indexação

ISI Web of Knowledge - 36 Citações

ISI Web of Science

Scopus - 41 Citações

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-000-4D3

DOI: 10.1016/j.cor.2003.08.003

Abstract (EN): A dispatch rule and a greedy procedure are presented for the single machine earliness/tardiness scheduling problem with no idle time and compared with the best of the existing dispatch rules. Both dispatch rules use a lookahead parameter that had previously been set at a fixed value. We develop functions that map some instance statistics into appropriate values for that parameter. We also consider the use of dominance rules to improve the solutions obtained by the heuristics. The computational results show that the function-based versions of the heuristics outperform their fixed value counterparts and that the use of the dominance rules can indeed improve solution quality with little additional computational effort.

Idioma: Inglês

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

Nº de páginas: 13