Minimizing the weighted sum of squared tardiness on a single machine

• Type: Article in International Scientific Journal
• Date: 2012

Authors

Jeffrey Schaller (Author) Other; Jorge M S Valente (Author) FEP

Journal

Title: Computers and Operations Research

Vol. 39 No. 5

Pages: 919-928

ISSN: 0305-0548

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 10 Citations

ISI Web of Science

Scopus - 12 Citations

Scientific classification

FOS: Engineering and technology > Civil engineering

CORDIS: Social sciences > Economics > Management studies

Other information

Authenticus ID: 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 10