پایان نامه ها و مقالات

منابع تحقیق با موضوع machine، scheduling، objective، job

دانلود پایان نامه

ng problem with makespan and maximum lateness objectives’’ Applied Mathematical Modelling 34 (2010) 314–324

[21]C.S. Sung, Y.I. Choung, J.M. Hong, Y.H. Kim’’ Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals’’ Computers & Operations Research 29 (2002) 995}1007

[22]Shiqing Yao,ZhibinJiang , NaLi’’ A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals’’ Computers & Operations Research 39 (2012) 939–951

[23]Zhaohui Liu, T.C. Edwin Cheng’’ Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine’’ Theoretical Computer Science 347 (2005) 288 – 298

[24]Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, and T Meyarivan’’ A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II’’2002

[25]Abdullah Konak, David W. Coit, Alice E. Smit’’ Multi-objective optimization using genetic algorithms: A tutorial’’ Reliability Engineering and System Safety 91 (2006) 992–1007

[26]Eckart Zitzler, Marco Laumanns, and Lothar Thiele’’ SPEA2: Improving the Strength Pareto Evolutionary Algorithm’’ May 2001 Errata added Sept 27, 2001

[27]Dipart.di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi’’ Finding the Pareto-optima for the total and maximum tardiness single machine problem’’ Discrete Applied Mathematics15 December 2002, Pages 117–126
[28] Rock Lin, Ching-Jong Liao’’ A case study on batch scheduling for an assembly shop’’ International Journal of Production Economics, Volume 139, Issue 2, October 2012, Pages 473-483
[29] Arnaud Malapert, Christelle Guéret, Louis-Martin Rousseau’’ A constraint programming approach for a batch processing problem with non-identical job sizes‘’ European Journal of Operational ResearchVolume 221, Issue 3, 16 September 2012, Pages 533–545
[30] Xuesong Li, Hiroaki Ishii, Teruo Masuda’’ Single machine batch scheduling problem with fuzzy batch size’’ Computers & Industrial Engineering, Volume 62, Issue 3, April 2012, Pages 688-692
[31] Xuesong Li, Hiroaki Ishii, Teruo Masuda’’single machine batch scheduling problem with fuzzy batch size  Computers & Industrial Engineering, Volume 62, Issue 3, April 2012, Pages 688-692
[32] Mohammad Mahdavi Mazdeh, Sara Shashaani, Armin Ashouri, Khalil S. Hindi’’single machine batch scheduling minimizing weighted flow times and delivery costs’’ Applied Mathematical Modelling, Volume 35, Issue 1, January 2011, Pages 563-570
[33] Subhash C. Sarin, Lixin Wang, Ming Cheng’’ a single-machine,single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times’’ Computers & Operations Research, Volume 39, Issue 7, July 2012, Pages 1411-1418
[34] Pinedo, M. (2008). Scheduling: Theory, algorithms, and systems (3rd ed.). Springe

این مطلب مشابه را هم بخوانید :   پایان نامه رایگان درموردreading، recognition، form، knowledge

[35] Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: A review. Operations Research, 38, 22–36

[36]Bagchi.t.p.’’multi objective scheduling by genetic algorithms’’.kluwer academic publisherd(1999).

[37]Fouseca,c.m.’’an overview of evolutionary algorithms in multi objective optimization.’’evolutionary computation (1995).

[38]Steuer,r.e.’’multi criteria optimization :theory,computation and application’’ wiley(1986).

[39]Coello,c.a,lamont,g.b,’’evolutionary algorithms for solving multi objective problems’’ .kluwer academic publishers.(2002)

[40]Hendel,f.sourd,f.’’the one machine just-in-time scheduling problem.’’discrete optimization,(2009).6.10-22.

[41]Al jadaan,o.rajamani,l.rao,c.r.’’non-dominated ranked genetic algorithm for solving multi objective optimization problems:NRGA ‘’journal of theoretical and applied information technology,(2008).

[42]Harl,n.chen.’’multi objective single machine scheduling with non traditional requirements’’.international journal of production economics,(2007),106.574-584.

[43]Koksalan,m.’’A heuristic approach to bi criteria scheduling’’.naval research logistics(1999).46,777-789.

[44]Koksalan,m.’’using genetic algorithms for single machine bi criteria scheduling’’ European journal of operational research(2003)145,543-556.

[45]Koktener,e.k.koksalan,m.’’simulated annealing approach to bi criteria scheduling problems on a single machine.’’journal of heuristics (2000)6,311-327.

[46]Guner,e.’’one machine scheduling to minimize maximum earliness with minimum number of tardy job.’’international journal of production economics(1998).55,213-219.

[47]s.azizoglu,m.koksalan.’’single machine scheduling with maximum earliness and number of tardy job’’.computer and industrial engineering.(2005)257-269.

[48]Steinur,g.’’pareto optimal for total weighted completion time and maximum lateness on a single machine’’ .discrete applied mathematics (2007).

[49]Billaut.j.c.’’multi criteria scheduling theory,models and algorithms’’.france springer(2005).

[50]Rahmani.k,mahdavi.i’’,non-dominated ranked genetic algorithm for bi objective single machine scheduling.’’international journal of advanced manufacturing technology(2011).

[51]Mavrotas,g,’’effective implementation of the ε-constraint method in multi objective mathematical programming problems’’.math comput(2009)455-465.

[52]Gendreau,m.’’an exact ε-constraint method for bi objective combinatorial optimization problems’’.eur 750 j oper res (2009).

[53]Zitzler.e.’’multi objective evolutionary algorithms:A comparative case study and the strength pareto approach’’ .IEEE(1999).257-271.

[54]Zitzler.e.’’SPEA2:improving the strength pareto evolutionary algorithm’’.smitzerland(2001).

[55]Al jadaan.o.’’ranked based roulette wheel selection method’’,israma,calculate mathematical society(2005).

[56]Al jadaan.o.’’parametric study to enhance genetic algorithm performance ,using ranked based roulette wheel selection method’’,merida spain(2006)274-278.

[57]Chen.c.l.’’complexity of single machine multi criteria scheduling problems’’.eur j oper res (1995).115-125.

[58] sirinvias,deb.‘’multi objectiveoptimization using non dominated sorting in genetic algorithm’’indian technology 1995.
[59] Sujay Malvea, Reha Uzsoy’’A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families’’Computers & Operations Research 34 (2007) 3016 – 3028.
[60] Ali Husseinzadeh Kashan, Behrooz Karimi, Masoud Jenabi’’A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes’’Computers & Operations Research 35 (2008) 1084 – 1098.

Leave a Reply