A branch and cut approach for workload smoothing on assembly lines

INFORMS Journal on Computing

Volumn 9, Issue 4, 1997, Pages 335-350

  Pinnoi, Anulark ^a   Wilhelm, Wilbert E ^b  

^a ASIAN INSTITUTE OF TECHNOLOGY   (Thailand)

^b Texas AandM University   (United States)

Author keywords

Branch and cut

Indexed keywords

EID: 0011717224     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.9.4.335     Document Type: Article

References (9)

1. S. BAASE, 1988. Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, Reading, MA.
2. I. BAYBARS, 1986a. A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem. Management Science 32, 909-932.
3. I. BAYBARS, 1986b. An Efficient Heuristic Method for the Simple Assembly Line Balancing Problem. International Journal of Production Research 24, 149-166.
4. H. CROWDER, E.L. JOHNSON, and M. PADBERG, 1983. Solving Large-Scale Zero-One Linear Programming Problems. Operations Research 31, 803-834.
5. M.R. GAREY and D.S. JOHNSON, 1979. Computers and Intractability A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York.
6. S. GHOSH and R.J. GAGNON, 1989. A Comprehensive Literature Review and Analysis of the Design, Balancing and Scheduling of Assembly Systems. International Journal of Production Research 27, 637-670.
7. S.T. HACKMAN, M.J. MAGAZINE, and T.S. WEE, 1989. Fast, Effective Algorithms for Simple Assembly Line Balancing Problems. Operations Research 37, 916-924.
8. K.L. HOFFMAN and M. PADBERG, 1993. Solving Airline Crew Scheduling Problems by Branch-and-Cut. Management Science 39, 657-682.
9. T.R. HOFFMANN, 1990. Assembly Line Balancing: A Set of Challenging Problems. International Journal of Production Research 28, 1807-1815.