Theory and MethodologyOptimal fuzzy counterparts of scheduling rules
Section snippets
Introduction and scope
The purpose of this paper is to investigate the necessary conditions for optimality of fuzzy counterparts of classical optimal scheduling rules, such as shortest processing time (SPT) and earliest due date (EDD). Essentially, any element of a scheduling problem may be uncertain. Rather than following the usual procedure of fuzzifying a crisp optimum scheduling rule, we examine the optimization of fuzzy schedules by using precise definitions of fuzzy ranking and dominance.
Fuzzy logic, which was
Fuzzy ranking and dominance
In all fuzzy scheduling problems, a fuzzy dominance relation needs to be defined in order to obtain a sequence of jobs. In mathematical programming solutions, this dominance relation is embedded in the problem formulation, but most of the fuzzy scheduling procedures developed to date simply fuzzify the crisp optimal rules and use a fuzzy dominance relation to rank the schedulable jobs, without justifying that fuzzy optimality has been reached. In this section, we will define the concept of
Fuzzy scheduling
Here, we assume that every element of a scheduling system may be fuzzy. Let j=1,…,J denote the jobs to be scheduled, the fuzzy processing times, the fuzzy due dates, the fuzzy completion times, where and subscript [j] is used to denote the job sequenced in the jth place, the fuzzy lateness, where the maximum fuzzy lateness, where the fuzzy tardiness, where the maximum fuzzy tardiness,
Numerical example
In this section, we use a GLRFN [3] with L(z)=1−zpL and R(z)=1−zpR. Thus, a GLRFN of this type can be represented by the six-tuple (pL,pR,a1(0),a1(1),a2(1),a2(0)). Table 2 shows the fuzzy data for eight jobs to be sequenced. Since the data involve GLRFN, the fuzzy mean will not necessarily satisfy consistency-I, therefore it will result in a heuristic approximation for FWSCPT, CWSFPT, SFPT, EFDD, LNFDD rules; on the other hand, for this case, F0 i.e. F1 with will yield fuzzy
Summary and conclusions
After defining necessary conditions, namely linearity, invertibility, multiplicity, additivity, consistency I and -II for the fuzzy optimality of scheduling rules, properties of AC family of ranking functions are investigated for the purpose of fuzzy scheduling. Two scenarios, weak and strong dominance, are distinguished and it is shown that independent of the shape of the membership function, under strong dominance, the AC family satisfies consistency-I. In the weak dominance case, which is
Acknowledgements
The research in this paper has been supported in part by US National Science Foundation. The authors would like to thank to the referees and Ágnes Galambosi for their constructive suggestions.
References (29)
- et al.
A fuzzy-linguistic approach to a multicriteria sequencing problem
European Journal of Operational Research
(1996) - et al.
A review of some methods for ranking fuzzy sets
Fuzzy Sets and Systems
(1985) - et al.
Membership functions, some mathematical programming models and production scheduling
Fuzzy Sets and Systems
(1982) - et al.
Ranking and defuzzification methods based on area compensation
Fuzzy Sets and Systems
(1996) - et al.
One machine scheduling problem with fuzzy due dates
European Journal of Operational Research
(1994) - et al.
Local search algorithms for flow shop scheduling with fuzzy due dates
International Journal of Production Economics
(1994) - et al.
Two scheduling problems with fuzzy due dates
Fuzzy Sets and Systems
(1992) - et al.
Single machine scheduling with fuzzy precedence relation
European Journal of Operational Research
(1995) - et al.
Fuzzy job shop scheduling
International Journal of Production Economics
(1996) - et al.
Job sequencing with fuzzy processing times
Computers and Mathematics with Applications
(1990)
Fuzzy job sequencing for a flow shop
European Journal of Operational Research
Scheduling arrivals to a production system in a fuzzy environment
European Journal of Operational Research
An effective method for solving flow shop scheduling problems with fuzzy processing times
Computers and Industrial Engineering
Fuzzy sets
Information Control
Cited by (35)
Robust (min–max regret) single machine scheduling with interval processing times and total tardiness criterion
2020, Computers and Industrial EngineeringCitation Excerpt :Broadly speaking, four main approaches exist to deal with parameter uncertainty to mitigate their negative impact on the shop floor performance (Chang et al., 2019, 2017; Niu et al., 2019; Yue et al., 2018). These four kinds of approaches are Stochastic Programming (SP) (e.g. Prekopa, 1995), fuzzy theory (FT) (e.g. Özelkan & Duckstein, 1999), robust optimization (RO) (e.g. Kouvelis & Yu, 1997), and distributionally robust optimization (DRO) (e.g. Delage & Ye, 2010; Zhang et al., 2018). Table 1 summarizes the characteristics, merits, and drawbacks of each of the four approaches (Wang et al., 2020).
Distributionally robust scheduling on parallel machines under moment uncertainty
2019, European Journal of Operational ResearchCitation Excerpt :Among existing literature, there are mainly three different ways to utilize the fuzzy theories. The first one fuzzifies directly the classical scheduling rules or the deterministic scheduling models (Balin, 2011; Mok, Kwong, & Wong, 2007; Özelkan & Duckstein, 1999), where the uncertain parameters are usually described as fuzzy numbers, and appropriate fuzzy ranking and defuzzification methods are to be determined. The second one does not represent uncertainties by fuzzy sets, but uses fuzzy logic to design decision support systems (Petrovic & Duenas, 2006) or combine different objective functions (Raja, Arumugam, & Selladurai, 2008).
Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness
2017, Applied Soft Computing JournalCitation Excerpt :We regret for any significant paper unintentionally left out below. To investigate fuzzy optimality for classical scheduling rules such as SPT and EDD, Özelkan and Duckstein [21] define a number of fuzzy scheduling rules. After defining necessary conditions, namely linearity, invertibility, multiplicity, additivity, consistency-I and -II for the fuzzy optimality of scheduling rules, properties of area compensation (AC) family of ranking functions are investigated for the purpose of fuzzy scheduling.
Preference ratio-based maximum operator approximation and its application in fuzzy flow shop scheduling
2008, Applied Soft Computing JournalParallel machine scheduling models with fuzzy processing times
2004, Information SciencesPossible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters
2004, Fuzzy Sets and Systems
- 1
E-mail: [email protected]