modeling: parameters
DESCRIPTION
Modeling: Parameters. Typical scheduling parameters: Number of resources ( m machines, operators) Configuration and layout Resource capabilities Number of jobs ( n ) Job processing times ( pij ) Job release and due dates (resp. rij and dij ) Job weight ( wij ) or priority - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/1.jpg)
Production Scheduling P.C. Chang, IEM, YZU.1
Modeling: Parameters
• Typical scheduling parameters:
• Number of resources (m machines, operators)• Configuration and layout• Resource capabilities• Number of jobs (n)• Job processing times (pij)• Job release and due dates (resp. rij and dij )• Job weight (wij ) or priority• Setup times
![Page 2: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/2.jpg)
Production Scheduling P.C. Chang, IEM, YZU.2
Modeling: Objective function
• Objectives and performance measures:
• Throughput, makespan (Cmax, weighted sum)• Due date related objectives (Lmax, Tmax, ΣwjTj)• Work-in-process (WIP), lead time (response time), finishe
d inventory• Total setup time• Penalties due to lateness (ΣwjLj)• Idle time• Yield
• Multiple objectives may be used with weights
![Page 3: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/3.jpg)
Production Scheduling P.C. Chang, IEM, YZU.3
Modeling: Constraints
• Precedence constraints (linear vs. network)• Routing constraints• Material handling constraints• (Sequence dependent) Setup times• Transport times• Preemption• Machine eligibility• Tooling/resource constraints• Personnel (capability) scheduling constraints• Storage/waiting constraints• Resource capacity constraints
![Page 4: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/4.jpg)
Production Scheduling P.C. Chang, IEM, YZU.4
Machine configurations:
• Single-machine vs. parallel-machine
• Flow shop vs. job shop
Processing characteristics:• Sequence dependent setup times and costs
– length of setup depends on jobs
– sijk: setup time for processing job j after k on machine i
– costs: waste of material, labor
• Preemptions
– interrupt the processing of one job to process another with a higher priority
![Page 5: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/5.jpg)
Production Scheduling P.C. Chang, IEM, YZU.5
Generic notation of scheduling problem
• Machine Job Objective• characteristics characteristics function
• for example:• Pm | rj, prmp | ΣwjCj (parallel machines)• 1 | sjk | Cmax (sequence dependent• setup / traveling salesma
n)• Q2 | prec | ΣwjTj (2 machines w. different speed,
precedence rel., weighted tardiness)
![Page 6: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/6.jpg)
Production Scheduling P.C. Chang, IEM, YZU.6
Scheduling models
• Deterministic models– input matches realization
• vs.
• Stochastic models– distributions of processing times, release and du
e dates, etc. known in advance– outcome/realization of distribution known at co
mpletion
![Page 7: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/7.jpg)
Production Scheduling P.C. Chang, IEM, YZU.7
Symbol
: Job number
: Machine number
: Arrival time
: Processing time of job : Completion time of job
: due date
T : Tardiness
E : Earliness
ia
ip
ic
ij
ii
id
![Page 8: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/8.jpg)
Production Scheduling P.C. Chang, IEM, YZU.8
Static V.S. Dynamic
Static
Assume all the jobs are ready at the beginning which means ai=0
Dynamic
Each job with a different arrival time. Which ai≠0
![Page 9: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/9.jpg)
Production Scheduling P.C. Chang, IEM, YZU.9
Large Scale Problem (man-made)
available solution space
unavailable solution space
Upper Bound
Lower Bound
approach
approach
Optimum
(Heuristic)
(Release Constraints)
![Page 10: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/10.jpg)
Production Scheduling P.C. Chang, IEM, YZU.10
Performance Measure
1. Max Completion Time (Makspan)
Cmax = Max Ci = C6
2. Minimize Inventory
fi : Reduce Inv.
fi = Ci – ai ( Static Problem : ai=0)
3. Satisfy Due Date
Tardiness = Max(Ci-di , 0 )
Earliness = Max(di-Ci , 0 )
JIT = Ci-di
4. Bi-criteria Multi-Objective
(flow time = waiting time + process time)
![Page 11: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/11.jpg)
Production Scheduling P.C. Chang, IEM, YZU.11
Compute flow time
4321 fffffi 38131285
41 2 3 0 5 8 12 13
5 5 5 53 3 3
4 41
45332411
5 3 4 1
1234 4321 ppppfi
]1[ inpf ii
![Page 12: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/12.jpg)
Production Scheduling P.C. Chang, IEM, YZU.12
Gantt Chart
64512 3
d3 c3 d1 c2 d2 c1d4 c5 c4 d5 d6
c6
=
tardiness
c4 > d4
jobs are
ready
flow time
c2 – a2
![Page 13: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/13.jpg)
Production Scheduling P.C. Chang, IEM, YZU.13
Scheduling Problem Representation
4 / 1 / (n / m / o )
# job# machine
objective function
f
max
max
L
T
T
f
.....
![Page 14: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/14.jpg)
Production Scheduling P.C. Chang, IEM, YZU.14
Example:
A factory has receive 4 different orders as follows
i pi di
1 5 9
2 3 4
3 4 7
4 1 3
Please assign the production sequence of the 4 jobs to satisfy:
1. Due Date2. Min Inventory
![Page 15: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/15.jpg)
Production Scheduling P.C. Chang, IEM, YZU.15
Sol.
1. Using FCFS (First come first serve)
41 2 3 0 5 8 12 13
38131285
13
12
8
5
4444
3333
2222
1111
if
acfc
acfc
acfc
acfc
19
100,313
50,712
40,48
00,40,
4
3
2
111
iT
MaxT
MaxT
MaxT
MaxdcMaxT
1-2-3-4
![Page 16: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/16.jpg)
Production Scheduling P.C. Chang, IEM, YZU.16
Sol.
2. Using EDD (Earliest Due Date)
4 12 3 0 1 4 8 13
2613841
13
8
4
1
44
33
22
11
if
fc
fc
fc
fc
5
40,913
10,78
00,44
00,31
4
3
2
1
iT
MaxT
MaxT
MaxT
MaxT
4-2-3-1
![Page 17: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/17.jpg)
Production Scheduling P.C. Chang, IEM, YZU.17
Sol.
3. Using SPT (Shortest Processing Time)
The same with EDD Optimum
4 12 3 0 1 4 8 13
4-2-3-1
EDD – Due Date – Tmax SPT – Inventory - Flow time
![Page 18: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/18.jpg)
Production Scheduling P.C. Chang, IEM, YZU.18
Bi-criterion
maxT
if
Frontier
EDD
SPT
1
'
21
2211
max2
1
OOO
TO
fO i
![Page 19: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/19.jpg)
Production Scheduling P.C. Chang, IEM, YZU.19
HW.
5 / 1 /
i pi di
1 3 13
2 2 8
3 5 9
4 4 7
5 6 10
ii fT 1
Draw the Frontier when 9.0~1.0
![Page 20: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/20.jpg)
Production Scheduling P.C. Chang, IEM, YZU.20
Dynamic Problem Example:
4 / 1 /
i ai pi di
1 3 5 9
2 5 3 4
3 2 4 7
4 4 1 3
if
![Page 21: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/21.jpg)
Production Scheduling P.C. Chang, IEM, YZU.21
Dynamic Problem
0
4321
43214321321211
4321
43214321
4321
222
111
1234
,,,
)(
)()(
.
ppppf
ppppCpppCppCpCbut
CCCC
aaaaCCCC
fffff
aCf
aCf
problemstaticforaCf iii
![Page 22: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/22.jpg)
Production Scheduling P.C. Chang, IEM, YZU.22
Dynamic Problem
)()()()(
)()()()(1234
)()(
)()()(
)()(
):(.
41312111
413121114321
432143211
321121111
43214321
aaaaaaaafstatic
aaaaaaaapppp
aaaappppa
pppappapa
aaaaCCCCf
timeidlewithjobfirstonlycasespecialproblemdynamicfor
),0max(
),0max(
112112
122
PaaPaC
CaC
casegeneralfor
![Page 23: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/23.jpg)
Production Scheduling P.C. Chang, IEM, YZU.23
Sol.
41 2 3 0 3 8 11 15 16
1. Using Job index 1-2-3-4
Ck > ai , C1≧ a2 - no idle timeElse, ifai > Ck, a2 > C1 - idle
36
12416
13215
6511
538
4
3
2
1
if
f
f
f
f
if/1/4
5 5-2 5+1 5-1 =18 3 3 3 = 9 4 4 = 8 1 = 1 36
or
3-5 3-2 3-4
![Page 24: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/24.jpg)
Production Scheduling P.C. Chang, IEM, YZU.24
Sol.
4 12 3 0 4 5 8 12 17
2. Using SPT. EDD 4-2-3-1
28
14317
10212
358
145
1
3
2
4
if
f
f
f
f
if/1/4
![Page 25: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/25.jpg)
Production Scheduling P.C. Chang, IEM, YZU.25
Sol.
4 12 3 0 2 6 7 10 15
3. Using FCFS then SPT (ESPT)Use SPT to arrange jobs (available jobs)
3-4-2-1
24
12315
5510
347
426
1
2
4
3
if
f
f
f
f Static (SPT)
After arrange job 3, the dynamic problem will become a Static one. Then use SPT.
if/1/4
![Page 26: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/26.jpg)
Production Scheduling P.C. Chang, IEM, YZU.26
Rule ESPT
.2
1,
min.4
,.3
/.2
)(min.1
1 ,,3,2,1
1
togo
jjPCC
Pforkjobfind
iTT
UiCaforifind
stopUif
kSSkUU
Pawithkjobfind
jTSnU
kjj
kTk
ji
kkUk
![Page 27: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/27.jpg)
Production Scheduling P.C. Chang, IEM, YZU.27
Ex:ESPT
1. find Min
2.
3. for min 531 124 PPPPi
24
12315
5510
347
426
1
2
4
3
if
f
f
f
f
23 aai
ikkk aallCpaC 6423
![Page 28: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/28.jpg)
Production Scheduling P.C. Chang, IEM, YZU.28
Sol.
41 2 3 0 3 8 11 15 16
1. Using Job index 1-2-3-4
28
130,316
80,715
70,411
00,98
4
3
2
1
iT
MaxT
MaxT
MaxT
MaxT
iT/1/4
![Page 29: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/29.jpg)
Production Scheduling P.C. Chang, IEM, YZU.29
Sol.
4 12 3 0 4 5 8 12 17
2. Using SPT
3. Using EEDD (next slide)
4-2-3-1
19
80,917
50,712
40,48
20,35
1
3
2
4
iT
MaxT
MaxT
MaxT
MaxT
iT/1/4
![Page 30: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/30.jpg)
Production Scheduling P.C. Chang, IEM, YZU.30
Rule EEDD
.2
1,
min.4
,.3
/.2
min.1
1 ,,3,2,1
1
togo
jjPCC
dforkjobfind
iTT
UiCaforifind
stopUif
kSSkUU
PaCawithkjobfind
jTSnU
kjj
kTk
ji
kkjkUk
![Page 31: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/31.jpg)
Production Scheduling P.C. Chang, IEM, YZU.31
Ex:EEDD
1. find Min
2.
3. for min
let4. Return 3
23 aai
ikkk aallCpaC 6423
16
6)0,915(
6)0,410(
4)0,37(
0)0,76(
1
2
4
3
iT
MaxT
MaxT
MaxT
MaxT
6max T
34 ddi
7164 CPCC iki
4CCCC kik
1551091
103742
121
242
PCCd
PCCd
![Page 32: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/32.jpg)
Production Scheduling P.C. Chang, IEM, YZU.32
JIT problem
4
1
2
3
Slackness Rule:
Find di-pi (Job j have to start before this time)
)min(/1/4 ii TE
d1
d2 d4d3
2 21
try
or
a1
a2 a4a3
![Page 33: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/33.jpg)
Production Scheduling P.C. Chang, IEM, YZU.33
Ex.
4 12 3 0 5 9 10 17 26
2-4-3-1
i ai pi di di-pi1 3 5 9 42 5 3 4 13 2 4 7 34 4 1 3 2
)min(/1/4 ii TE
![Page 34: Modeling: Parameters](https://reader035.vdocuments.net/reader035/viewer/2022062410/568159e9550346895dc736f0/html5/thumbnails/34.jpg)
Production Scheduling P.C. Chang, IEM, YZU.34
HW.
1. 5 / 1 / 2. 5 / 1 / 3. 5 / 1 /f T Tf
i ai pi di
1 2 6 15
2 7 2 13
3 5 8 25
4 1 5 30
5 9 3 28
Find an optimal solution!