CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times

عنوان مقاله: Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
شناسه ملی مقاله: JR_JOIE-7-16_002
منتشر شده در شماره 16 دوره 7 فصل Summer and Autumn در سال 1393
مشخصات نویسندگان مقاله:

Behzad Nikjo - MSc, Department of industrial engineering, Mazandaran University of Science and Technology, Babol, Iran
Javad Javad - Assistant Professor, Department of industrial engineering, Mazandaran University of Science and Technology, Babol, Iran

خلاصه مقاله:
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completiontime of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal solution forthis type of complex problem in large sizes in reasonable computational time using traditional approaches or optimization tools isextremely difficult. A meta-heuristic method based on Simulated Annealing (SA) is proposed to solve the presented model. Based on thecomputational analyses, the proposed algorithm was found efficient and effective at finding good quality solutions.

کلمات کلیدی:
Scheduling, Simulate annealing, Flow line manufacturing, Setup times, Makespan

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/790984/