{"id":38241,"date":"2026-09-03T13:42:48","date_gmt":"2026-09-03T12:42:48","guid":{"rendered":"https:\/\/keyfy.com\/blog\/ms-projectte-gorev-bagimliliklari-aciklamasi\/"},"modified":"2026-09-03T13:42:48","modified_gmt":"2026-09-03T12:42:48","slug":"ms-projectte-gorev-bagimliliklari-aciklamasi","status":"publish","type":"post","link":"https:\/\/keyfy.com\/tr\/blog\/ms-projectte-gorev-bagimliliklari-aciklamasi\/","title":{"rendered":"MS Project\u2019te G\u00f6rev Ba\u011f\u0131ml\u0131l\u0131klar\u0131 A\u00e7\u0131klamas\u0131"},"content":{"rendered":"

Bir g\u00f6revin biti\u015f tarihini \u00fc\u00e7 g\u00fcn uzatt\u0131n\u0131z ve program\u0131n yar\u0131s\u0131 kimsenin istemedi\u011fi \u015fekilde alt\u00fcst oldu. Ya da tam tersi oldu. Bir tarih de\u011fi\u015fti, ancak iki g\u00f6rev a\u00e7\u0131k\u00e7a birbirine ba\u011fl\u0131 olmas\u0131na ra\u011fmen hi\u00e7bir \u015fey yerinden k\u0131p\u0131rdamad\u0131. MS Project<\/a>\u2018te g\u00f6rev ba\u011f\u0131ml\u0131l\u0131klar\u0131n\u0131<\/strong> gidermeye \u00e7al\u0131\u015fan herkes i\u00e7in, her iki durumda da bir \u015feyler ters gidiyor ve genellikle sorun tarihlerde de\u011fil. <\/p>\n

Bu tarihler, belki de kimsenin fark\u0131na varmad\u0131\u011f\u0131 bir \u015fekilde daha \u00f6nce al\u0131nm\u0131\u015f bir karar\u0131n sonucudur. \u0130ki g\u00f6revi birbirine ba\u011flamak, Microsoft Project\u2019in bir ili\u015fki t\u00fcr\u00fc atad\u0131\u011f\u0131 anlam\u0131na gelir. De\u011fi\u015ftirilmedik\u00e7e, varsay\u0131lan olarak \u201cBiti\u015f-Ba\u015flang\u0131\u00e7\u201d (Finish-to-Start) ili\u015fkisi kullan\u0131l\u0131r. Bu ili\u015fki, herhangi bir de\u011fi\u015fiklik oldu\u011funda zaman \u00e7izelgesinin nas\u0131l tepki verece\u011fini belirler. Dolay\u0131s\u0131yla, tepki yanl\u0131\u015f geliyorsa, ili\u015fki de yanl\u0131\u015ft\u0131r. <\/p>\n

Bunu bir te\u015fhis olarak d\u00fc\u015f\u00fcn\u00fcn. D\u00f6rt ba\u011f\u0131ml\u0131l\u0131k t\u00fcr\u00fcn\u00fc soyut tan\u0131mlar olarak s\u0131ralamak yerine, bir tarih de\u011fi\u015fti\u011finde her birinin zaman \u00e7izelgesine ger\u00e7ekte ne gibi bir etki yapt\u0131\u011f\u0131n\u0131<\/em> inceleyin. Belirtiye uyan davran\u0131\u015f\u0131 bulun; ba\u011f\u0131ml\u0131l\u0131k kendili\u011finden ortaya \u00e7\u0131kacakt\u0131r. <\/p>\n

\n
H\u0131zl\u0131 \u00d6zet \u2013 TLDR<\/div>\n
MS Project\u2019teki g\u00f6rev ba\u011f\u0131ml\u0131l\u0131klar\u0131, bir tarih de\u011fi\u015fti\u011finde g\u00f6revlerin nas\u0131l tepki verece\u011fini belirler ve d\u00f6rt t\u00fcr (Biti\u015f-Ba\u015flang\u0131\u00e7, Ba\u015flang\u0131\u00e7-Ba\u015flang\u0131\u00e7, Biti\u015f-Biti\u015f, Ba\u015flang\u0131\u00e7-Biti\u015f) her biri kendine \u00f6zg\u00fc bir zamanlama davran\u0131\u015f\u0131 sergiler. Zamanlama yanl\u0131\u015f gidiyorsa, sorun genellikle tarihlerde de\u011fil, ba\u011f\u0131ml\u0131l\u0131k t\u00fcr\u00fcnde yatmaktad\u0131r. Bu ba\u011flant\u0131lar \u00fczerine eklenmi\u015f gecikme ve \u00f6n haz\u0131rl\u0131k s\u00fcreleri, \u00e7o\u011fu ger\u00e7ek zaman \u00e7izelgesinin fark edilmeden bozuldu\u011fu noktad\u0131r. <\/div>\n<\/div>\n

MS Project\u2019teki G\u00f6rev Ba\u011f\u0131ml\u0131l\u0131klar\u0131 Neden Program\u0131n\u0131z\u0131 Yanl\u0131\u015f Y\u00f6ne Kayd\u0131r\u0131r?<\/h2>\n

\u00c7o\u011fu k\u0131lavuz, d\u00f6rt ba\u011f\u0131ml\u0131l\u0131k t\u00fcr\u00fcn\u00fc tan\u0131mlay\u0131p bu kadarla yetiniyor. \u201cBitir-Ba\u015flat\u201d (Finish-to-Start), bir g\u00f6revin bir sonraki g\u00f6rev ba\u015flamadan \u00f6nce tamamlanmas\u0131 anlam\u0131na gelir ve bu \u015fekilde devam eder. Teknik olarak do\u011fru olsa da, bir Gantt \u015femas\u0131 zaten d\u00fczg\u00fcn \u00e7al\u0131\u015fmad\u0131\u011f\u0131nda ve bunun \u201cnedeni\u201d h\u00e2l\u00e2 bir muamma oldu\u011funda tamamen i\u015fe yaramazd\u0131r. <\/p>\n

As\u0131l mesele \u015fudur: Bir ba\u011f\u0131ml\u0131l\u0131k t\u00fcr\u00fc bir etiket de\u011fildir. Bu, bir tarihe her dokunuldu\u011funda zamanlama motorunun izledi\u011fi bir kurald\u0131r. Project\u2019in g\u00f6revleri nas\u0131l zamanlad\u0131\u011f\u0131na dair Microsoft\u2019un kendi belgelerinde, yaz\u0131l\u0131m\u0131n ba\u011flant\u0131lar, k\u0131s\u0131tlamalar ve takvimlerden ba\u015flayarak bu s\u0131rayla t\u00fcm zinciri yeniden hesaplad\u0131\u011f\u0131 a\u00e7\u0131klanmaktad\u0131r. Hesaplamay\u0131 asla g\u00f6remezsiniz. Sadece sonucun de\u011fi\u015fti\u011fini g\u00f6r\u00fcrs\u00fcn\u00fcz. <\/p>\n

\u0130\u015fte insanlar\u0131n kafas\u0131n\u0131 kar\u0131\u015ft\u0131ran k\u0131s\u0131m da bu. Project, t\u00fcr\u00fc g\u00f6rev kimli\u011finin hemen yan\u0131nda, \u00e7o\u011fu ki\u015finin hi\u00e7 okumad\u0131\u011f\u0131 bir k\u0131saltma bi\u00e7iminde saklar. \u201c4FS\u201d olarak listelenen bir \u00f6nc\u00fcl, 4 numaral\u0131 g\u00f6revde \u201cBiti\u015f-Ba\u015flang\u0131\u00e7\u201d anlam\u0131na gelir. \u201c4SS\u201d ise \u201cBa\u015flang\u0131\u00e7-Ba\u015flang\u0131\u00e7\u201d anlam\u0131na gelir. Bu s\u00fctunu atlarsan\u0131z, soruna neden olan tam ayar\u0131 g\u00f6remezsiniz. <\/p>\n

Mesele \u015fu ki, tarihleri biraz de\u011fi\u015ftirerek bir zamanlama sorununu \u00e7\u00f6zemezsiniz. Tarihi belirleyen ba\u011flant\u0131d\u0131r. Ba\u011flant\u0131y\u0131 d\u00fczeltin. <\/p>\n

D\u00f6rt T\u00fcr: Zaman \u00c7izginize Etkilerine G\u00f6re<\/h2>\n

Her birini, ders kitab\u0131ndaki tan\u0131mlara g\u00f6re de\u011fil, ortaya \u00e7\u0131kard\u0131\u011f\u0131 belirtilere g\u00f6re tek tek inceleyelim.<\/p>\n

\u201cBiti\u015f-Ba\u015flang\u0131\u00e7\u201d (FS)<\/strong> varsay\u0131lan y\u00f6ntemdir ve ger\u00e7ek ba\u011f\u0131ml\u0131l\u0131klar\u0131n yakla\u015f\u0131k %80\u2019ini<\/strong> kapsar. A g\u00f6revi bitti\u011finde, B g\u00f6revi ba\u015flar. A\u2019n\u0131n biti\u015f tarihini ileriye kayd\u0131r\u0131rsan\u0131z, B de buna ba\u011fl\u0131 olarak ileriye kayar. Bu, bekledi\u011finiz<\/em> davran\u0131\u015ft\u0131r; i\u015fte bu y\u00fczden nadiren kafa kar\u0131\u015f\u0131kl\u0131\u011f\u0131na yol a\u00e7ar. Bir \u00f6nc\u00fcl g\u00f6revin biti\u015f tarihi de\u011fi\u015fti\u011finde program \u00f6ng\u00f6r\u00fclebilir bir \u015fekilde kay\u0131yorsa, FS y\u00f6ntemini kullan\u0131yorsunuz demektir ve bu y\u00f6ntem i\u015fe yar\u0131yor demektir. Biti\u015f-Ba\u015flang\u0131\u00e7 proje zincirinde, \u00f6nce temeli d\u00f6k\u00fcn, sonra duvarlar\u0131 in\u015fa edin \u2014 i\u015fte FS\u2019nin temel \u00e7al\u0131\u015fma prensibi budur. <\/p>\n

Ba\u015flang\u0131\u00e7-Ba\u015flang\u0131\u00e7 (SS) ba\u011flant\u0131s\u0131<\/strong>, iki g\u00f6revin ba\u015flang\u0131\u00e7 tarihlerini<\/em> birbirine ba\u011flar. A ba\u015flamadan B ba\u015flayamaz. Buraya i\u015faret eden belirti \u015fudur: bir \u00f6nc\u00fcl g\u00f6revin biti\u015f tarihi de\u011fi\u015fti, ancak halef g\u00f6revde herhangi bir de\u011fi\u015fiklik olmad\u0131; bu durum bir hata gibi g\u00f6r\u00fcnd\u00fc. Oysa \u00f6yle de\u011fil. SS\u2019de yaln\u0131zca ba\u015flang\u0131\u00e7 tarihleri birbirine ba\u011fl\u0131d\u0131r, bu nedenle biti\u015f tarihinin de\u011fi\u015ftirilmesi sonraki a\u015famalara hi\u00e7bir etki etmez. \u015eantiye kaz\u0131s\u0131 ve ekipman sevkiyat\u0131 gibi birlikte h\u0131z kazanan iki g\u00f6rev i\u00e7in SS tercih edilir. <\/p>\n

Finish-to-Finish (FF)<\/strong>, u\u00e7lar\u0131 birbirine<\/em> ba\u011flar. A bitmeden B bitemez. Buradaki belirleyici unsur, ba\u015flang\u0131\u00e7 tarihi serbest\u00e7e de\u011fi\u015fkenlik g\u00f6steren, ancak \u00f6nc\u00fcl\u00fcn s\u00fcresi uzat\u0131ld\u0131\u011f\u0131nda biti\u015f tarihi aniden s\u0131\u00e7rayan bir halefdir. Geli\u015ftirme s\u00fcreciyle e\u015fzamanl\u0131 olarak tamamlanmas\u0131 gereken testler klasik bir FF \u00f6rne\u011fidir; ikisi paralel olarak y\u00fcr\u00fcr, ancak ayn\u0131 anda sonu\u00e7lanmal\u0131d\u0131r. <\/p>\n

Ba\u015flang\u0131\u00e7tan Biti\u015fe (SF)<\/strong> nadir g\u00f6r\u00fclen ve kafa kar\u0131\u015ft\u0131r\u0131c\u0131 bir durumdur; a\u00e7\u0131k\u00e7as\u0131 bunu kullanan \u00e7o\u011fu ki\u015fi bunu yanl\u0131\u015fl\u0131kla yapm\u0131\u015ft\u0131r. A ba\u015flamadan B bitemez. Bir g\u00f6revin biti\u015f tarihi, ba\u015fka bir g\u00f6revin ba\u015flang\u0131c\u0131<\/em> nedeniyle s\u00fcrekli erteleniyorsa ve bu durum mant\u0131kl\u0131 gelmiyorsa, muhtemelen ba\u015fka bir \u015fey kastedilirken yanl\u0131\u015fl\u0131kla SF uygulanm\u0131\u015ft\u0131r. Bu, vardiya devri gibi ger\u00e7ek durumlarda kar\u015f\u0131m\u0131za \u00e7\u0131kar. Ancak kimse bunu kas\u0131tl\u0131 olarak se\u00e7mediyse, b\u00fcy\u00fck olas\u0131l\u0131kla bir hatad\u0131r. <\/p>\n

\u201cDolay\u0131s\u0131yla te\u015fhis s\u00fcreci basittir. Neyin de\u011fi\u015fti\u011fine (bir ba\u015flang\u0131\u00e7 m\u0131 yoksa bir biti\u015f mi) dikkat edin, neyin a\u015fa\u011f\u0131 ak\u0131\u015fa kayd\u0131\u011f\u0131na (bir ba\u015flang\u0131\u00e7, bir biti\u015f ya da hi\u00e7bir \u015fey) dikkat edin ve bu \u00e7ifti yukar\u0131daki t\u00fcrlerle e\u015fle\u015ftirin. E\u015fle\u015fmeyen k\u0131s\u0131m, neye ge\u00e7meniz gerekti\u011fini g\u00f6sterir.\u201d<\/p><\/blockquote>\n

Ba\u011flant\u0131y\u0131 Kontrol Etme ve De\u011fi\u015ftirme<\/h2>\n

\u00d6ncelikle, \u201c\u00d6nceki G\u00f6revler\u201d s\u00fctunu g\u00f6r\u00fcnm\u00fcyorsa bu s\u00fctunu a\u00e7\u0131n. Herhangi bir s\u00fctun ba\u015fl\u0131\u011f\u0131na sa\u011f t\u0131klay\u0131n, \u201cS\u00fctun Ekle\u201d se\u00e7ene\u011fini se\u00e7in ve \u201c\u00d6nceki G\u00f6revler\u201di se\u00e7in. Art\u0131k her g\u00f6rev, ba\u011flant\u0131s\u0131n\u0131 bu k\u0131saltma bi\u00e7iminde g\u00f6sterir; tahminde bulunman\u0131za gerek kalmaz. <\/p>\n

Bir t\u00fcr\u00fc de\u011fi\u015ftirmek i\u00e7in, sonraki g\u00f6revi \u00e7ift t\u0131klay\u0131n, G\u00f6rev Bilgisi ileti\u015fim kutusundaki \u00d6nceki G\u00f6revler sekmesini a\u00e7\u0131n ve T\u00fcr a\u00e7\u0131l\u0131r men\u00fcs\u00fcnden ili\u015fkiyi se\u00e7in. En d\u00fczg\u00fcn yol budur. K\u0131sayollara a\u015fina iseniz, \u201c5\u201d yerine \u201c5FF\u201d yazarak g\u00f6rev 5\u2019te \u201cBiti\u015f-Biti\u015f\u201d ili\u015fkisini zorlayarak \u00f6nc\u00fc s\u00fctununu do\u011frudan da d\u00fczenleyebilirsiniz. <\/p>\n

Her yeni ili\u015fki varsay\u0131lan olarak \u201cBiti\u015f-Ba\u015flang\u0131\u00e7\u201d (FS) olarak ayarlan\u0131r. \u0130ki g\u00f6rev se\u00e7in, \u015feritteki zincir simgesine t\u0131klay\u0131n; i\u015fte bu kadar, her ikisi de FS olur. Microsoft Project\u2019te g\u00f6revleri ba\u011flaman\u0131n temel y\u00f6ntemi budur. Ba\u011f\u0131ml\u0131l\u0131klar\u0131 ba\u011flama konusunda ExperTrain\u2019in ad\u0131m ad\u0131m k\u0131lavuzu, ad\u0131m ad\u0131m talimatlar istiyorsan\u0131z \u201cse\u00e7 ve ba\u011fla\u201d y\u00f6ntemini ayr\u0131nt\u0131l\u0131 olarak ele almaktad\u0131r. Sorun, bu varsay\u0131lan ayarda yatmaktad\u0131r. Ger\u00e7ek ili\u015fki SS veya FF ise, \u015fimdi yanl\u0131\u015f t\u00fcrde bir ili\u015fki olu\u015fturmu\u015f olursunuz ve bir tarih garip bir \u015fekilde kayana kadar kimse bunu fark etmez. <\/p>\n

\n
\u0130PUCU<\/div>\n
\u0130ki g\u00f6revi birbirine ba\u011flad\u0131ktan hemen sonra, devam etmeden \u00f6nce \u201c\u00d6nceki G\u00f6revler\u201d s\u00fctununa bir g\u00f6z at\u0131n. K\u0131saltman\u0131n (FS, SS veya FF) asl\u0131nda kastetti\u011finizle e\u015fle\u015fip e\u015fle\u015fmedi\u011fini kontrol etmek sadece iki saniye s\u00fcrer \u2014 ve bu, yanl\u0131\u015f bir varsay\u0131lan ayar\u0131n program\u0131n derinliklerine g\u00f6m\u00fclmeden \u00f6nce onu yakalayabilece\u011finiz tek and\u0131r. <\/div>\n<\/div>\n

As\u0131l sorun i\u015fte burada yat\u0131yor. D\u00f6rt t\u00fcr en \u00e7ok dikkat \u00e7ekenler olsa da, gecikme ve teslim s\u00fcresi proje ayarlar\u0131 zaman \u00e7izelgelerini sessizce mahveden unsurlard\u0131r; \u00e7\u00fcnk\u00fc \u00f6zellikle aramad\u0131\u011f\u0131n\u0131z s\u00fcrece g\u00f6zle g\u00f6r\u00fclmezler. <\/p>\n

Gecikme<\/strong>, bir ba\u011f\u0131ml\u0131l\u0131\u011f\u0131n \u00fczerine eklenen bir gecikmedir. \u0130ki g\u00fcnl\u00fck gecikmeli \u201cBiti\u015f-Ba\u015flang\u0131\u00e7\u201d (Finish-to-Start) ili\u015fkisi, A\u2019n\u0131n bitiminden iki g\u00fcn sonra<\/em> B\u2019nin ba\u015flad\u0131\u011f\u0131 anlam\u0131na gelir. Sertle\u015fme s\u00fcresi, boyan\u0131n kurumas\u0131 gibi zorunlu bir bekleme s\u00fcresini d\u00fc\u015f\u00fcn\u00fcn. Bunu \u201c4FS+2d\u201d \u015feklinde \u00f6nc\u00fcl s\u00fctununa girersiniz. \u00c7izelge, \u00e7evredeki tarihler nas\u0131l de\u011fi\u015firse de\u011fi\u015fsin bu aral\u0131\u011f\u0131 korur; bu da ger\u00e7ek bir bekleme s\u00fcresi i\u00e7in tam olarak istedi\u011finiz \u015feydir. Ve yanl\u0131\u015fl\u0131kla eklenmi\u015fse tam olarak istemedi\u011finiz \u015feydir. <\/p>\n

\u201cLead\u201d<\/strong>, negatif \u201clag\u201dd\u0131r. Temel olarak, g\u00f6revlerin \u00e7ak\u0131\u015fmas\u0131 anlam\u0131na gelir. \u201c4FS-2d\u201d, B g\u00f6revinin A g\u00f6revinin bitiminden iki g\u00fcn \u00f6nce<\/em> ba\u015flamas\u0131 ve b\u00f6ylece g\u00f6revlerin birbirine b\u00fcr\u00fcnmesini ifade eder. Bu durum, bir \u00f6nc\u00fcl g\u00f6rev son a\u015famas\u0131n\u0131 tamamlarken bir ard\u0131l g\u00f6revin ba\u015flayabilece\u011fi durumlarda yararl\u0131d\u0131r. Microsoft Community Hub\u2019daki geli\u015fmi\u015f g\u00f6rev ba\u011f\u0131ml\u0131l\u0131klar\u0131 hakk\u0131ndaki makale, \u00f6nc\u00fcl ve gecikme kavramlar\u0131n\u0131n yeni Project for the web motoruyla nas\u0131l etkile\u015fime girdi\u011fini ele al\u0131yor; istemedi\u011finiz \u00f6rt\u00fc\u015fmelerle kar\u015f\u0131la\u015f\u0131yorsan\u0131z bu makaleyi okumaya de\u011fer. <\/p>\n

\u0130\u015fte hata senaryosu: Birisi \u201c-2d\u201d demek isterken \u201c+2d\u201d yaz\u0131yor ya da gecikme nedeni ortadan kalkt\u0131ktan sonra gecikme s\u00fcresini oldu\u011fu gibi b\u0131rak\u0131yor. Art\u0131k zaman \u00e7izelgesinde, t\u00fcm projeyi uzatan hayali bir bo\u015fluk var ve gecikme s\u00fcresi ayr\u0131 bir sat\u0131r olarak g\u00f6r\u00fcnmedi\u011fi i\u00e7in kimse bunu fark etmiyor. Bu ba\u011flant\u0131dan sonraki t\u00fcm tarihler iki g\u00fcn yanl\u0131\u015f olur ve Gantt \u00e7ubuklar\u0131 tamamen normal g\u00f6r\u00fcn\u00fcr. <\/p>\n

Dolay\u0131s\u0131yla, bir projenin s\u00fcresi g\u00f6rev s\u00fcrelerinin toplam\u0131ndan daha uzun s\u00fcrd\u00fc\u011f\u00fcnde, her \u015feyden \u00f6nce gecikme de\u011ferlerini kontrol edin. \u00d6nceki g\u00f6rev s\u00fctununu \u201c+\u201d ve \u201c-\u201d giri\u015fleri a\u00e7\u0131s\u0131ndan inceleyin ve her birinin ge\u00e7erli bir nedeni olup olmad\u0131\u011f\u0131n\u0131 do\u011frulay\u0131n. Dale Howard\u2019\u0131n ba\u011f\u0131ml\u0131l\u0131klar\u0131n ayarlanmas\u0131na ili\u015fkin MVP k\u0131lavuzu bu konuda olduk\u00e7a a\u00e7\u0131k: Gizemli gecikmelerin \u00e7o\u011fu, kimsenin ekledi\u011fini hat\u0131rlamad\u0131\u011f\u0131 gecikmelerden kaynaklan\u0131r. <\/p>\n

Sorun Giderme: S\u0131k G\u00f6r\u00fclen Belirtiler<\/h2>\n

Tarihi de\u011fi\u015ftirdi\u011fimde hi\u00e7bir \u015fey de\u011fi\u015fmiyor.<\/strong> Muhtemelen SS veya FF\u2019dir ve yanl\u0131\u015f ucu de\u011fi\u015ftiriyorsunuz. SS, biti\u015f de\u011fi\u015fikliklerini g\u00f6z ard\u0131 eder; FF ise ba\u015flang\u0131\u00e7 de\u011fi\u015fikliklerini g\u00f6z ard\u0131 eder. T\u00fcr\u00fc de\u011fi\u015ftirin ya da g\u00f6revin di\u011fer ucunu de\u011fi\u015ftirin. <\/p>\n

Her \u015fey \u00e7ok fazla hareket ediyor.<\/strong> Genellikle, bir dizi FS ba\u011flant\u0131s\u0131, bunlara engel olan bir k\u0131s\u0131tlama veya birikmi\u015f gecikme ile kar\u015f\u0131 kar\u015f\u0131yad\u0131r. Project\u2019in hesaplama s\u0131ras\u0131na g\u00f6re k\u0131s\u0131tlamalar ba\u011f\u0131ml\u0131l\u0131klardan \u00f6ncelikli oldu\u011fundan, bir g\u00f6revin ba\u011flant\u0131y\u0131 ge\u00e7ersiz k\u0131lan \u201cBa\u015flang\u0131\u00e7 Tarihi\u201d gibi kat\u0131 bir k\u0131s\u0131tlamas\u0131 olup olmad\u0131\u011f\u0131n\u0131 kontrol edin. <\/p>\n

Bir g\u00f6revin biti\u015f zaman\u0131 de\u011fi\u015fir, ancak ba\u015flang\u0131\u00e7 zaman\u0131 sabit kal\u0131r.<\/strong> \u0130\u015fte Finish-to-Finish i\u015fini yap\u0131yor. E\u011fer istedi\u011finiz bu de\u011filse, FS\u2019ye ge\u00e7in. <\/p>\n

Biti\u015f tarihi, ba\u015fka bir g\u00f6revin ba\u015flang\u0131\u00e7 tarihine g\u00f6re ertelenir.<\/strong> \u201cBa\u015f\u0131ndan Sonuna Kadar\u201d ifadesi neredeyse her zaman yanl\u0131\u015fl\u0131kla kullan\u0131l\u0131r. Bunu asl\u0131nda kastetti\u011finiz \u015feye, muhtemelen FS\u2019ye de\u011fi\u015ftirin. <\/p>\n

\n
\n
Tek bir \u00f6nleme al\u0131\u015fkanl\u0131\u011f\u0131, t\u00fcm d\u00fczeltme \u00e7abalar\u0131ndan daha etkilidir. G\u00f6revleri birbirine ba\u011flamadan \u00f6nce, hangi u\u00e7lar\u0131n ger\u00e7ekten birbiriyle ili\u015fkili oldu\u011funu sorun: ba\u015flang\u0131\u00e7lar m\u0131, biti\u015fler mi, yoksa bir biti\u015fin bir ba\u015flang\u0131ca ba\u011flanmas\u0131 m\u0131? \u00d6nce buna cevap verin, ard\u0131ndan t\u00fcr\u00fc se\u00e7in ve sonra ba\u011flay\u0131n. T\u0131klamadan \u00f6nce ili\u015fkiyi belirlemek, \u201cprogram\u0131m neden de\u011fi\u015fti?\u201d t\u00fcr\u00fcndeki sorunlar\u0131n neredeyse tamam\u0131n\u0131n ortaya \u00e7\u0131kmas\u0131n\u0131 engeller. <\/div>\n<\/div>\n<\/div>\n

S\u0131k Sorulan Sorular<\/h2>\n

Microsoft Project\u2019te varsay\u0131lan ba\u011f\u0131ml\u0131l\u0131k t\u00fcr\u00fc nedir?<\/strong>
\nBiti\u015f-Ba\u015flang\u0131\u00e7. \u015eeritteki ba\u011flant\u0131 d\u00fc\u011fmesiyle olu\u015fturulan her ba\u011flant\u0131, G\u00f6rev Bilgisi ileti\u015fim kutusunda veya \u00f6nc\u00fcl s\u00fctunundaki k\u0131saltmada de\u011fi\u015ftirilmedi\u011fi s\u00fcrece FS olarak ayarlan\u0131r. <\/p>\n

\u201c\u00d6nceki\u201d s\u00fctunundaki k\u0131saltmay\u0131 nas\u0131l okurum?<\/strong>
\nSay\u0131, \u00f6nceki g\u00f6revin kimlik numaras\u0131d\u0131r; harfler ise t\u00fcr\u00fcn\u00fc g\u00f6sterir. \u201c7FS\u201d, 7 numaral\u0131 g\u00f6revde \u201cBiti\u015f-Ba\u015flang\u0131\u00e7\u201d anlam\u0131na gelir; \u201c7SS\u201d, \u201cBa\u015flang\u0131\u00e7-Ba\u015flang\u0131\u00e7\u201d; \u201c7FF\u201d, \u201cBiti\u015f-Biti\u015f\u201d; \u201c7SF\u201d ise \u201cBa\u015flang\u0131\u00e7-Biti\u015f\u201d anlam\u0131na gelir. \u201c+3d\u201d veya \u201c-3d\u201d son eki, gecikme veya \u00f6nc\u00fcl s\u00fcre anlam\u0131na gelir. <\/p>\n

Neden k\u00fc\u00e7\u00fck bir d\u00fczenlemeden sonra projemin tamam\u0131 uzad\u0131?<\/strong>
\n\u00c7o\u011fu zaman, istemedi\u011finiz bir gecikme s\u00fcresi birikir ya da ba\u011flant\u0131lar\u0131n\u0131z\u0131 ge\u00e7ersiz k\u0131lan bir k\u0131s\u0131tlama ortaya \u00e7\u0131kar. Project\u2019in zamanlama motoru k\u0131s\u0131tlamalar\u0131 ba\u011f\u0131ml\u0131l\u0131klardan daha \u00f6ncelikli olarak de\u011ferlendirdi\u011finden, \u00f6nc\u00fcl s\u00fctununda \u201c+\u201d de\u011ferlerini taray\u0131n ve kat\u0131 k\u0131s\u0131tlamalar olup olmad\u0131\u011f\u0131n\u0131 kontrol edin. <\/p>\n

Ne zaman \u201cBiti\u015f-Ba\u015flang\u0131\u00e7\u201d yerine \u201cBa\u015flang\u0131\u00e7-Ba\u015flang\u0131\u00e7\u201d kullanmal\u0131y\u0131m?<\/strong>
\n\u0130ki g\u00f6revin ayn\u0131 anda ba\u015flamas\u0131 gerekti\u011fi, ancak ayn\u0131 anda bitmesi gerekmedi\u011fi durumlarda. Kaz\u0131 \u00e7al\u0131\u015fmalar\u0131 ve ekipman sevkiyat\u0131 ayn\u0131 anda h\u0131z kazan\u0131r; bu nedenle bu g\u00f6revlerin ba\u015flang\u0131\u00e7lar\u0131 birbirine ba\u011fl\u0131yken, biti\u015fleri ba\u011f\u0131ms\u0131z kal\u0131r. Wrike\u2019\u0131n ba\u011f\u0131ml\u0131l\u0131k k\u0131lavuzunda paralel g\u00f6revlere ili\u015fkin daha fazla \u00f6rnek bulabilirsiniz. <\/p>\n

Teslim s\u00fcresi ile gecikme s\u00fcresi ayn\u0131 \u015fey midir?<\/strong>
\n\u201cLead\u201d negatif gecikme anlam\u0131na gelir; yani gecikme yerine \u00e7ak\u0131\u015fma s\u00f6z konusudur. \u201cFS-2d\u201d (lead), bir sonraki a\u015faman\u0131n bir \u00f6nceki a\u015fama bitmeden iki g\u00fcn \u00f6nce ba\u015flamas\u0131na izin verir. \u201cFS+2d\u201d (lag) ise, bir sonraki a\u015faman\u0131n bitiminden sonra iki g\u00fcnl\u00fck bir ara olmas\u0131n\u0131 zorunlu k\u0131lar. Ayn\u0131 alan, z\u0131t i\u015faret, z\u0131t etki. <\/p>\n

Her \u015eeyi Bir Araya Getirmek<\/h2>\n

MS Project\u2019te g\u00f6rev ba\u011f\u0131ml\u0131l\u0131klar\u0131 yanl\u0131\u015f i\u015fledi\u011finde, ilk \u015f\u00fcpheli tarihler de\u011fil, ba\u011f\u0131ml\u0131l\u0131k t\u00fcr\u00fcd\u00fcr. Belirtileri davran\u0131\u015fla e\u015fle\u015ftirin; neyin de\u011fi\u015fti\u011fini ve neyin kaym\u0131\u015f oldu\u011funu inceleyin; do\u011fru t\u00fcr kendili\u011finden ortaya \u00e7\u0131kacakt\u0131r. Ard\u0131ndan gecikme ve \u00f6nc\u00fcl s\u00fcrelerini kontrol edin; \u00e7\u00fcnk\u00fc tek ba\u015f\u0131na bir \u201c+2d\u201d hatas\u0131, di\u011fer tekil nedenlerin hepsinden daha fazla gizemli gecikmeye yol a\u00e7ar. Ba\u011flant\u0131 kurmadan \u00f6nce \u201c\u00f6nceki g\u00f6rev\u201d s\u00fctununu okuyun ve ili\u015fkiyi belirleyin; Gantt \u015femas\u0131 da d\u00fczg\u00fcn \u00e7al\u0131\u015fmaya ba\u015flayacakt\u0131r. <\/p>\n

\n
\ud83d\ude80 B\u00fcy\u00fcmenizi H\u0131zland\u0131r\u0131n<\/div>\n
Ger\u00e7ekten Tutarl\u0131 \u00c7al\u0131\u015fma Programlar\u0131 Olu\u015fturun<\/div>\n
Orijinal bir Microsoft Project lisans\u0131 edinin ve g\u00f6remedi\u011finiz ba\u011f\u0131ml\u0131l\u0131k ba\u011flant\u0131lar\u0131yla u\u011fra\u015fmaktan kurtulun.<\/div>\n

Microsoft Project\u2019i edinin \u2192<\/a><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

MS Project\u2019teki g\u00f6rev ba\u011f\u0131ml\u0131l\u0131klar\u0131, tarihlerde de\u011fi\u015fiklik oldu\u011funda zamanlaman\u0131z\u0131n nas\u0131l tepki verece\u011fini belirler. Sorun belirtisini do\u011fru ba\u011f\u0131ml\u0131l\u0131k t\u00fcr\u00fcyle e\u015fle\u015ftirin ve tarihleri de\u011fil, ba\u011flant\u0131y\u0131 d\u00fczeltin. <\/p>\n","protected":false},"author":1483,"featured_media":38244,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"inline_featured_image":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_glsr_average":0,"_glsr_ranking":0,"_glsr_reviews":0,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_post_was_ever_published":false},"categories":[371,383],"tags":[],"class_list":["post-38241","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-kilavuzlar","category-pro-tools"],"acf":[],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/keyfy.com\/wp-content\/uploads\/2026\/09\/magnific_realistic-photo-of-a-cork_DoaPvQapcl.webp","_links":{"self":[{"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/posts\/38241","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/users\/1483"}],"replies":[{"embeddable":true,"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/comments?post=38241"}],"version-history":[{"count":0,"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/posts\/38241\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/media\/38244"}],"wp:attachment":[{"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/media?parent=38241"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/categories?post=38241"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/keyfy.com\/tr\/wp-json\/wp\/v2\/tags?post=38241"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}