Machine assignment in a nonlinear multi-product flowline

Journal of the Operational Research Society

Volumn 54, Issue 5, 2003, Pages 472-489

  Diponegoro, A ^a   Sarker, B R ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

Heuristic solution; Machine location problem; Multi product flowline

Indexed keywords

ALIGNMENT; HEURISTIC METHODS; MACHINERY; OPTIMAL SYSTEMS; PRODUCTION ENGINEERING; STRATEGIC PLANNING; WORK SIMPLIFICATION;

HEURISTIC STRATEGY; MACHINE ASSIGNMENT; NONLINEAR MULTIPRODUCT FLOWLINE;

OPERATIONS RESEARCH;

EID: 0038617638     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601488     Document Type: Article

References (36)

1. Aneke NAG and Carrie AS (1986). A design technique for the layout of multi-product flowlines. Int J Prod Res 24: 471-481.
2. Sarker BR, Wilhelm WE and Hogg GL (1998) One-dimensional machine location problems in a multi-product flowline with equidistant locations. Eur J Opl Res 105: 401-426.
3. Houshyar A and McGinnis LF (1990). A heuristic for assigning facilities to locations to minimize WIP travel distance in a linear facility. Int J Prod Res 28: 1485-1498.
4. Chow WM (1983). An analysis of automated storage and retrieval systems in manufacturing assembly lines. IBM Technical Report TR-02.1082, IBM General Product Division, San Jose, CA, USA.
5. Heragu SS and Kusiak A (1988). Machine layout problem in flexible manufacturing system. Opns Res 36: 258-268.
6. Parija GR, Clark RH and Wilson DG (1995). Solving quadratic assignment problems using parallel OSL. EKKNews, 15 (1st and 2nd Quarter): 8-10, (IBM Corporation, Poughkeepsie, NY 12601).
7. Heragu SS (1994). Exact solution approaches for the single-row layout problem. In: Burke L and Jackman J (eds). Proceedings of the 3rd Industrial Engineering Research Conference. Institute of Industrial Engineers, Norcross, GA, pp. 582-587.
8. Sahni S and Gonzalez T (1976). P-Complete approximation problems. J ACM 23: 556-565.
9. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company: New York, NY.
10. Drezner Z and Wesolowski GO (1995). Location on a one-way rectilinear grid. J Opl Res Soc 46: 735-746.
11. Clausen J and Perregaard M (1995). Solving large quadratic problems in parallel. Technical Report, Department of Computer Science, University of Copenhagen, Copenhagen.
12. Burkard RE and Stratmann RE (1978). Numerical investigations of quadratic assignment problems. Naval Res Logist Q 25: 129-148.
13. Burkard RE, Karish SE and Rendl F (1994). QAPLIB-A quadratic assignment library report 287, CDLDO-41. Institut für Mathematik, Technische Universität Graz, Graz, Austria.
14. Kaufman L and Broeckx F (1978). An algorithm for quadratic assignment problem using Benders' decomposition. Eur J Opl Res 2: 63-75.
15. Carraresi P and Malucelli F (1992). A new lower bound for quadratic assignment problems. Opns Res 40: S22-S27.
16. Obata T (1979). Quadratic assignment problem: Evaluation of exact and heuristic algorithms. PhD dissertation, Renssellaer Polytechnic Institute, Troy, NY.
17. Love RF and Wong JY (1976). On solving a one-dimensional space allocation problem with integer programming. INFOR 14: 139-143.
18. Sarker BR, Wilhelm WE, Hogg GL and Han MH (1995). Backtracking of jobs and machine location problems. Eur J Opl Res 85: 593-609.
19. Carrie AS (1975). Layout of multi-product lines. Int J Prod Res 13: 451-467.
20. Vakharia AJ and Wemmerlöv U (1990). Designing a cellular manufacturing system: a material flow approach based operation sequences. IIE Trans 22: 84-97.
21. Nori VS and Sarker BR (1997). Reducing work-in-process movements of multiple products in one-dimensional layout problems. J Opl Res Soc 48: 412-422.
22. Gavett JW and Plyter NV (1966). The optimal assignment of facilities to locations by branch and bound. Opns Res 14: 210-232.
23. Nugent CE, Vollman T.E and Ruml J (1968). An experimental comparison of techniques for the assignment of facilities to locations. Opns Res 16: 150-173.
24. Cela E (1998). The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers: Amsterdam.
25. Wang S and Sarker BR (2002). Locating cells with bottleneck machines in cellular manufacturing systems. Int J Prod Res 40: 2002.
26. Hillier FS (1963). Quantitative tools for plant layout analysis. Journal of Industrial Eng 14: 33-40.
27. Hillier FS and Connors MM (1966). Quadratic assignment problem algorithms and the location of indivisible facilities. Mngt Sci 13, 42-57.
28. Armour GC and Vollman TE (1964). Allocating facilities with CRAFT. Harvard Business Rev 42: 136-158.
29. Murtagh BA, Jefferson TR and Sornprasit V (1982). A heuristic procedure for solving the quadratic assignment problem. Eur J Opl Res 9: 71-76.
30. Raoot AD and Rakshit A (1994). A 'fuzzy' heuristic for the quadratic assignment formulation of the facility layout problem. Int J Prod Res 32: 563-581.
31. Tate DM and Smith AE (1995). A genetic approach to the quadratic assignment problem. Comput Ops Res 22: 73-78
32. Wilhelm MR and Ward TL (1987). Solving quadratic assignment problems by simulated annealing. IIE Trans 19: 107-119.
33. Kaku BK, Thompson GL and Morton TE (1991). A hybrid heuristic for the facilities layout problem. Comput Ops Res 18: 241-253.
34. Bazaraa MS and Sherali HD (1980). Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res Logist Q 27: 29-41.
35. Sherali HD and Rajgopal P (1986). A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem. Comput Ops Res 13, 587-600.
36. Heragu SS and Kusiak A (1991). Efficient models for the facility layout problem. Eur J Opl Res 53, 1-13.