Skip to main content
SpringerLink
Log in

The strategies and parameters of tabu search for job-shop scheduling

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem is NP-hard, satisfactory solutions have been obtained recently by tabu search. However, tabu search has a problem-specific and parametric structure. Therefore, in the paper, we focussed on the tabu search strategies and parameters such as initial solution, neighborhood structure, tabu list, aspiration criterion, elite solutions list, intensification, diversification and the number of iteration. In order to compare some neighborhood strategies and tabu list length methods, a computational study is done on the benchmark problems.

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

  • Aarts, E. H. L., Laarhoven, P. J. M., van Lenstra, J. K. and Ulder, N. L. J. (1994) A computational study local search algorithms for job-shop scheduling. ORSA Journal on Computing, 6(2), 118–125.

    Google Scholar 

  • Adams, J., Balas, E. and Zawack, D. (1988) The shifting bottleneck procedure for the job shop scheduling. Management Science, 34, 391–401.

    Google Scholar 

  • Alfano, M., Genco, A., Lopes, S. and Prestigiacomo, A. (1994) Scheduling simulation on a parallel virtual machine. Proceedings of the European Simulation Symposium.

  • Applegate, D. and Cook, W. (1991) A computational study of the job-shop scheduling instance. ORSA Journal on Computing, 3, 149–156.

    Google Scholar 

  • Baker, K. R. (1994) Elements of Sequencing and Scheduling, Dartmouth College, Hanover.

    Google Scholar 

  • Balas, E. (1969) Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operation Research, 17, 941–957.

    Google Scholar 

  • Balas, E. and Vazacopoulos, A. (1998) Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44, 262–275.

    Google Scholar 

  • Barnes, J. W. and Chambers, J. B. (1995) Technical note solving the job shop scheduling problem with tabu search. IIE Transactions, 27, 257–263.

    Google Scholar 

  • Barnes, J. W. and Laguna, M. (1993) A tabu search experience in production scheduling. Annals of Operations Research, 41, 141–156.

    Google Scholar 

  • Baykasoglu, A. (2002) Linguistic based meta-heuristic optimisation model for flexible job shop scheduling. International Journal of Production Research (Accepted with revisions).

  • Brucker, P., Jurisch, B. and Sievers, B. (1994) A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49, 107–127.

    Google Scholar 

  • Brucker, P. (1995) Scheduling Algorithms, Springer-Verlag, Berlin.

    Google Scholar 

  • Carlier, J. and Pinson, E. (1989) An algorithm for solving the job shop problem. Management Science, 35, 164–176.

    Google Scholar 

  • Cedimoglu, I. H. (1993) Neural networks in shop floor scheduling, Ph.D. Thesis, Crantfield Institute of Technology.

  • Dauzere-Peres, S. and Lasserre, J. B. (1993) A modified shifting bottleneck procedure for job shop scheduling. International Journal of Production Research, 31, 923–932.

    Google Scholar 

  • Dell'Amico, M. and Trubian, M. (1993) Applying tabu search to the job shop scheduling problem. Annals of Operations Research, 41, 231–252.

    Google Scholar 

  • Dorndorf, U. and Pesch, E. (1995) Evolution based learning in a job shop scheduling environment. Computers and Operations Research, 22, 25–40.

    Google Scholar 

  • Fisher, H. and Thompson, G. L. (1963) Probabilistic learning combinations of local job-shop scheduling rules, in Industrial Scheduling, Muth, J. F. and Thompson, G. L. (eds.), Prentice Hall, Englewood Cliffs, New Jersey, 225–251.

    Google Scholar 

  • Foo, Y.-P. S. and Takefuji, Y. (1988b) Stochastic neural networks for solving job-shop scheduling: Part 2 architecture and simulations. Proceedings of the IEEE International Conference on Neural Network, July.

  • Fox, M. S. and Smith, S. F. (1984) ISIS: a knowledge-based system for factory scheduling. Expert Systems, 1(1), 25–49.

    Google Scholar 

  • Geyik, F. and Cedimoglu, I. H. (1999) A review of the production scheduling approaches based-on artificial intelligence and the integration of process planning and scheduling, in Proceedings of Swiss Conference of CAD/CAM'99, Belhi, A. et al. (eds.), Neuchatel University, Switzerland, 22–24 February.

    Google Scholar 

  • Geyik, F. (2000) The expert-tabu search model for job-shop scheduling, Ph.D. Thesis, Sakarya University.

  • Giffler, B. and Thompson, G. (1960) Algorithms for solving production scheduling problems. Operations Research, 8(4), 487–503.

    Google Scholar 

  • Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Academic, Norwell, MA.

    Google Scholar 

  • Glover, F. (1986) Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13(5), 533–549.

    Google Scholar 

  • Glover, F. (1989) Tabu search Part I. ORSA Journal on Computing, 1(3), 190–206.

    Google Scholar 

  • Glover, F. (1990) Tabu search Part II. ORSA Journal on Computing, 2(1), 4–32.

    Google Scholar 

  • Jain, A. S., Rangaswamy, B. and Meeran, S. (2000) New and stronger job-shop neighborhoods: a focus on the method of Nowicki and Smutnicki (1996). Journal of Heuristics, 6, 457–480.

    Google Scholar 

  • Laarhoven, P. J. M., van Aarts, E. H. L. and Lenstra, J. K. (1992) Job shop scheduling by simulated annealing. Operational Research, 40(1), 113–125.

    Google Scholar 

  • Laguna, M. and Glover, F. (1996) What is tabu search? Colorado Business Review, XI(5).

  • Lawrence, S. (1984) Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania.

    Google Scholar 

  • Matsuo, H., Suh, C. J. and Sullivan, R. S. (1988) A controlled search simulated annealing method for the general job-shop scheduling problem. Working Paper, No. 03–04–88, Graduate School of Business, The University of Texas at Austin, Austin, Texas, USA.

    Google Scholar 

  • Nowicki, E. and Smutnicki, C. (1996) A fast taboo search algorithm for the job shop problem. Management Science, 42, 797–813.

    Google Scholar 

  • Panwalker, S. S. and Iskander, W. (1977) A survey of scheduling rules. Operations Research, 25(1), 45–61.

    Google Scholar 

  • Pinedo, M. (1995) Scheduling: Theory, Algorithms and Systems, Prentice-Hall, N.J.

    Google Scholar 

  • Saad, S. M., Baykasoglu, A. and Gindy, N. (2002) A new integrated system for loading and scheduling in cellular manufacturing. International Journal of Computer Integrated Manufacturing, 15(1), 37–49.

    Google Scholar 

  • Smith, S. F. (1995) Reactive scheduling systems, in Intelligent Scheduling Systems, Brown, D. E. and Scherer, W. T. (eds.), Kluver Academic, Boston, 155–192.

    Google Scholar 

  • Sonmez, A. I. and Baykasoglu, A. (1998) A new dynamic programming formulation of (n * m) flow shop sequencing problems with due dates. International Journal of Production Research, 36, 2269–2283.

    Google Scholar 

  • Storer, R. H., Wu, S. D. and Vaccari, R. (1992) New search spaces for sequencing instances with application to job shop schedulin. Management Science, 38, 1495–1509.

    Google Scholar 

  • Tailard, E. (1993) Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278–285.

    Google Scholar 

  • Taillard, E. (1994) Parallel taboo search techniques for the job shop scheduling. ORSA Journal on Computing, 16(2), 108–117.

    Google Scholar 

  • Vaessens, R. J. M., Aarts, E. H. L. and Lenstra, J. K. (1996) Job shop scheduling by local search. INFORMS Journal on Computing, 8, 302–317.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, University of Gaziantep, 27310, Gaziantep, Turkey

    Faruk Geyik

  2. Industrial Engineering Department, Sakarya University, 54040, Esentepe—Adapazari, Turkey

    Ismail Hakki Cedimoglu

Authors
  1. Faruk Geyik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ismail Hakki Cedimoglu
    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

Geyik, F., Cedimoglu, I.H. The strategies and parameters of tabu search for job-shop scheduling. Journal of Intelligent Manufacturing 15, 439–448 (2004). https://doi.org/10.1023/B:JIMS.0000034106.86434.46

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JIMS.0000034106.86434.46

Search

Navigation