Citation
A Compact Optimization Approach for Job-Shop Problems. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 293-300, 2007.
Paper
Abstract
Abstract: In this paper we propose a time-indexed IP formulation for job-shop scheduling problems. We first introduce a model with variables associated to job scheduling patterns and constraints associated to machine capacities and to job assignments. The exponential number of variables calls for a column generation scheme which is carried out by a dynamic programming procedure. However, the column generation process is time-consuming. Therefore we derive an equivalent compact formulation of the model, whose dual is a flow problem with side constraints. This problem can be solved faster and fits easily into a branch-and-bound scheme.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-293-300-P, author = {G. Lancia and F. Rinaldi and P. Serafini},
title = {A Compact Optimization Approach for Job-Shop Problems},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {293--300},
note = {Paper},
abstract = {Abstract: In this paper we propose a time-indexed IP formulation for job-shop scheduling problems. We first introduce a model with variables associated to job scheduling patterns and constraints associated to machine capacities and to job assignments. The exponential number of variables calls for a column generation scheme which is carried out by a dynamic programming procedure. However, the column generation process is time-consuming. Therefore we derive an equivalent compact formulation of the model, whose dual is a flow problem with side constraints. This problem can be solved faster and fits easily into a branch-and-bound scheme.},
owner = {user},
timestamp = {2012.05.21},
webpdf = {2007-293-300-P.pdf} }