TY  - CONF
N1  - Available in Proceedings of The Second Asia-Pacific Conference on Industrial Engineering and Management Systems, Kanazawa, Japan.
ID  - library_repository615
UR  - https://library.oum.edu.my/repository/615/
A1  - Kanesan , Muthusamy
A1  - Ishii, Hiroaki
A1  - Vlach, Milan
Y1  - 1999///
N2  - In this paper, we consider the single machine scheduling problem with generalized precedence relations. A precedence delay specifies a time delay between the completion of job Ji and start of job Jj must be at least lij when job Ji  precedes job Jj. The fuzzy precedence relation relaxes the precedence restriction and it reflects the satisfaction level with respect to the processing order between two jobs. We combine some special cases of the generalized precedence relation with fuzzy precedence relation. The objective is to minimize the makespan and minimal satisfaction level with respect to fuzzy precedence relation and fuzzy precedence delay to be maximized. We present an efficient algorithm for this problem. (Abstract by authors)
KW  - Scheduling
KW  -  Single Machine 
KW  -  Fuzzy Precedence Relation
KW  -  Fuzzy Precedence Delay
KW  -  Makespan
TI  - Scheduling problems with generalized precedence relations
M2  - Kanazawa, Japan
AV  - none
T2  - The Second Asia-Pacific Conference on Industrial Engineering and Management Systems, Kanazawa, Japan
ER  -