Aky? tipi çizelgeleme probleminde, n adet birbirinden ba?ymsyz i?, ayny syra ile birbirinden farkly m adet makinede i?lem görmektedir. Bu ara?tyrmada, erken ve geç cezaly, ortak teslim tarihi olan permütasyon aky? tipi çizelgeleme problemleri incelenmi?tir. Erken ve geç cezaly permütasyon aky? tipi çizelgeleme, NP-Zor problemler kapsamynda yer almaktadyr. Bu problemlerin çözümünde, yapay zekâ tekniklerinden olan da?ynyk arama metasezgiseli kullanylmy?tyr. Erken ve geç cezaly, ortak teslim tarihli permütasyon aky? tipi kyyaslama problemi, önerilen da?ynyk arama metodu ile çözülmü?tür.

In a permutation flow shop scheduling problem, n independent jobs have to be processed in the same order on m different machines. In this study, the permutation flow shop scheduling problem with earliness and tardiness penalties and common due date for jobs is considered. The permutation flow shop scheduling with earliness and tardiness penalties is known NP-hard problem. A scatter search which known a metaheuristic method is used to solve this permutation flow shop scheduling problem. A benchmark permutation flow shop scheduling with earliness and tardiness penalties and common due date problem is solved by proposed scatter search method.