|
|
|
|
Technical note: Flexible flowshop scheduling with equal number of unrelated parallel machines
|
|
|
|
|
|
|
|
نویسنده
|
Mahdavi I. ,Zarezadeh V. ,Shahnazari-Shahrezaei P.
|
|
منبع
|
journal of industrial engineering international - 2011 - دوره : 7 - شماره : 13 - صفحه:74 -83
|
|
چکیده
|
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelatedparallel machines. the objective is to minimize the makespan for a given set of jobs in the system. thisproblem class is np-hard in the strong sense, so a hybrid heuristic method for sequencing and thenallocating operations of jobs to machines is developed. a number of test problems are randomly generated and results obtained by proposed heuristic are compared with optimal solutions reported by the lingo 8.0 package applying the branch & bound approach. the results show that the proposed hybrid method is more efficient when the problem sizes have been increased
|
|
کلیدواژه
|
Flexible flowshop; Makespan; Unrelated machines
|
|
آدرس
|
mazandaran university of science and technology, Dep of Industrial Engineering, ایران, mazandaran university of science and technology, Dep of Industrial Engineering, ایران, islamic azad university, Dep of Industrial Engineering, ایران
|
|
پست الکترونیکی
|
irajarash@rediffmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|