Using interval graphs in an order processing optimization problem

WCE 2010 - World Congress on Engineering 2010

Volumn 3, Issue , 2010, Pages 1722-1728

  Lopes, Isabel Cristina ^a   De Carvalho, J M Valério ^b  

^a Inst Politécnico do Porto   (Portugal)

^b UNIVERSITY OF MINHO   (Portugal)

Author keywords

Integer programming; Interval graphs; MOSP; Open orders minimization; Pathwidth

Indexed keywords

ELIMINATION SCHEME; INTEGER PROGRAMMING MODELS; INTERVAL GRAPH; MOSP; OPEN ORDERS MINIMIZATION; OPTIMAL SEQUENCE; OPTIMIZATION PROBLEMS; ORDER PROCESSING; PATHWIDTH;

COMPUTER PROGRAMMING; OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 79959812748     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. P. Baptiste, "Simple MIP formulations to minimize the maximum number of open stacks," in Constraint Modelling Challenge. Edinburgh, Scotland: IJCAI 2005, Jul 31 2005, pp. 9-13.
2. J. C. Becceneri, H. H. Yanasse, and N. Y. Soma, "A method for solving the minimization of the maximum number of open stacks problem within a cutting process," Computers & Operations Research, vol. 31, no. 14, pp. 2315-2332, 2004.
3. T. Biedl, CS 762: Graph-theoretic algorithms - Lecture notes of a graduate course, University of Waterloo, Sep 2005.
4. M. Campêlo, V. A. Campos, and R. C. Corrêa, "On the asymmetric representatives formulation for the vertex coloring problem," Discrete Applied Mathematics, vol. 156, no. 7, pp. 1097-1111, 2008.
5. J. Díaz, J. Petit, and M. Serna, "A survey of graph layout problems," ACM Computing Surveys, vol. 34, no. 3, pp. 313-356, Sep 2002.
6. M. C. Golumbic, Algorithmic graph theory and perfect graphs. New York: Academic Press, 1980.
7. A. Linhares and H. H. Yanasse, "Connections between cutting-pattern sequencing, VLSI design, and flexible machines," Computers & Operations Research, vol. 29, no. 12, pp. 1759-1772, 2002.
8. S. Olariu, "An optimal greedy heuristic to color interval graphs," Information Processing Letters, vol. 37, no. 1, pp. 21-25, 1991.
9. H. H. Yanasse, "Minimization of open orders - polynomial algorithms for some special cases," Pesquisa Operacional, vol. 16, no. 1, pp. 1-26, June 1996.
10. -, "On a pattern sequencing problem to minimize the maximum number of open stacks," European Journal of Operational Research, vol. 100, pp. 454-463, 1997.