Scheduling Problem with Fuzzy Due-dates on Unrelated Parallel Processors

Kanesan , Muthusamy and Ishii, Hiroaki (2000) Scheduling Problem with Fuzzy Due-dates on Unrelated Parallel Processors. In: The Fifth Conference of the Association of Asian-Pacific Operational Research Societies within IFORS, APORS'2000, Singapore.

Full text not available from this repository.


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)

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Unrelated parallel processors; Fuzzy due-dates; Makespan
Subjects: T Technology > TS Manufactures
Divisions: Faculty of Science and Technology
Depositing User: Shahril Effendi Ibrahim
Date Deposited: 03 Nov 2011 06:05
Last Modified: 03 Nov 2011 06:05

Actions (login required)

View Item View Item