By Topic

A single machine preemptive scheduling problem with arbitrary release dates and fuzzy due dates

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xie Yuan ; Sch. of Electr., Shanghai Dianji Univ., Shanghai, China ; Linlin Ou

Preemptive scheduling problem of a single machine subject to arbitrary release dates under uncertain situation is discussed. The release dates of jobs are independence and different with each other. Uncertainty means due dates are not accurate, which can be described by fuzzy set. The memberships of fuzzy due dates denote grade of satisfaction of completion times of corresponding jobs. The objective of the problem is to find an optimal schedule which maximizes the minimal grade of satisfaction of jobs completion times with respect to fuzzy due dates. By extending the method of corresponding problem with accurate due dates into fuzzy situation for the problem, an O(n2) algorithm is presented.

Published in:

Computing, Communication, Control, and Management, 2009. CCCM 2009. ISECS International Colloquium on  (Volume:2 )

Date of Conference:

8-9 Aug. 2009