Minimizing the maximum number of open stacks by customer search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5732 LNCS, Issue , 2009, Pages 242-257

  Chu, Geoffrey ^a   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUNDS; DOMINANCE RELATION; HARD INSTANCES; MEMORY USAGE; OPTIMALITY; ORDERS OF MAGNITUDE; RELAXATION TECHNIQUES; SPEED-UPS; STATE OF THE ART;

CONSTRAINT THEORY; LINEAR PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 70350426945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04244-7_21     Document Type: Conference Paper

References (10)

1. Becceneri, J.C., Yannasse, H.H., Soma, N.Y.: A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Computers & Operations Research 31, 2315-2332 (2004)
2. Garcia de la Banda, M., Stuckey, P.J.: Dynamic programming to minimize the maximum number of open stacks. INFORMS JOC 19(4), 607-617 (2007)
3. Linhares, A., Yanasse, H.H.: Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Computers & Operations Research 29, 1759-1772 (2002)
4. Prestwich, S.: Increasing solution density by dominated relaxation. In: 4th Int. Workshop on Modelling and Reformulating Constraint Satisfaction Problems (2005)
5. Shaw, P., Laborie, P.: A constraint programming approach to the min-stack problem. Constraint Modelling Challenge 2005 [6]
6. Smith, B., Gent, I.: Constraint modelling challenge report (2005), http://www.cs.st-andrews.ac.uk/~ipg/challenge/ModelChallenge05.pdf
7. Wilson, N., Petrie, K.: Using customer elimination orderings to minimise the maximum number of open stacks. In: Constraint Modelling Challenge 2005 [6]
8. Yannasse, H.H.: On a pattern sequencing problem to minimize the maximum number of open stacks. EJOR 100, 454-463 (1997)
9. Yannasse, H.H.: A note on generating solutions of a pattern sequencing problem to minimize the maximum number of open orders. Technical Report LAC-002/98, INPE, São José dos Campos, SP, Brazil (1998)
10. Yuen, B.J., Richardson, K.V.: Establishing the optimality of sequencing heuristics for cutting stock problems. EJOR 84, 590-598 (1995)