Title of article :
Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences Original Research Article
Author/Authors :
Stanis?aw Gawiejnowicz، نويسنده , , Wies?aw Kurc، نويسنده , , Lidia Pankowska، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2006
Pages :
17
From page :
2150
To page :
2166
Abstract :
In the paper a single machine time-dependent scheduling problem is considered. The processing time image of each job is described by a function of the starting time t of the job, image, where the job deterioration rate image for image and image. Jobs are nonpreemptable and independent, there are no ready times and no deadlines. The criterion of optimality of a schedule is the total completion time.
Keywords :
Deteriorating jobs , Total completion time , Approximate algorithm , Single machine scheduling
Journal title :
Discrete Applied Mathematics
Serial Year :
2006
Journal title :
Discrete Applied Mathematics
Record number :
886357
Link To Document :
بازگشت