Scheduling Problem with Fuzzy Due-dates on Unrelated Parallel Processors
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2000
|
| Subjects: | |
| Online Access: | http://library.oum.edu.my/repository/621/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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) |
|---|