×

Backtracking of jobs in one-dimensional machine location problems. (English) Zbl 0912.90181

Summary: Materials that must be transported upstream in a production line along a linear track are said to backtrack. In this line, management attempts to simplify the workflow of jobs by assigning machines to appropriate locations along the line to minimize backtracking. The problem of assigning \(M\) machines to \(M\) locations along a linear track to minimize the total backtracking of jobs forms a quadratic assignment problem and is a difficult task; an optimum solution to such a problem with large \(M\) is computationally intractable. Therefore, an efficient, depth-first insertion heuristic is used here to improve the solution obtained by a construction heuristic, called multi-pass heuristic. A lower bound to assess the quality, and a measure of backtracking to assess the proximity of a configuration to a generalized flow line are developed in this paper. In addition to computational results, a simulation model is also used to assess the effect of reducing backtracking on overall system performance in a dynamic environment.

MSC:

90B35 Deterministic scheduling theory in operations research
Full Text: DOI

References:

[1] Bazaraa, M. S.; Kirca, O., A branch-and-bound-based heuristic for solving the Quadratic Assignment Problem, Naval Research Logistics Quarterly, 30, 287-304 (1983) · Zbl 0575.90041
[2] Bozer, Y. A.; Srinivasan, M. M., Tandem configurations for AGV systems offer simplicity and flexibility, Industrial Engineering, 21, 2, 23-27 (1989)
[3] Burkard, R. E.; Stratmann, K. H., Numerical investigations of Quadratic Assignment Problems, Naval Research Logistics Quarterly, 25, 129-148 (1978) · Zbl 0391.90066
[4] Conway, R. W.; Maxwell, W. L.; Miller, L. W., Theory of Scheduling (1967), Addison-Wesley, Chapter 5 · Zbl 1058.90500
[5] Drezner, Z., DISCON: A new method for the layout problem, Operations Research, 28, 1375-1384 (1980) · Zbl 0447.90025
[6] Gavett, J. W.; Plyter, N. V., The optimal assignment of facilities to locations by branch and bound, Operations Research, 14, 210-232 (1966)
[7] Glover, F., Improved linear integer programming formulations of nonlinear integer problems, Management Science, 22, 455-460 (1975) · Zbl 0318.90044
[8] Heragu, S. S.; Kusiak, A., Machine layout problem in Flexible Manufacturing Systems, Operations Research, 36, 2, 258-268 (1988)
[9] Houshyar, A.; McGinnis, L. F., A heuristic for assigning facilities to locations to minimize WIP travel distance in a linear facility, International Journal of Production Research, 28, 8, 1485-1498 (1990)
[10] Khare, V. K.; Khare, M. K.; Neema, M. L., Estimation of distribution parameters associated with facilities design problems involving forward and backtracking of materials, Computers & Industrial Engineering, 14, 63-75 (1988)
[11] Luggen, W. W., Flexible Manufacturing Cells and Systems (1991), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ
[12] Muller, T., Automated Guided Vehicles (1993), IFS Publications Ltd: IFS Publications Ltd Kempston, Bedford, UK
[13] Murtagh, B. A.; Jefferson, T. R.; Sornprasit, V., Heuristic procedure for solving the Quadratic Assignment Problem, European Journal of Operational Research, 9, 71-76 (1982) · Zbl 0471.90074
[14] Obata, T., Quadratic Assignment Problem: Evaluation of exact and heuristic algorithms (1979), Rensselaer Polytechnic Institute: Rensselaer Polytechnic Institute Troy, NY, Unpublished Ph.D. Dissertation
[15] Pardalos, P. M.; Murthy, K. A.; Li, Y., Computational experience with parallel algorithms for solving the Quadratic Assignment Problem, (Balci, O.; etal., Computer Science and Operations Research: New Developments in their Interface (1992), Pergamon: Pergamon Oxford), 267-278
[16] Picard, J. C.; Queyranne, M., On the one-dimensional space allocation problem, Operations Research, 29, 2, 371-391 (1981) · Zbl 0473.90057
[17] Picone, C. J.; Wilhelm, W. E., A perturbation scheme to improve Hillier’s solution to the facilities location problem, Management Science, 30, 1238-1249 (1984) · Zbl 0555.90038
[18] Saboo, S.; Wang, L.; Wilhelm, W. E., Recursion models for describing and managing the transient flow of materials in generalized flow lines, Management Science, 35, 722-742 (1989) · Zbl 0672.90066
[19] Sarker, B. R., University of Microfilm International, #DA90-15575, 51, 1 (July 1990)
[20] Sarker, B. R.; Wilhelm, W. E.; Hogg, G. L.; Han, M. H., Backtracking of jobs and machine location problems, (White, J. A.; Pence, I. W., Progress in Material Handling and Logistics, Vol. 2 (1991), Springer-Verlag: Springer-Verlag Berlin), 117-141
[21] Sarker, B. R.; Wilhelm, W. E.; Hogg, G. L., Measures of backtracking and bidirectional flow in one-dimensional machine location problems, Production Planning and Control, 5, 3, 282-291 (1994)
[22] Sarker, B. R.; Wilhelm, W. E.; Hogg, G. L., Backtracking and its amoebic properties in one-dimensional machine location problems, Journal of the Operational Research Society, 45, 8 (1994) · Zbl 0815.90107
[23] Skorin-Kapov, J., Tabu Search applied to the quadratic assignment problem, ORSA Journal on Computing, 2, 1, 33-45 (1990) · Zbl 0752.90054
[24] Sherali, H. D.; Rajagopal, P., A flexible polynomial-time, construction and improvement heuristic for the Quadratic Assignment Problem, Computers & Operations Research, 13, 587-600 (1986) · Zbl 0615.90040
[25] Taillard, E., Robust Tabu Search for the quadratic assignment problem, Parallel Computing, 17, 443-455 (1991)
[26] Vakharia, A. J.; Wemmerlöv, U., Designing a cellular manufacturing system: A material flow approach based on operations sequences, IIE Transactions, 22, 1, 84-97 (1990)
[27] Wilhelm, M. R.; Ward, T. L., Solving Quadratic Assignment Problems by simulated annealing, IIE Transactions, 9, 1, 107-119 (1987)
[28] Wong, C. K., Algorithmic Studies in Mass Storage Systems (1983), Computer Science Press: Computer Science Press Rockville, MD · Zbl 0537.68101
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.