Machine scheduling by column-and-row generation on the time-indexed formulation

Ruslan Sadykov 1, 2 François Vanderbeck 1, 2
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : We consider the general machine scheduling problem to minimize the scheduling cost. One of the most efficient approaches to solve this problem is to use time-indexed Integer Programming formulation. However, the size of this formulation is very big, and even solving its Linear Programming (LP) relaxation is very time consuming. In this work, we apply the column-and-row generation approach to solve the LP relaxation of the time-indexed formulation in significantly less amount of time.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-00649184
Contributor : Ruslan Sadykov <>
Submitted on : Wednesday, December 7, 2011 - 11:51:03 AM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM
Long-term archiving on : Friday, November 16, 2012 - 2:40:24 PM

File

colRowGen4TimeIndexForm_MAPSP3...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00649184, version 1

Citation

Ruslan Sadykov, François Vanderbeck. Machine scheduling by column-and-row generation on the time-indexed formulation. 10th International Workshop on Models and Algorithms for Planning and Scheduling Problems, Jun 2011, Nymburk, Czech Republic. pp.55-57. ⟨hal-00649184⟩

Share

Metrics

Record views

362

Files downloads

251