Automated Scheduling

Fuzzy Scheduling

Literature 1. Fuzzy sets, uncertainty, and information, G. J. Klir and T.A. Folger. Englewood Cliffs, N.J : Prentice Hall, 1988. 2. Scheduling Under Fuzziness, R. Slowinski, and M. Hapke, (eds), Physica-Verlag, A Springer-Verlag Company, 2000, pages 113-143 3. Fuzzy Job Shop Scheduling with Lot-sizing, S. Petrovic, C. Fayad, D. Petrovic, E. Burke, G. Kendall, Annals of Operations Research, Vol. 159, No. 1, 2008, pages 275-292.

Contents 1. Introduction to Fuzzy Sets 2. Application of Fuzzy Sets to a Real-world Scheduling Problem Modelling of uncertain scheduling parameters and constraints Approximate reasoning Satisfaction grades

Introduction to Fuzzy Sets

crisp versus fuzzy more-or-less type

Classical set:

xA

or

xA

dichotomous yes-or-no-type

Example. A - set of even natural numbers less than 10 A = {2, 4, 6, 8} A(x) degree of membership of x in A

conventional logic: statement is true "classical" set theory: an element belongs to a set or not optimisation: a solution is feasible or not Basic foundations of fuzzy sets: Lotfi Zadeh, Fuzzy Sets, Information and Control, Vol. 8, 1965

A(1) = 0 A(2) = 1
...

or

A ( x) =

1 if x A 0 if x A

~ Fuzzy sets A :

~ A ( x) takes on values in the range [0, ],

is usually 1

~ ~ A = { ( x, A ( x ) ) | x X }
3 4

Examples.
~ A

Fuzzy sets and probability measure two bottles of liquid first bottle has membership 0.91 in the fuzzy set of all drinkable liquids 10 15 x second bottle probability that it contains drinkable liquids is 0.91

= "real number close to 10"

~ A ( x)

1.0

0 5
~ A

Which bottle would you choose?

= integers close to 10 = { (7, 0.1), (8, 0.5), (9, 0.8), (10, 1), (11, 0.8), (12, 0.5), (13, 0.1)

Prof S.Petrovic, School of Computer Science, University of Nottingham

Automated Scheduling

Application of Fuzzy Sets to Scheduling Problems

A real-world scheduling problem

Sherwood Press Ltd, Nottingham, UK

In theory, there is no difference between theory and practice. But, in practice, there is. Jan van de Sneptscheut, California Institute of Technology

Machines: 18 Work centres: 7

for printing, cutting, folding, card-inserting, embossing and debossing, gathering, and finishing (includes stitching, trimming and packaging)
Printing

Job shop problem

J1,...,JN M1,...,MM

jobs machines

precedence constraints operation (i,j) the processing of job Jj on machine Mi pij

Embossing Cutting

processing time of operation (i,j) release date of job Jj due date of job Jj weighting coefficient assigned to job Jj

rj
Embossing

Cutting

dj wj

Folding

Setup time is required when the family of jobs to be processed on the printing machine changes Lot sizing of jobs
9 10

Packaging

1. Modelling of uncertain scheduling parameters and constraints Task: Find a non-preemptive sequence of operations of N jobs on each of M machines subject to the precedence constraints. Objectives: minimise the average weighted tardiness minimise the number of tardy jobs minimise the total setup time minimise the total idle time of machines minimise the total flow time Most often imprecise or incomplete are: fuzzy due dates fuzzy processing times
Fuzzy processing times of jobs
~ij p
1.0

~ pij

t 0
11

pijl

pijm

piju
12

Processing time of job Jj on machine Mi is about pijm.

Prof S.Petrovic, School of Computer Science, University of Nottingham

Automated Scheduling

Fuzzy Constraints

Fuzzy Due Date dj Cj due date of job j completion time of job j

1 if C j d j

C(x) satisfaction grade of the solution x

crisp constraint
C ( x) =
1 if x satisfies constraint C 0 if x violates constraint C

satisfaction grade j (C j ) = 0 if C > d j j

fuzzy constraint

C ( x) = (0,1) if x partially satisfies constraint C

0 if x violates constraint C

if x complitely satisfies constraint C

j(Cj)
1.0

dj

Cj

13

14

j(Cj)
1.0

Example: Fuzzy due dates of jobs

~ d j
1.0

~ dj

djL

dj U

Cj
Priority 1 Priority 3 Priority 2 0 dj dj +2 dj +7 t (in days)

j(Cj)
1.0

0 eL eU dL j j j

djU

Cj
15 16

2. Approximate Reasoning Approximate Reasoning is the process by which a possible imprecise conclusion is deduced from a collection of imprecise premises. Fuzzy IF-THEN Production Rules

IF part of the rules: Premise variables size of the job slack of the job workload on the shop floor priority of the job THEN part of the rules: Conclusion variable change of lot
described by Large Negative, Medium Negative, Small, Medium Positive, Large Positive.
18

described by Small, Medium and Large Small, Medium and Large Not Large and Large crisp numbers: 1,2 or 3

17

Prof S.Petrovic, School of Computer Science, University of Nottingham

Automated Scheduling

Small
1.0

Lingustic terms for size of the job

Medium Large

Lingustic terms for change of lot

Medium Negative Large Negative

1.0

Medium Positive

Small

Large Positive

55

25 30 25 30

60 60

80 100 100 120number of items number of items

(in thousands) (in thousands)

19

-20

20 percentage of the

size of the job

20

IF size of job is Small THEN change of lot is Large Positive IF size of job is Medium THEN change of lot is Small IF size of job is Large THEN change of lot is Large Negative
IF slack of job is Small THEN change of lot is Large Positive IF slack of job is Medium THEN change of lot is Small IF slack of job is Large THEN change of lot is Large Negative IF workload is Not Large THEN change of lot is Medium Positive IF workload is Large THEN change of lot is Medium Negative IF priority of job is 3 THEN change of lot is Medium Negative IF priority of job is 2 THEN change of lot is Medium Positive IF priority of job is 1 THEN change of lot is Small

1.0 Small Medium Large

Medium Medium Positive Large Negative Small Negative 1.0

Large Positive

5 25 30 60

80 100 120number of items (in thousands)

-20

20 percentage of the

size of the job

crisp input

crisp output (defuzzification)

IF size of job is Small THEN change of lot is Large Positive IF size of job is Medium THEN change of lot is Small IF size of job is Large THEN change of lot is Large Negative
21 22

3. Satisfaction grades Fuzzy Rules + Observed System State size of job is A - crisp Fuzzy Advice Change of lot is C - fuzzy Objectives 1.the average weighted tardiness 2.the number of tardy jobs 3.the total setup time 4.the total idle time of machines 5.the total flow time Satisfaction grades take value from [0,1] 0 full dissatisfaction 1 full satisfaction Genetic algorithm: fitness function is defined as the average satisfaction grade of all objectives.

DEFUZZIFICATION

23

24

Prof S.Petrovic, School of Computer Science, University of Nottingham

Automated Scheduling

How to measure tardiness of jobs with fuzzy completion times and fuzzy due dates?

Example: Satisfaction grade of the number of tardy jobs

Approach based on possibility measure (Dubois and Prade, 1988)

(t)
~
~

S NT
1

0
0

NT
Max NT

Approach based on intersection area (Sakawa and Kubota, 2000)

(t) 1

~ ~ ~ area (C j d j ) / area (C j )

0
25

t
26

Summary

Fuzzy sets and logic can be successfully used to treat various types of uncertainty that exist in scheduling problems. Fuzzy duedate and fuzzy processing time are typical examples of such uncertainty. Many conventional scheduling problems could be reformulated as fuzzy scheduling problems.

27

Prof S.Petrovic, School of Computer Science, University of Nottingham