Efficient polynomial algorithms for special cases of weighted early/tardy scheduling with release dates and a common due date

Pesquisa Operacional

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

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

关键词: scheduling;    early/tardy;    release dates;    sequenciamento;    early/tardy;    datas de disponibilidade;   

DOI  :  10.1590/S0101-74382003000300004

来源: SciELO

【 摘 要 】

In this paper we consider a single machine scheduling problem with integer release dates and a common due date. The objective is to minimise the weighted sum of the jobs' earliness and tardiness costs. We present an efficient polynomial algorithm for the unit processing time case. We also show how to calculate, for the general case, the minimum non-restrictive due date.

【 授权许可】

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