Title of article
Due-date assignment and maintenance activity scheduling problem
Author/Authors
Gur Mosheiov، نويسنده , , Gur and Oron، نويسنده , , Daniel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
5
From page
1053
To page
1057
Abstract
In the scheduling problem addressed in this note we have to determine: (i) the job sequence, (ii) the (common) due-date, and (iii) the location of a rate modifying (maintenance) activity. Jobs scheduled before (after) the due-date are penalized according to their earliness (tardiness) value. The processing time of a job scheduled after the maintenance activity decreases by a job-dependent factor. The objective is minimum total earliness, tardiness and due-date cost. We introduce a polynomial ( O ( n 4 ) ) solution for the problem.
Keywords
Scheduling , Single machine , Due-date assignment , Earliness–tardiness , Rate modifying activity
Journal title
Mathematical and Computer Modelling
Serial Year
2006
Journal title
Mathematical and Computer Modelling
Record number
1594327
Link To Document