A note on scheduling on a single processor with variable speed

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

Authors

Jorge M. S. Valente (Author) FEP; Rui A. F. S. Alves (Author) FEP

Journal

Title: Pesquisa Operacional

Vol. 70

Pages: 457-462

ISSN: 0101-7438

Publisher: Sociedade Brasileira de Pesquisa Operacional

Indexing

Scopus

Scientific classification

FOS: Social sciences > Economics and Business

CORDIS: Social sciences > Economics > Management studies > Production management

Other information

Authenticus ID: P-011-5P0

DOI: 10.1590/s0101-74382003000300005

Abstract (EN): <jats:p>Alidaee and Ahmadian considered a single machine scheduling problem with varying processing times, and presented a polynomial algorithm that minimizes the sum of absolute deviations of jobs' completion times from a common due date. In this short note we remark that it is possible to eliminate one of the algorithm steps, therefore obtaining a more efficient procedure. We also show that the approach used can easily be generalized to the problem with different weights for earliness and tardiness.</jats:p>

Language: English

Type (Professor's evaluation): Scientific