Skip to main content
SpringerLink
Log in

Part type selection problem in flexible manufacturing systems: tabu search algorithms

  • Applications In Production And Scheduling
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Production planning in flexible manufacturing systems is concerned with the organization of production in order to satisfy a given master production schedule. The planning problem typically gives rise to several hierarchical subproblems which are then solved sequentially or simultaneously. In this paper, we address one of the subproblems: the part type selection problem. The problem is to determine a subset of part types having production requirements for immediate and simultaneous processing over the upcoming period of the planning horizon, subject to the tool magazine and processing time limitation. Several versions of tabu search (TS) algorithm are proposed for solving the problem. A systematic computational test is conducted to test the performance of the TS algorithms. The best TS algorithm developed is compared to a simulated annealing algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.W. Barnes and M. Laguna, A tabu search experience in production scheduling, Ann. Oper. Res. (1993), this volume.

  2. W.-H. Chen and B. Srivastava, A simulated annealing algorithm for production planning in flexible manufacturing systems, Working paper, Department of Management and Systems, Washington State University (June 1991).

  3. I.J. Chen and C.H. Chung, Effects of loading and routing decisions on performance of flexible manufacturing systems, Int. J. Prod. Res. 29(1991)2209–2225.

    Google Scholar 

  4. R.W. Conway, Priority dispatching and job lateness in a job shop, J. Ind. Eng. 16(1965)228–237.

    Google Scholar 

  5. B. Gavish and H. Pirkul, Efficient algorithm for solving multiconstraint zero-one knapsack problems to optimality, Math. Prog. 31(1985)78–105.

    Google Scholar 

  6. F. Glover, Tabu search, Part I, ORSA J. Comp. 1(1989)190–206.

    Google Scholar 

  7. F. Glover, Tabu search, Part II, ORSA J. Comp. 2(1990)4–32.

    Google Scholar 

  8. F. Glover, Developments and speculations, Memorandum, Graduate School of Business Administration, University of Colorado at Boulder (September 24, 1991).

  9. F. Glover and R. Hubscher, Bin packing with tabu search, Technical Report, Graduate School of Business Administration, University of Colorado at Boulder (1991).

  10. M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristics for vehicle routing problem, Centre de Recherche sur les Transports, Université de Montréal (1991).

  11. A. Hertz, Tabu search for large scale timetabling problems, Euro. J. Oper. Res. 54(1991)39–47.

    Article  Google Scholar 

  12. A. Hertz and D. de Werra, Using tabu search techniques for graph coloring, Comput. 39(1987)345–351.

    Google Scholar 

  13. S. Hwang and A. Shogan, Modelling and solving an FMS part selection problem, Int. J. Prod. Res. 27(1989)1349–1366.

    Google Scholar 

  14. S. Hwang, A constraint directed method to solve the part selection problem in flexible manufacturing systems planning stage,Proc. 2nd ORSA/TIMS Conf. on FMS: Operations Research Models and Applications (1986) pp. 297–309.

  15. S.B. Khade and J.P. Ignizio, A Lagrangian relaxation based algorithm for production planning in flexible manufacturing systems,Proc. Annual Meeting of Decision Sciences Institute (1990) pp. 1805–1807.

  16. A. Kusiak, Loading models in flexible manufacturing systems, in:Recent Developments in Flexible Manufacturing Systems and Allied Areas (North-Holland, Amsterdam, 1984) pp. 119–132.

    Google Scholar 

  17. P.J.M. Van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications (Reidel, Dordrecht, 1987).

    Google Scholar 

  18. M. Laguna, J.W. Barnes and F. Glover, Scheduling jobs with linear delay penalties and sequence dependent setup costs and times using tabu search, Appl. Int. (1992).

  19. M. Laguna and F. Glover, Integrating target analysis and tabu search for improved scheduling systems, Expert Syst. Appl. (1992).

  20. M. Malek, M. Guruswamy, M. Pandya and H. Owens, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Ann. Oper. Res. 21(1989)59–84.

    Article  Google Scholar 

  21. S. Rajagopalan, Formulation and heuristic solutions for parts grouping and tool loading in flexible manufacturing systems,Proc. 2nd ORSA/TIMS Conf. on FMS: Operations Research Models and Applications (1986) pp. 311–320.

  22. T. Sawik, Modelling and scheduling of a flexible manufacturing system, Euro. J. Oper. Res. 45(1990)177–190.

    Article  Google Scholar 

  23. K. Shanker and Y.J. Tzen, A loading and dispatching problem in a random flexible manufacturing system, Int. J. Prod. Res. 23(1985)579–595.

    Google Scholar 

  24. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2(1989)33–45.

    Google Scholar 

  25. J. Skorin-Kapov, Extensions of a tabu search adaptation to the quadratic assignment problem, Harriman School Working Paper HAR-90-006, State University of New York at Stony Brook (1991).

  26. P. Solot, A concept for planning and scheduling in an FMS, Euro. J. Oper. Res. 45(1990)85–95.

    Article  Google Scholar 

  27. K.E. Stecke, Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems, Manag. Sci. 29(1983)273–288.

    Google Scholar 

  28. K.E. Stecke and I. Kim, A flexible approach to part type selection in flexible flow systems using part mix ratios, Int. J. Prod. Res. 29(1991)53–75.

    Google Scholar 

  29. E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Comput. 17(1991)443–455.

    Article  Google Scholar 

  30. C.S. Tang and E.V. Denardo, Models arising from flexible manufacturing machine, Part I: Minimization of the number of tool switchings, Oper. Res. 36(1988)767–777.

    Google Scholar 

  31. C.S. Tang and E.V. Denardo, Models arising from flexible manufacturing machine, Part II: Minimization of the number of switching instants, Oper. Res. 36(1988)778–784.

    Article  Google Scholar 

  32. A.J. Van Looveren, L.F. Gelders and L.N. Van Wassenhove, A review of FMS planning models, in:Modelling and Design of Flexible Manufacturing Systems (Elsevier, 1986) pp. 3–31.

  33. C.K. Whitney and T.S. Gaul, Sequential decision procedures for batching and balancing in FMSs,Proc. 1st ORSA/TIMS Conf. on FMS: Operations Research Models and Applications (1984) pp. 243–248.

  34. M. Widmer, Job shop scheduling with tooling constraints: A tabu search approach, J. Oper. Res. Soc. 24(1991)75–82.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management, Morquette University, 53233, Milwaukee, WI, USA

    Bharatendu Srivastava

  2. Department of Management and Systems, Washington State University, 99164-4726, Pullman, WA, USA

    Wun-Hwa Chen

Authors
  1. Bharatendu Srivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wun-Hwa Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Srivastava, B., Chen, WH. Part type selection problem in flexible manufacturing systems: tabu search algorithms. Ann Oper Res 41, 279–297 (1993). https://doi.org/10.1007/BF02023078

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02023078

Keywords

Search

Navigation