A note on scheduling on a single processor with variable speed

Pesquisa Operacional

Jorge M. S. Valente¹  Rui A. F. S. Alves¹ 

[1] ,Universidade do Porto Faculdade de Economia ,Portugal

关键词: scheduling;    variable speed;    common due date;    sequenciamento;    velocidade variável;    data de entrega comum;   

DOI  :  10.1590/S0101-74382003000300005

来源: SciELO

【 摘 要 】

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.

【 授权许可】

CC BY   
 All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License