Heuristics for solving flow shop scheduling problem under resources constraints

详细信息    查看全文

• 作者：Imane Laribi^* ; ^{im.laribi@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; Farouk Yalaoui^** ; ^{farouk.yalaoui@utt.fr" class="auth_mail" title="E-mail the corresponding author} ; Fayç ; al Belkaid^* ; ^{f_belkaid@yahoo.fr" class="auth_mail" title="E-mail the corresponding author} ; Zaki Sari^*** ; ^{z_sari@mail.univ-tlemcen.dz" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Scheduling ; flow shop ; heuristics ; no renewable resource ; makespan
• 刊名：IFAC-PapersOnLine
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：49
• 期：12
• 页码：1478-1483
• 全文大小：495 K

文摘

Most of traditional scheduling problems deal with machine as the only resource, however, other resources such as raw materials is often disregards. Considering the second resource makes scheduling problems more realistic and practical to implement in manufacturing industries. Due to the applicability of flow shop environment in different manufacturing, scheduling of these types of shops are extensively studied by several authors. However, introducing an additional resource in this environment is not well studied. The present work deals with makespan minimization in flow shop scheduling problems where no renewable resources constraints are considered. The paper illustrates the importance of Johnson (1954) algorithm for the two machine flow shop under resources constraints. A mathematical model is also presented. Then a well-know heuristic is adapted to propose fast solution for the m machines flow shop problem subject to resource constraint.