|
|
|
|
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
|
|
|
|
|
|
|
|
نویسنده
|
Nahavandi Nasim ,asadi Gangraj ,Ebrahim
|
|
منبع
|
international journal of industrial engineering and production research - 2014 - دوره : 25 - شماره : 1 - صفحه:65 -70
|
|
چکیده
|
Flexible flow shop scheduling problem (ffs) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. the objective consists of minimizing the maximum completion time. because of np-completeness of ffs problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. therefore, for assessment the quality of this heuristic, this paper develop a global lower bound on ffs makespan problems with unrelated parallel machines.
|
|
کلیدواژه
|
Lower bound; Flexible flow shop; Makespan; Unrelated parallel machines
|
|
آدرس
|
arbiat Modares University,, Associate Professor of Industrial Engineering, Department of Industrial Engineering, T Tehran, Iran,, ایران, arbiat Modares University,, PhD student, Department of Industrial Engineering, Faculty of Engineering, TTehran, Iran , ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|