Local and global dominance conditions for the weighted earliness scheduling problem with no idle time

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

Authors

Jorge M S Valente (Author) FEP

Journal

Title: Computers and Industrial Engineering

Vol. 51 No. 4

Pages: 765-780

ISSN: 0360-8352

Publisher: Elsevier

Indexing

ISI Web of Knowledge - 5 Citations

ISI Web of Science

Scopus - 5 Citations

Scientific classification

FOS: Engineering and technology > Civil engineering

CORDIS: Social sciences > Economics > Management studies

Other information

Authenticus ID: P-004-FMJ

DOI: 10.1016/j.cie.2006.08.019

Abstract (EN): In this paper, we present dominance conditions for the single machine weighted earliness scheduling problem with no idle time. We also propose an algorithm that can be used to improve upper bounds for the weighted earliness criterion and lower bounds for an earliness/tardiness problem. The computational tests show that the algorithm is superior to an initial heuristic schedule and an existing adjacency condition.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 16