Improved integer programming models for simple assembly line balancing and related problems

被引：22
|
作者：
Ritt, Marcus [1 ]
Costa, Alysson M. [2 ]
机构：
[1] Univ Fed Rio Grande do Sul, Inst Informat, Ave Bento Goncalves 9500, Porto Alegre, RS, Brazil
[2] Univ Melbourne, Sch Math & Stat, Parkville, Vic 3010, Australia
来源：
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2018年 / 25卷 / 04期
关键词：
assembly line balancing; integer linear programming; valid inequalities; precedence constraints; station limits; U-LINES; CONSTRAINTS; PRECEDENCE; SOLVE;
D O I：
10.1111/itor.12206
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We propose a stronger formulation of the precedence constraints and the station limits for the simple assembly line balancing problem. The linear relaxation of the improved integer program theoretically dominates all previous formulations using impulse variables, and produces solutions of significantly better quality in practice. The improved formulation can be used to strengthen related problems with similar restrictions. We demonstrate their effectiveness on the U-shaped assembly line balancing problem and on the bin packing problem with precedence constraints.
引用
收藏
页码：1345 / 1359
页数：15
相关论文
共 50 条
12345