Set partitioning and packing versus assignment formulations for subassembly matching problems

Journal of the Operational Research Society

Volumn 62, Issue 11, 2011, Pages 2023-2033

  Ghoniem, A ^a   Sherali, H D ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

column generation; selective assembly; set packing; set partitioning; symmetry defeating constraints

Indexed keywords

COMBINATORIAL OPTIMIZATION;

COLUMN GENERATION; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; NEAR-OPTIMAL SOLUTIONS; QUALITY CHARACTERISTIC; SELECTIVE ASSEMBLY; SET PACKING; SET PARTITIONING;

LINEAR PROGRAMMING;

EID: 80053534170     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2010.165     Document Type: Article

References (21)

1. Barnhart C, Johnson EL, Nemhauser GL, Sigismondi G and Vance P (1993). Formulating a mixed integer programming problem to improve solvability. Opns Res 41(6): 1013-1019.
2. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh M and Vance PH (1998). Branch-and-price: Column generation for solving huge integer programs. Opns Res 46: 316-329. (Pubitemid 128655433)
3. Coullard CR, Gamble AB and Jones PC (1998). Matching problems in selective assembly operations. Ann Opns Res 76: 95-107. (Pubitemid 128405199)
4. Gent IP, Petrie KE and Puget J-F (2006). Symmetry in constraint programming. In: Rossi F, van Beek P and Walsh T (eds). Handbook of Constraint Programming. Elsevier: Amsterdam, pp 329-376.
5. Ghoniem A and Sherali HD (2009). Complementary column generation and bounding approaches for set partitioning formulations. Optim Lett 3(1): 123-136.
6. Glover F (1976). Maximum matching in a convex bipartite graph. Nav Res Logist Q 14: 313-316.
7. Iwata S, Matsui T and McCormick ST (1998). A fast bipartite network flow algorithm for selective assembly. Opns Res Lett 22: 137-143. (Pubitemid 128676371)
8. Jeroslow RG and Lowe JK (1985). Experimental results on the new techniques for integer programming formulation. J Opl Res Soc 36: 393-403. (Pubitemid 15508985)
9. Kannan SM and Jayabalan V (2001). A new grouping method for minimizing the surplus parts in selective assembly. Qual Eng 14(1): 67-75.
10. Kannan SM, Jayabalan V and Jeevanantham K (2003). Genetic algorithm for minimizing assembly variation in selective assembly. Int J Prod Res 41(14): 3301-3313.
11. Lubbecke ME and Desrosiers J (2005). Selected topics in column generation. Opns Res 53(6): 1007-1023. (Pubitemid 43061815)
12. Mansoor EM (1961). Selective assembly-Its analysis and applications. Int J Prod Res 1: 13-24.
13. Margot F (2010). Symmetry in integer linear programming. In: Junger M, Liebling TM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi G and Wolsey LA (eds). 50 Years of Integer Programming 1958-2008. Springer: Heidelberg, pp 647-686.
14. Musa R and Chen FF (2008). Simulated annealing and ant colony optimization algorithms for the dynamic throughput maximization problem. Int J Adv Manuf Tech 37(7): 837-850. (Pubitemid 351601469)
15. Musa R, Chen FF and Ghoniem AS (2006). Dynamic variation reduction technique in assembly lines after batch inspection. IIE Annual Conference and Expo, Orlando, FL, May.
16. Sherali HD and Smith JC (2001). Improving discrete model representations via symmetry considerations. Mngt Sci 47: 1396-1407. (Pubitemid 34192849)
17. Williams HP (1974). Experiments in the formulation of integer programming problems. Math Program Stud 2: 180-197.
18. Williams HP (1978). The reformulation of two mixed integer programming problems. Math Program 14: 325-331.
19. Williams HP (1999). Model Building in Mathematical Programming. Wiley: New York.
20. Wolsey LA (1989). Strong formulations for mixed integer programming: A survey. Math Program 45: 173-191.
21. Wolsey LA (2003). Strong formulations for mixed integer programs: Valid inequalities and extended formulations. Math Program 97(1-2): 423-447.