On the exact solution of the no-wait flow shop problem with due date constraints

详细信息    查看全文

• 作者：Hamed Samarghandi^a ; ^{samarghandi@edwards.usask.ca} ; ^{hamed.samarghandi@gmail.com} ; Mehdi Behroozi^b ; ^{m.behroozi@neu.edu}
• 关键词：No-wait flow shop ; Due date constraints ; Mixed integer programming ; Constraint programming ; Enumeration algorithm
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：May 2017
• 年：2017
• 卷：81
• 期：Complete
• 页码：141-159
• 全文大小：900 K
• 卷排序：81

文摘

Five different mathematical programming models and two constraint programming models are developed for the no-wait flow shop problem with due date constraints. Unique characteristics of the problem are discussed and a number of propositions are proved; an exact algorithm that takes advantage of such characteristics is designed. Solving and implementation complications are discussed in detail. Thorough computational experiments are performed to compare the performance of the developed models and algorithms.