پديد آورنده :
توسلي، نرگس
عنوان :
الگوريتم هاي مساله زمان بندي
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
علوم رياضي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي
صفحه شمار :
[يازده]، [هفتاد و نه]ص.: مصور، جدول
استاد راهنما :
رامين جوادي
واژه نامه :
انگليسي به فارسي; فارسي به انگليسي
توصيفگر ها :
زمان بندي , زمان بندي تك ماشين , الگوريتم شبه چند جمله اي
استاد داور :
بهناز عمومي، زينب مالكي
تاريخ ورود اطلاعات :
1397/05/23
چكيده انگليسي :
Algorithms for Scheduling Problem Narges Tavassoli n tavassoli@math iut ac ir June 2018 MSc Thesis in Farsi Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 8311 IranSupervisor Dr Ramin Javadi rjavadi@cc iut ac irKeywords Scheduling Single machine Makespan Approximation algorithm Heuristic Primal dual schema Preventive maintenance Release date Completion timeAbstract Numerous studies for scheduling problems have appeared and developed over the past fifty yearsand earned a particular value to become a popular subject with a rich background of simple andcomplex algorithms and rules In general scheduling problems cover a broad range of practi cal problems The scheduling problem is one of the most important combinatorial optimizationproblems The most basic version is as follows We are given n jobs J1 J2 Jn of varyingprocessing times which need to be scheduled on m machines with varying processing power while trying to minimize the makespan The makespan is the total processing times of the sched ule A mathematical statement of the problem can be made as follows Let M M1 M2 Mm and J J1 J2 Jn be two finite sets On account of theindustrial origins of the problem the Mi are called machines and the Jj are called jobs Let Xdenote the set of all sequential assignments of jobs to machines such that every job is done byevery machine exactly once elements x X may be written as n m matrices in which columni lists the jobs that machine Mi will do in order Suppose also that there is some cost functionC X 0 The cost function may be interpreted as a total processing time and mayhave some expression in terms of times Cij M J 0 the cost time for machine Mito do job Jj The problem is to find an assignment of jobs x X such that C x is a minimum that is there is no y X such that C x C y As a result of rapid developments in production technologies in recent years scheduling prob lems have become increasingly important Companies must adhere to their commitments to
استاد راهنما :
رامين جوادي
استاد داور :
بهناز عمومي، زينب مالكي
