An empirical analysis of integer programming formulations for the permutation flowshop

作     者：Tseng, FT Stafford, EF Gupta, JND 

作者机构：Univ Alabama Coll Adm Sci Huntsville AL 35899 USA 

出 版 物：《OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE》 (国际管理科学杂志)

年 卷 期：2004年第32卷第4期

页      面：285-293页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

主　　题：flowshop scheduling minimizing makespan mixed-integer linear programming computational comparisons 

摘      要：An empirical analysis was conducted to assess the relative effectiveness of four integer programming models for the regular permutation flowshop problem. Each of these models was used to solve a set of 60 flowshop problems. Analysis of the resultant computer solution times for each model indicated that the two assignment problem based models solved these problem instances in significantly less computer time than either of the two dichotomous constraints based models. Further, these computer solution time differences increased dramatically with increased numbers of jobs and machines in the flowshop problem. These results contradict Pan s conclusion that a variant of Manne s dichotomous constraints approach was superior to the assignment problem approaches of Wagner and Wilson because the Manne model required less than half of the binary integer variables required by the assignment problem based models. (C) 2004 Elsevier Ltd. All rights reserved.