Scheduling problems with generalized precedence relations
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 preceden...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
1999
|
| Subjects: | |
| Online Access: | http://library.oum.edu.my/repository/615/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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) |
|---|