Volume 25, Issue 1 (IJIEPR 2014)                   IJIEPR 2014, 25(1): 65-70 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Nahavandi N, Asadi Gangraj E. A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines. IJIEPR 2014; 25 (1) :65-70
URL: http://ijiepr.iust.ac.ir/article-1-478-en.html
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Nasim Nahavandi 1, Ebrahim Asadi Gangraj
1- Tarbiat Modares University , n_nahavandi@modares.ac.ir
Abstract:   (6170 Views)
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.
Keywords: lower bound, flexible flow shop, makespan, unrelated parallel machines
Full-Text [PDF 401 kb]   (3157 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2012/11/28 | Accepted: 2013/07/6 | Published: 2014/02/2
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.