Time-Indexed Formulations and the Total Weighted Tardiness Problem

Authors:
Louis-Philippe Bigras;Michel Gamache;Gilles Savard
Affiliations:
École Polytechnique de Montréal and GERAD, Montréal, Québec H3C 3A7, Canada;École Polytechnique de Montréal and GERAD, Montréal, Québec H3C 3A7, Canada;École Polytechnique de Montréal and GERAD, Montréal, Québec H3C 3A7, Canada
Venue:
INFORMS Journal on Computing
Year:
2008

Citing 0
Cited 4

Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment

Computers and Operations Research
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

Computers and Operations Research
Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivity

Computers and Operations Research
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Asolution 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.