Improved lower bounds 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: Journal of the Operational Research Society

Vol. 56 Nº 5

Páginas: 604-612

ISSN: 0160-5682

Editora: Taylor & Francis

Indexação

ISI Web of Knowledge - 15 Citações

ISI Web of Science

Scopus - 17 Citações

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Biotecnologia industrial

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

Outras Informações

ID Authenticus: P-000-3NZ

DOI: 10.1057/palgrave.jors.2601865

Abstract (EN): In this paper, we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower bounds previously developed for this problem are based on Lagrangean relaxation and the multiplier adjustment method, and require an initial sequence. We investigate the sensitivity of the lower bounds to the initial sequence, and experiment with different dispatch rules and some dominance conditions. The computational results show that it is possible to obtain improved lower bounds by using a better initial sequence. The lower bounds are also incorporated in a branch-and-bound algorithm, and the computational tests show that one of the new lower bounds has the best performance for larger instances.

Idioma: Inglês

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

Nº de páginas: 9