Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Kanesan , Muthusamy, Ishii, Hiroaki, Vlach, Milan
Format: Conference or Workshop Item
Published: 1999
Subjects:
TS Manufactures
Online Access:http://library.oum.edu.my/repository/615/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.oum.615
record_format eprints
spelling my.oum.6152011-10-21T07:05:42Z Scheduling problems with generalized precedence relations Kanesan , Muthusamy Ishii, Hiroaki Vlach, Milan TS Manufactures 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) 1999 Conference or Workshop Item PeerReviewed Kanesan , Muthusamy and Ishii, Hiroaki and Vlach, Milan (1999) Scheduling problems with generalized precedence relations. In: The Second Asia-Pacific Conference on Industrial Engineering and Management Systems, Kanazawa, Japan, Kanazawa, Japan. (Submitted) http://library.oum.edu.my/repository/615/
institution Open University Malaysia
building OUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Open University Malaysia
content_source OUM Knowledge Repository
url_provider http://library.oum.edu.my/repository/
topic TS Manufactures
spellingShingle TS Manufactures
Kanesan , Muthusamy
Ishii, Hiroaki
Vlach, Milan
Scheduling problems with generalized precedence relations
description 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)
format Conference or Workshop Item
author Kanesan , Muthusamy
Ishii, Hiroaki
Vlach, Milan
author_facet Kanesan , Muthusamy
Ishii, Hiroaki
Vlach, Milan
author_sort Kanesan , Muthusamy
title Scheduling problems with generalized precedence relations
title_short Scheduling problems with generalized precedence relations
title_full Scheduling problems with generalized precedence relations
title_fullStr Scheduling problems with generalized precedence relations
title_full_unstemmed Scheduling problems with generalized precedence relations
title_sort scheduling problems with generalized precedence relations
publishDate 1999
url http://library.oum.edu.my/repository/615/
_version_ 1644309024518176768
score 13.244368

Similar Items