TY  - CONF
ID  - library_repository621
UR  - https://library.oum.edu.my/repository/621/
A1  - Kanesan , Muthusamy
A1  - Ishii, Hiroaki
Y1  - 2000///
N2  - Most of scheduling problems considered so far treats non-flexible due-dates only. In this paper, we consider scheduling problem with fuzzy due-dates on unrelated parallel processors. There are m processors and n jobs to be processed on these processors. A membership function is associated with each job, which describes the degree of satisfaction with respect to completion time of the job. The objective is to minimize the maximum completion time (makespan) and minimize the dissatisfaction with respect to completion times of jobs. We propose an efficient algorithm for this problem. (Abstract by authors)
KW  - Unrelated parallel processors; Fuzzy due-dates; Makespan
TI  - Scheduling Problem with Fuzzy Due-dates on Unrelated Parallel Processors
AV  - none
M2  - Singapore
T2  - The Fifth Conference of the Association of Asian-Pacific Operational Research Societies within IFORS, APORS'2000
ER  -