Time-indexed formulations and the total weighted tardiness problem

被引：28

作者：

Bigras, Louis-Philippe ^{[1
]}

Gamache, Michel

Savard, Gilles

机构：

[1] Ecole Polytech, Montreal, PQ H3C 3A7, Canada

来源：

INFORMS JOURNAL ON COMPUTING | 2008年 / 20卷 / 01期

关键词：

time-indexed formulation; single-machine scheduling problem; Dantzig-Wolfe decomposition; time-decomposition;

D O I：

10.1287/ijoc.1070.0225

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 [计算机应用技术]; 0835 [软件工程];

摘要：

A solution approach based on the column-generation technique is presented for solving a time-indexed formulation of the total weighted tardiness problem. An acceleration strategy based on a decomposition of the time horizon into subperiods, where each subperiod is associated with a subproblem of the column-generation approach, is used to solve the linear relaxation. Branching strategies and dominance rules are also applied to find the optimal integer solution. Using this new approach, it is possible to solve to optimality 117 out of 125 open problems of the OR-Library.

引用

页码：133 / 142

页数：10

共 34 条

[1]

A SURVEY OF ALGORITHMS FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS SCHEDULING PROBLEM [J].