Manufacturer's mixed pallet design problem

European Journal of Operational Research

Volumn 186, Issue 2, 2008, Pages 826-840

  Yaman, Hande ^a   Şen, Alper ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Complexity; Distribution; Mixed pallet design; Valid inequalities

Indexed keywords

BEVERAGES; COMPUTATIONAL COMPLEXITY; CONSUMER PRODUCTS; COSTS; LINEAR PROGRAMMING; OPTIMIZATION; PALLETS;

MIXED PALLET DESIGN; VALID INEQUALITIES;

PROBLEM SOLVING;

EID: 35348933185     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.02.007     Document Type: Article

References (21)

1. Aichlmayr M. Robots to the rescue. Transportation & Distribution 43 9 (2002) 60
2. Andel T. Customer intimacy changes unit loads to rainbows. Transportation & Distribution 39 8 (1998) 104
3. Barrese R. Outsourcing becomes ingredient to success: Pasta maker relies on 3PL to provide a variety of special services. Food Logistics 15 April (2002) 39
4. Belvaux G., and Wolsey L.A. bc-prod: A specialized branch-and-cut system for lot-sizing problems. Management Science 46 (2000) 724-738
5. Beverage Industry, 2001. The Benefits of Automation 92(6), 76.
6. Bischoff E.E., and Ratcliff M.S.W. Loading multiple pallets. Journal of the Operational Research Society 46 (1995) 1322-1336
7. Food & Drug Packaging, 2000. Software 64(10), 71.
8. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
9. Gilmore P.C., and Gomory R.E. Multi stage cutting stock problems of two or more dimensions. Management Science 13 (1965) 94-119
10. Grocery Marketing, 1996. Squeezing Out Waste of Space 62(5), 112.
11. Hifi M. Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study. Computers & Operations Research 31 (2004) 657-674
12. Marchand H., and Wolsey L.A. Aggregation and Mixed Integer Rounding to solve MIPs. Operations Research 49 (2001) 363-371
13. Mazur, D.R., 1999. Integer programming approaches to a multi-facility location problem. Ph.D. Thesis, John Hopkins University.
14. Miller A.J., and Wolsey L.A. Tight MIP formulations for multi-item discrete lot-sizing problems. Operations Research 51 (2003) 557-565
15. Modern Materials Handling, 2001. Thirsty for Profits 1(May), 3.
16. Nemhauser G., and Wolsey L.A. Integer and Combinatorial Optimization (1988), Wiley
17. Pochet Y., and Wolsey L.A. Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation. Discrete Applied Mathematics 59 (1995) 57-74
18. Pochet Y., and Wolsey L.A. Production Planning by Mixed Integer Programming (2006), Springer
19. Redman R. Loads of variety mixed pallets containing multiple varieties of popular products are delivering efficiencies to the store. Supermarket News 26 February (1996) 66
20. Witt C.E. Transport packaging: The next frontier of cost reduction. Material Handling Engineering 50 12 (1995) 55
21. Yaman, H., 2005. The Integer Knapsack Cover Polyhedron. SIAM Journal on Discrete Mathematics, to appear.