Professional Documents
Culture Documents
Bingl I 2006
Bingl I 2006
Abstract—Earliness/Tardiness (E/T) scheduling problem under uncertainty are studied in this paper. The main work is to
investigate the Flow shop scheduling problem with distinct due windows. Uncertain processing time is expressed by grey number. The
concept and method of grey simulation was put forward and Grey simulation method was used to give the solution method for grey
chance constrained programming. Finally, mathematical model for E/T Flow shop scheduling which includes grey parameters is studied
in details and how to use grey simulation technology to get the best result based on genetic algorithm is introduced. The effectiveness of
the model and method is verified by simulation results.
Keywords—uncertainty, Flow shop scheduling, Earliness/Tardiness (E/T), grey chance constrained programming, grey simulation
7273
݊Ё Pr{.}㸼⼎ {.} Ёⱘџӊ៤ゟⱘὖ⥛ˈ α β ߚ߿ 3ˊ ໘⧚ᯊ䯈ϡ⹂ᅮᴵӊϟ Flow shop ᦤࠡ/ᢪᳳ䇗ᑺ
ᰃџܜ㒭ᅮⱘ㑺ᴳᴵӊⳂᷛߑ᭄ⱘ㕂ֵ∈ᑇDŽ ൟ
ϔ Ͼ ⚍ x ᰃ ৃ 㸠 ⱘ ᔧ Ϩ ҙ ᔧ џ ӊ 3.1 䯂乬ᦣ䗄
{⊗ | g j ( x,⊗) ≤ 0, j = 1,2,..., p} ⱘὖ⥛⌟ᑺϡᇣѢ α ˈे䖱ড ᴀ᭛ⷨお໘⧚ᯊ䯈ϡ⹂ᅮᴵӊϟ Flow shop ᦤࠡ/ᢪᳳ
㑺ᴳᴵӊⱘὖ⥛ᇣѢ (1 − α ) DŽ 䇗ᑺ䯂乬ˈे䞛⫼♄㡆খ䞣ᴹᦣ䗄ϡ⹂ᅮⱘ໘⧚ᯊ䯈ˈⷨ
ᔧൟЁ᳝㑺ᴳᴵӊᯊˈ៥Ӏ᳝ϸ⾡໘⧚ᮍ⊩[12]DŽ おᏺ᳝ϡৠѸ䋻ᳳにষⱘᦤࠡ/ᢪᳳ䯂乬DŽᑊϨ㾘ᅮབᵰѻ
ᇍѢ↨䕗ᆍᯧ໘⧚ⱘ♄㡆ᴎӮ㑺ᴳˈৃҹ䕀࣪Ў㞾ⱘ⹂ ક݊Ѹ䋻ᳳにষݙᅠᎹˈ߭≵᳝ᚽ㔮˗৺߭ˈ᮴䆎ᰃᦤ
ᅮᗻㄝӋ㉏DŽᇍѢϡᯧ䕀࣪Ў⹂ᅮㄝӋ㉏ⱘ♄㡆ᴎӮ㑺ᴳˈ ࠡ䖬ᰃᢪᳳˈ䛑ᇍѻક䖯㸠ᦤࠡ/ᢪᳳᚽ㔮DŽ
߭Փ⫼♄㡆ᢳᡔᴃᴹ໘⧚DŽ ϟ䴶ᰃᦣ䗄䯂乬ⱘব䞣˖
㗗㰥♄㡆ᴎӮ㑺ᴳ J üüѻકⱘ䲚ড়DŽ J = {1,2, , n} ˈेᎹӊᘏ᭄Ў n
{
Pr g j (x,⊗) ≤ 0, j = 1,2,..., k ≥ α } Ͼ˗
݊Ё ⊗ ♄᭄ˈ݊ⱑ࣪ᴗߑ᭄Ў ϕ (x ) DŽᇍӏᛣ㒭ᅮⱘއ M üü⫳ѻऩܗ䲚ড়DŽ M = {1,2, , m} ˈे໘⧚ऩܗ
ㄪব䞣 x ˈ៥ӀՓ⫼♄㡆ᢳᡔᴃẔ偠ᴎӮ㑺ᴳ៤ゟϢ৺DŽ ᳝ m ৄ˗
佪ܜḍᓣ (2.3) ѻ⫳ N Ͼ⣀ゟⱘⱑ࣪ؐ ⊗1 ,⊗ 2 ,...,⊗ N DŽ䆒 ⊗ oij üüࡴᎹᯊ䯈DŽ ѻક i ໘⧚ऩ ܗj ϞⱘࡴᎹᯊ
N ' ᰃ N ᅲ偠Ё 䯈ˈᅗࣙᣀޚᯊ䯈ǃӴ䕧ᯊ䯈ǃौ䕑ᯊ䯈ǃࡴᎹᯊ䯈ঞ
g j (x,⊗) ≤ 0, j = 1, 2,..., k ⏙⋫ᯊ䯈ㄝˈᰃϔᅮऎ䯈ব࣪ⱘϡ⹂ᅮ䞣ˈᴀ᭛䞛⫼♄
i = 1,2,..., N ៤ゟⱘ᭄ˈे᠔ѻ⫳ⱘ䱣ᴎব䞣Ё⒵䎇 㡆ব䞣ᴹ㸼⼎˗
㑺ᴳⱘϾ᭄DŽ⬅᭄ᅮᕟˈৃҹ⫼ N ' N Ԅ䅵ὖ⥛DŽℸˈ ⊗ I ij üüѻક i ໘⧚ऩ ܗj Ϟⱘ᪡ᓔྟᯊ䯈ˈгЎ
♄㡆ᴎӮ㑺ᴳ៤ゟᔧϨҙᔧ乥⥛ N ' N ≥ α ៤ゟDŽ ♄᭄˗
⊗ Fij üüѻક i ໘⧚ऩ ܗj Ϟⱘ᪡ᅠ៤ᯊ䯈ˈгЎ
2.4 䘫Ӵㅫ⊩∖㾷ℹ偸 ♄᭄˗
ᴀ᭛᠔⫼ⱘ䘫Ӵㅫ⊩䞛⫼ࡴᎹᑣ߫㓪ⷕDŽℹ偸བϟ˖ [ei , t i ] üüѻક i ⱘѸ䋻ᳳにষˈ݊Ё ei ˈ t i ߚ߿Ўѻ
䕧ܹ㕸ԧ㾘 pop-sizeǃѸঝὖ⥛ǃবᓖὖ⥛ǃ䗁ҷ᭄ㄝ ક i ⱘ᳔ᮽ᳔ᰮѸ䋻ᳳ˗ᔧ ⊗ ci < ei ˈ⿄ѻક i ᅠ៤ᦤࠡˈ
খ᭄˗ⴔˈ߱ྟѻ⫳ pop-size Ͼᶧ㡆ԧˈ݊Ёৃ㛑䞛⫼ ᔧ ⊗ ci > t i ˈ⿄ѻક i ࡴᎹᅠ៤ᢪᳳDŽབᵰѻક݊Ѹ䋻ᳳ
♄㡆ᢳᡔᴃẔ偠ᶧ㡆ԧⱘৃ㸠ᗻ˗✊ৢˈᇍᶧ㡆ԧ䖯㸠
にষݙᅠᎹˈ߭≵᳝ᚽ㔮˗৺߭ϡ䆎ѻક i ᦤࠡ㗙ᢪᳳˈ
Ѹঝ᪡বᓖ᪡ˈ݊Ёজৃ㛑䞛⫼♄㡆ᢳẔ偠ৢҷ
䛑ᇚᇍѻક i 䖯㸠ᚽ㔮˗
ⱘৃ㸠ᗻ˗ḍⳂᷛؐ䅵ㅫ↣Ͼᶧ㡆ԧⱘ䗖ᑨᑺ˗ᮟ䕀䌠 hi üüѻક i ࡴᎹᯊ䯈ⱘᦤࠡᚽ㔮ᴗ䞡˗
䕂ˈ䗝ᢽᶧ㡆ԧ˗䗝ᢽѸঝὖ⥛Ў 0.7,বᓖὖ⥛Ў 0.05, 䞡 ωi üüѻક i ⱘࡴᎹᯊ䯈ⱘᢪᳳᚽ㔮ᴗ䞡ˈϔ㠀ഄ
䗝ᢽǃѸঝǃবᓖ᪡Ⳉࠄ㒭ᅮⱘ᭄˗ᇚ䖯࣪ҷ᭄ hi < ω i ˗
Ў㒧ᴳⱘᴵӊˈ᳔ৢˈ䕧ߎ᳔དⱘᶧ㡆ԧЎ䯂乬ⱘ᳔Ӭ ⊗ ci üüѻક i ⱘᅠᎹᯊ䯈DŽ⬅ѢᎹᑣࡴᎹᯊ䯈ⱘϡ
㾷DŽ
⹂ᅮᗻˈ䖭䞠ⱘ ⊗ ci гᰃ♄᭄˗
݊ᴀℹ偸བϟ᠔⼎˖
ѻ↢ೋᆎ ⾡⟲䯸 ᑨ↪Ἧ⦡ᮨ ᢳᛛᴃẔ偠ਙ
⊛นⴕᕈ 3.2 ᭄ᄺᦣ䗄
ᇍਙ䖯 ⴕবᑰᠲ䯸ᑨ↪Ἧ⦡ᮨ Flow shop 䯂乬Ёϡৠѻકⱘ⫳ѻ䏃ᕘ䛑ⳌৠDŽ؛ᅮѻ
ᢳᛛᴃẔ偠อઍ⊛นⴕᕈ કࡴᎹ䖛Ёϡܕ䆌Ёᮁˈ᠔᳝ⱘѻકৃҹ䳊ᯊࠏᡩܹ
↪Ἧ⦡ᮨᢳᛛᴃ䅵▚ᚲਙ⊛⋡ᷛؐ ⫳ѻDŽ㽕⒵䎇ⱘ㑺ᴳ᳝˖˄ϔ˅ѻક i ⱘ j 䘧Ꮉᑣᖙ乏
j − 1 䘧Ꮉᑣᅠ៤ৢᠡ㛑ᓔྟˈे㽕⒵䎇乎ᑣ㑺ᴳ˗ ˄Ѡ˅
ᩮᝪ⋡ᷛؐ䯸↪䆘ચವᢙ䅵▚舌ਙਙ⊛
ㅎᑨᐲ ϔᡍѻકⱘ⫳ѻᖙ乏ࠡϔᡍѻકᶤϔ໘⧚ऩܗ໘⧚ᅠ
↩ৢᠡ㛑䖯ܹ䆹໘⧚ऩेˈܗ㽕⒵䎇䌘⑤㑺ᴳDŽ
ᣓ䕀䌠䕂䯸䗝ᢽ䕗Ӭਙ
ϟ䴶䖯㸠ൟⱘ∖㾷ᓎゟ˖
ุ
䘫Ӵઍᢙੌ䰋
ѻક i ⫳ѻऩ ܗj Ϟⱘᓔྟᯊ䯈Ў˖
˄1˅ i = 1, j = 1
ᤚ
㒭ᦨᅢ⊛ਙЎᦨӬ⸃
7274
⊗ I ij = 0 (5) ℸ䇗ᑺⳂᷛ˖
˄2˅ i ≠ 1, j ≠ 1 Z = max P(⊗ g (⊗ ci )) (13)
{
⊗ I ij = max ⊗ Fi −1 j ,⊗ Fij −1 } (6) 3.3 䇗ᑺൟⱘ䕀࣪
˄3˅ i = 1 ˈ j = 2,3,, m
䗮䖛Ϟ䗄ᇍ᳝Ѹ䋻ᳳにষⱘ flow shop 䇗ᑺൟⱘ᭄ᄺ
{ }
⊗ I ij = max 0,⊗ Fij −1 = ⊗ Fij −1 (7)
ᦣ䗄ˈ㒧ড়♄㡆ᴎӮ㑺ᴳ㾘ߦൟⱘᓎゟˈ៥ӀৃҹᇚϞ
䗄᳝♄㡆খ᭄ⱘ䇗ᑺൟ䕀࣪ЎབϟऩⳂᷛ♄㡆㑺ᴳ㾘
˄4˅ j = 1 ˈ i = 2,3, , n
{ }
ߦൟ˖
⊗ I ij = max ⊗ Fi −1 j ,0 = ⊗ Fi −1 j (8) ⎧Z = max P(⊗ g (⊗ ci ))
⎪
↣Ͼ໘⧚ऩⱘܗᅠ៤ᯊ䯈Ў˖ ⎪⎪ Pr (⊗ I ij ≥ ⊗ I ij −1 + ⊗ O ij −1 ) ≥ α
⊗ Fij = ⊗ I ij + ⊗ Oij (9) ⎨ (14)
⎪ Pr (⊗ I ij ≥ ⊗ I i −1 j + ⊗ O i −1 j ) ≥ α
ѻક i ⱘᅠᎹᯊ䯈Ў˖ ⎪⊗ ≥ 0
⎪⎩ I ij
⊗ c i = ⊗ Fim (10)
݊Ё Z Ў㕂ֵ∈ᑇϟⱘⳂᷛߑ᭄DŽ α ᰃ㕂ֵ∈ᑇDŽ
ᏺ᳝ϡৠѸ䋻ᳳにষ [ei , t i ] ⱘ Flow Shop 䯂乬ˈᔧѻક
؛䆒⾡㑺ᴳᴵӊϟⱘ㕂ֵ∈ᑇ䛑ᰃ α DŽ
i ࡴᎹᅠ៤ᦤࠡ㗙ᢪᳳˈ䛑㽕ᇍ݊䖯㸠ᚽ㔮ˈ䖭䞠㗗㰥ᚽ
㔮᳔ᇣᚙމϟⱘὖ⥛ˈᏠᳯᘏⱘᚽ㔮ὖ⥛Ў᳔ᇣˈेϡᚽ 4ˊӓⳳঞߚᵤ
㔮ὖ⥛᳔DŽѻક i ⱘϡᚽ㔮ὖ⥛Ў˖
ᴀ᭛ᇍ 10 ϾࡴᎹѻકǃ5 Ͼ໘⧚ऩ ⱘܗFlow shop 䇗
Pr (0 ≥ hi (ei − ⊗ ci )) + Pr (0 ≥ wi (⊗ ci − t i )) (11)
ᑺ䯂乬䖯㸠ӓⳳߚᵤDŽ㸼 1 㒭ߎњѻકⱘ໘⧚ᯊ䯈ˈ⫼♄
䇗ᑺⱘⳂⱘህᰃᏠᳯሑ䞣ⱘѻક䛑㛑Ѹ䋻ᳳにষ ᭄㸼⼎DŽ㸼 2 㒭ߎњѻકᇍᑨⱘѸ䋻ᳳにষঞᦤࠡ/ᢪᳳᚽ
ݙᅠᎹˈҢ㗠ᇍѻકᅠᎹⱘᚽ㔮᳔ᇣˈℸᅮНⳂᷛߑ᭄ 㔮ᴗ䞡DŽ
Ў᠔᳝ѻકᅠᎹϡফᚽ㔮ⱘὖ⥛ПDŽⳂᷛߑ᭄ৃҹݭЎ˖ ⬅ग़᭄Ꮖⶹ᠔᳝ࡴᎹᯊ䯈ⱘⱑ࣪ᴗߑ᭄(㾕䰘ᔩ
P(⊗ g (⊗ ci )) = ∑ [ Pr (0 ≥ hi (ei − ⊗ ci )) + Pr (0 ≥ wi (⊗ ci − t i ))]
n
A)ᑊ⬅Ѣ♄㡆ᢳⱘ♄㡆ᴎӮ㑺ᴳ㾘ߦˈ㒣䘫Ӵㅫ⊩ 500
݊Ё P (⊗ g (⊗ ci )) ЎⳂᷛߑ᭄ेϡফᚽ㔮ὖ⥛ПDŽ 䗁ҷৢ,㒧ᵰབ㸼 3DŽ
䇗ᑺ䯂乬ህᰃއᅮ n ϾѻકⱘࡴᎹ乎ᑣˈሑ䞣⒵䎇
Ѹ䋻ᳳにষݙᅠᎹˈՓᕫⳂᷛߑ᭄ेϡফᚽ㔮ὖ⥛᳔ˈ
㸼 1 ♄㡆 Flow shop 䇗ᑺ䯂乬ࡴᎹᎹӊ໘⧚ᯊ䯈㸼
ѻક ໘⧚ऩ ܗ1 ໘⧚ऩ ܗ2 ໘⧚ऩ ܗ3 ໘⧚ऩ ܗ4 ໘⧚ऩ ܗ5
1 (37,43) (13,18) (11,13) (22,28) (8,11)
2 (6,9) (39,44) (21,23) (32,38) (7,9)
3 (37,43) (136,166) (30,35) (106,131) (145,174)
4 (10,14) (69,82) (20,27) (44,53) (72,82)
5 (5,8) (82,101) (67,78) (48,54) (140,166)
6 (11,14) (11,15) (60,68) (29,35) (131,176)
7 (9,14) (6,8) (27,33) (23,28) (29,35)
8 (28,35) (37,41) (123,158) (5,8) (17,21)
9 (28,33) (88,95) (11,13) (11,16) (93,112)
10 (23,29) (105,121) (19,22) (84,96) (48,59)
㸼2 Ѹ䋻ᳳにষঞᦤࠡ/ᢪᳳᚽ㔮ᴗ䞡
ѻક 1 2 3 4 5 6 7 8 9 10
[350, [300, [850, [550, [700, [250, [300, [400, [350, [500,
Ѹ䋻ᳳにষ
450] 400] 1000] 650] 800] 300] 350] 500] 450] 600]
ᦤࠡ/ᢪᳳᚽ㔮ᴗ䞡 2ˈ3 2ˈ3 3ˈ4 5ˈ5 4ˈ4 2ˈ2 4ˈ4 3ˈ4 3ˈ5 2ˈ3
7275
㸼3 α ϡৠᚙމϟⱘⳂᷛߑ᭄ ᭄ᄺ䇗ᑺൟⱘ⸔ϞᓎゟњⳌᑨⱘ♄㡆ᴎӮ㑺ᴳ㾘ߦ䇗
α ѻકࡴᎹᑣ߫ Ⳃᷛߑ᭄ Z makespan ᑺൟˈᑊ⫼䘫Ӵㅫ⊩䖯㸠њ∖㾷䖤ㅫˈӓⳳ㒧ᵰ䇈ᯢњ
α = 0.1 6 7 1 2 8 9 10 4 5 3 9.827 948 ൟㅫ⊩ⱘ᳝ᬜᗻDŽ
α = 0.3 7 6 9 1 4 5 3 2 10 8 9.823 937
α = 0.5 6 7 2 1 10 9 4 5 8 3 9.709 963
α = 0.7 6 2 9 7 8 1 10 4 5 3 9.641 967 খ㗗᭛⤂
α = 0.9 6 7 2 9 10 8 1 5 3 4 9.633 952 [1] 乒ᑌ⫳. ϡ⹂ᅮᴵӊϟⱘ⫳ѻ䇗ᑺ. ढϰ⧚Ꮉᄺᄺ,
⬅㸼Ёৃҹⳟߎˈᔧ㕂ֵ∈ᑇ α ⱘؐࡴᯊˈⳂᷛߑ 2000, vol.26, no.5, pp. 441-446.
᭄ޣᇣˈᇍѢⳌৠⱘ α ؐˈৃ㛑ӮᕫࠄⳌৠⱘⳂᷛߑ᭄ؐˈ [2] Ju M S et al. Design of adaptive fuzzy controls based on natural
Ԛৃ㛑Ӯᕫࠄϡৠⱘᥦᑣ㒧ᵰDŽ 1 Ў㕂ֵ∈ᑇ α = 0.3 ᯊ control laws. Fuzzy Sets and System, 1996, vol.81,no.2, pp.
᳔Ӭ㒧ᵰⱘ⫬⡍DŽ 191-204.
[3] ਈᙺ, ∾ᅮӳ. Ѹ䋻ᳳにষϟᏺ᳝䰘ࡴᚽ㔮ⱘऩᴎᦤࠡ/ᢪᳳ
䇗ᑺ䯂乬. ࠊ⧚䆎Ϣᑨ⫼. 2000, 17( 1)˖9-13.
[4] ᴢᑇ. ϡ⹂ᅮᗻᴵӊϟⱘᦤࠡ/ᢪᳳ䇗ᑺ䯂乬ⷨお. Ϟ⍋˖ढ
ϰ⧚Ꮉᄺ⸩ᄺԡ䆎᭛, 2003.
[5] ਈᙺ, ∾ᅮӳ. ⫼ᢳ䗔☿⊩㾷ӏࡵⱘࡴᎹᯊ䯈Ў㊞ऎ䯈
᭄ⱘऩᴎᦤࠡ/ᢪᳳ䇗ᑺ䯂乬. ֵᙃϢࠊ, 1998, vol.27, no.
5, pp. 394-400.
[6] 咢ބ, 乒ᑌ⫳. ϡ⹂ᅮᴵӊϟ⫳ѻ䅵ߦⱘ♄㡆ᴎӮ㑺ᴳ㾘ߦ.
Proceedings of the 5th World Congress on Intelligent Control
and AutomationˈJune 15-19, 2004, Hangzhou, P.R.China, pp.
2943-2947.
1 α = 0.3 ᯊⱘ Gantt
[7] 咢ބ, 乒ᑌ⫳. ⏋ড়ᴎӮ㑺ᴳ㾘ߦঞ⫳ѻ䅵ߦЁⱘᑨ⫼.
㊞㾘ߦⱘӬ࣪ᮍ⊩㾷ˈއԚᔧϡ⹂ᅮখ᭄ेϡヺড়䱣ᴎߚ 3450-3454.
ᏗজϡሲѢ㊞᭄ᯊˈ៥Ӏৃҹ⫼♄㡆㾘ߦᴹ໘⧚DŽᴀ᭛ [8] ߬Ѯݯ. ♄㡆ϡ⹂ᅮ㾘ߦϢ㰮ᢳӕϮⷨお. ढϰ⧚Ꮉᄺम
ᳳ䇗ᑺ䯂乬ˈेЁ䯈ᄬټᯊ䯈᮴䰤ⱘѸ䋻ᳳ䇗ᑺ䯂乬ˈ
䰘ᔩ A ⱑ࣪ᴗߑ᭄
(
φ11 ( x) = 1 / 15(x − 41) + 1) 2
(
φ12 ( x) = 1 / 8(x − 15) + 1
2
) (
φ13 ( x) = 1 / 0.3(x − 12 )2 + 1 ) (
φ14 ( x ) = 1 / 53(x − 25 )2 + 1 ) (
φ15 ( x) = 1 / 0.07(x − 10) + 1
2
)
φ ( x ) = 1 / (0.95(x − 8) + 1)
21
2
φ 22 ( x) = 1 / (12(x − 42) + 1)
2
( )
φ 23 ( x ) = 1 / 0.6(x − 24) + 1
2
(
φ 24 ( x) = 1 / 0.05(x − 35 ) + 1
2
) (
φ25 ( x) = 1 / 19(x − 8) + 1 2
)
φ ( x) = 1 / (5(x − 39) + 1)
31
2
(
φ 32 ( x ) = 1 / 62(x − 152) + 1
2
) φ ( x) = 1 / (0.8(x − 32 ) + 1)
33
2
φ 34 ( x) = 1 / (22(x − 121) + 1)
2
(
φ35 ( x) = 1 / 0.78(x − 155) + 1 2
)
(
φ 41 ( x) = 1 / 16(x − 12 ) + 1
2
) φ ( x ) = 1 / (0.7 (x − 76 ) + 1)
42
2
φ ( x) = 1 / (9(x − 24) + 1)
43
2
φ 44 ( x) = 1 / (23(x − 50 ) + 1)
2
(
φ45 ( x ) = 1 / 31(x − 78) + 1 2
)
(
φ51 ( x) = 1 / 4(x − 7) + 1 2
) φ ( x) = 1 /(17(x − 91) + 1)
52
2
( )
φ53 ( x) = 1 / 8(x − 74) + 1 2
φ54 ( x) = 1 / (11(x − 51) + 1)
2
(
φ 55 ( x ) = 1 / 32(x − 156) + 1
2
)
φ 61 ( x) = 1 / (5(x − 13) + 1)
2
62 φ ( x) = 1 / (17(x − 63) + 1)
φ ( x) = 1 / (0.03(x − 13) + 1)
2
63
2
φ64 ( x) = 1 / (0.8(x − 31) + 1)
2
φ 65 ( x) = 1 / (4(x − 157 ) + 1)
2
φ ( x ) = 1 / (6(x − 12) + 1)
71
2
φ ( x ) = 1 / (0.3(x − 7 ) + 1)
72 φ ( x) = 1 / (34(x − 29) + 1)
2
73
2
(
φ74 ( x) = 1 / 9(x − 26)2 + 1) (
φ75 ( x) = 1 / 8(x − 33)2 + 1 )
φ ( x) = 1 / (11(x − 31) + 1) φ ( x) = 1 / (3(x − 40) + 1) φ ( x) = 1 / (6(x − 144) + 1) φ ( x) = 1 / (27(x − 7 ) + 1) (
φ 85 ( x) = 1 / 6(x − 19) + 1 )
2 2 2 2 2
81 82 83 84
φ ( x) = 1 / (0.88(x − 31) + 1)
91 φ ( x) = 1 / (4(x − 93) + 1)
2
92 φ ( x) = 1 / (8(x − 12) + 1)
2
93
2
φ ( x ) = 1 / (18(x − 13) + 1)
94
2
(
φ95 ( x) = 1 / 0.05(x − 103) + 1 2
)
φ ( x) = 1 / (16(x − 25) + 1)
101 φ ( x) = 1 / (9(x − 114) + 1)
2
102 φ ( x) = 1 / (0.9(x − 20) + 1)
2
103
2
φ ( x) = 1/ (42(x − 90 ) + 1)
104
2
(
φ105 ( x) = 1 / 14(x − 53) + 1 2
)
7276