.png){kind=icon}
Return
An improved earliness-tardiness timing algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2005.11.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Earliness-tardiness criteria with distinct due dates usually induce NP-complete problems. Researchers have focused on particular cases like the timing problem, which is to look for the optimal schedule when the jobs sequence is already known. These timing algorithms are very useful since they can be used in more complex procedures. In the first part of this paper we provide the most efficient and fairly general algorithm to solve the one-machine timing problem. It is then adapted to a permutation flow shop problem. (c) 2005 Elsevier Ltd. All rights reserved.
Keywords:
scheduling
earliness-tardiness
timing algorithm
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
A Retrospective Observational Single-Centre Study on the Burden of Immune Thrombocytopenia (ITP).png)
Onkologie
OAAI
OnkologieIF0
OAAIShareSaveOverexpression of Gremlin-1 in Patients with Loeys-Dietz Syndrome: Implications on Pathophysiology and Early Disease DetectionPLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSaveRadiation induced cytochrome c release causes loss of rat colonic fluid absorption by damage to crypts and pericryptal myofibroblastsGutOAAI
GutIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more