Minimizing the weighted sum of squared tardiness on a single machine

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

Autores

Jeffrey Schaller (Autor) Outra; Jorge M S Valente (Autor) FEP

Revista

Título: Computers and Operations Research

Vol. 39 Nº 5

Páginas: 919-928

ISSN: 0305-0548

Editora: Elsevier

Indexação

ISI Web of Knowledge - 10 Citações

ISI Web of Science

Scopus - 12 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-002-AYQ

DOI: 10.1016/j.cor.2011.07.018

Abstract (EN): This paper considers a problem in which there is a set of jobs to be sequenced on a single machine. Each job has a weight and the objective is to sequence the jobs to minimize total weighted squared tardiness. A branch-and-bound algorithm is developed for optimally solving the problem. Several dominance conditions are presented for possible inclusion in the branch-and-bound algorithm. The dominance conditions are included in the branch-and-bound algorithm, which is tested on randomly generated problems of various numbers of jobs, due date tightness and due date ranges. The results show that the dominance conditions dramatically improve the efficiency of the branch-and-bound algorithm.

Idioma: Inglês

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

Nº de páginas: 10