Digital Signal Processing


Single Machine Scheduling Problem under Fuzzy Processing Time and Fuzzy Due Dates

Authors: Vikas S. Jadhav, V. H. Bajaj

In this paper, we propose n-jobs to be processed on Single Machine Scheduling Problem (SMSP) involving fuzzy processing time and fuzzy due dates. The different due dates for each job be considered which meet the demand of customer with more satisfaction level. The main objective of this paper is the total penalty cost to be minimum in the schedule of the jobs on the single machine. This cost is composed of the total earliness and the total tardiness cost. Here, an algorithm is developed using Average High Ranking Method (AHRM) which minimizes the total penalty cost due to earliness (lateness) of jobs in fuzzy environment. Finally, numerical example is given to illustrate proposed method.

Comments: 8 Pages.

Download: PDF

Submission history

[v1] 2012-08-19 00:08:13

Unique-IP document downloads: 611 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus