SOLVING JOB-SHOP SCHEDULING PROBLEMS WITH FUZZY DURATIONS USING GENETIC ALGORITHMS

دانشگاه آزاد اسلامی اصفهان(خوراسگان)

منو

رکورد قبلی

رکورد بعدی

" SOLVING JOB-SHOP SCHEDULING PROBLEMS WITH FUZZY DURATIONS USING GENETIC ALGORITHMS "

Document Type	:	Latin Dissertation
Language of Document	:	English
Record Number	:	151521
Doc. No	:	ET23313
Main Entry	:	OMAR A. GHRAYEB
Title Proper	:	SOLVING JOB-SHOP SCHEDULING PROBLEMS WITH FUZZY DURATIONS USING GENETIC ALGORITHMS
Note	:	This document is digital این مدرک بصورت الکترونیکی می باشد
Abstract	:	in reality, the processing times are often imprecise and this imprecision iscritical for the scheduling procedure. This research presents a genetic algorithmapproach to optimizing job shop scheduling problems, in which imprecise processingtimes are modeled as fuzzy numbers. The approach relies on using triangular fuzzynumbers to represent the imprecision in processing times. The strength of thisapproach is that the produced schedule is less sensitive to variations in processingtimes.Because three-point (triangular) fuvy numbers are used to representimprecise processing times, the makespan will also be a three-point f!bzzy number. Aswe know, the makespan is the longest completion time of all the jobs. The completiontime of any job on any machine is equal to the starting time plus the processing time....-....,....-...,..tested for theQ1 PC1 bus cardBoth these projects mere sofixare des elopment efforts tonards contributing to dlfferentaspects of Roboucs and lZ1echatronics projects m the Controls and Roboucs Group..
Subject	:	Electericl tess
	:	برق
electronic file name	:	TL46550.pdf
Title and statement of responsibility and	:	SOLVING JOB-SHOP SCHEDULING PROBLEMS WITH FUZZY DURATIONS USING GENETIC ALGORITHMS [Thesis]