Complete Characterization of $\epsilon$-approximate Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem
integration of ai and or techniques in constraint programming(2012)
摘要
In a two-machine flow shop scheduling problem, the set of $\epsilon$-approximate sequences (i.e., solutions within a factor $1+\epsilon$ of the optimal) can be mapped to the vertices of a permutation lattice. We introduce two approaches, based on properties derived from the analysis of permutation lattices, for characterizing large sets of near-optimal solutions. In the first approach, we look for a sequence of minimum level in the lattice, since this solution is likely to cover many optimal or near-optimal solutions. In the second approach, we look for all sequences of minimal level, thus covering all $\epsilon$-approximate sequences. Integer linear programming and constraint programming models are first proposed to solve the former problem. For the latter problem, a direct exploration of the lattice, traversing it by a simple tree search procedure, is proposed. Computational experiments are given to evaluate these methods and to illustrate the interest and the limits of such approaches.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络