Skip to main content
SpringerLink
Log in

A tabu-search heuristic for the flexible-resource flow shop scheduling problem

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

Abstract

This paper presents a tabu-search heuristic for the flexible-resource flow shop scheduling (FRFS) problem [7]. The FRFS problem generalizes the classic flow shop scheduling problem by allowing job-operation processing times to depend on the amount of resource assigned to an operation; the objective is to determine simultaneously the job sequence, resource-allocation policy, and operation start times that optimize system performance. The tabu-search heuristic (TSH) employs a nested-search strategy based on a decomposition of the FRFS problem into these three components. We discuss computational experience with the THS procedure on more than 1600 test problems. The results show that TSH is effective in obtaining near-optimal solutions to the FRFS test problems. In particular, TSH generates optimal solutions for more than 70% of the test problems for which optimal solutions are known; overall, these solutions are within 0.3% of optimality on the average, and within 2.5% of optimality in the worst case.

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. K.R. Baker,Introduction to Sequencing and Scheduling (Wiley, New York, 1974).

    Google Scholar 

  2. K.R. Baker, A comparative study of flow shop algorithms, Oper. Res. 23(1975)62–73.

    Google Scholar 

  3. J.W. Barnes and M. Laguna, Solving the multiple-machine weighted flow time problem using tabu search, IIE Trans., forthcoming.

  4. J.W. Barnes and M. Laguna, A tabu search experience in production scheduling, Working Paper, University of Colorado (1992).

  5. R.W. Conway, W.L. Maxwell and L.W. Miller,Theory of Scheduling (Addison-Wesley, Reading, MA, 1967).

    Google Scholar 

  6. R.L. Daniels, A multi-objective approach to resource allocation in single machine scheduling, Euro. J. Oper. Res. 48(1990)226–241.

    Article  Google Scholar 

  7. R.L. Daniels and J.B. Mazzola, Flow shop scheduling with flexible resources, Working Paper, Fuqua School of Business, Duke University (1991).

  8. R.L. Daniels and R.K. Sarin, Single machine scheduling with controllable processing times and number of jobs tardy, Oper. Res. 37(1989)981–984.

    Google Scholar 

  9. D.G. Dannenbring, An evaluation of flow shop sequencing heuristics, Manag. Sci. 23(1977)1174–1182.

    Google Scholar 

  10. M. Dell'Amico and M. Trubian, Applying tabu-search to the job-shop scheduling problem, Working Paper, Politecnico de Milano, Italy (1991).

    Google Scholar 

  11. A.M. Frieze and J. Yadegar, A new integer programming formulation for the permutation flowshop problem, Euro. J. Oper. Res. 40(1989)90–98.

    Article  MathSciNet  Google Scholar 

  12. M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Math. Oper. Res. 1(1976)117–129.

    Google Scholar 

  13. F. Glover, Tabu search — Part I, ORSA J. Comput. 1(1989)190–206.

    Google Scholar 

  14. F. Glover, Tabu search — Part II, ORSA J. Comput. 2(1990)4–32.

    Google Scholar 

  15. F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Working Paper, University of Colorado (1991).

  16. S.R. Lawrence and T.E. Morton, Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics, Euro. J. Oper. Res. 64(1993)168–187.

    Article  Google Scholar 

  17. J.K. Lenstra,Sequencing by Enumerative Methods (Mathematisch Centrum, Amsterdam, 1979).

    Google Scholar 

  18. M. Nawaz, E.E. Enscore and I. Ham, A heuristic algorithm for them-machine,n-job flow shop sequencing problem, OMEGA 11(1983)91–95.

    Article  Google Scholar 

  19. I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Ann. Oper. Res. (1993), this volume.

  20. J. Skorin-Kapov and A.J. Vakharia, Scheduling a flow-line manufacturing cell: A tabu search approach, Working Paper, SUNY Stony Brook (1992).

  21. R. Slowinski, Multiobjective network scheduling with efficient use of renewable and non-renewable resources, Euro. J. Oper. Res. 7(1981)265–273.

    Article  Google Scholar 

  22. E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, Euro. J. Oper. Res. 47(1990)65–74.

    Article  MathSciNet  Google Scholar 

  23. F.B. Talbot, Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case, Manag, Sci. 28(1982)1197–1210.

    Google Scholar 

  24. L.N. Van Wassenhove and K.R. Baker, A bicriterion approach to time cost trade-offs in sequencing, Euro. J. Oper. Res. 11(1982)48–54.

    Google Scholar 

  25. R.G. Vickson, Two single-machine sequencing problems involving controllable job processing times, AIEE Trans. 12(1980)258–262.

    Google Scholar 

  26. R.G. Vickson, Choosing the job sequence and processing times to minimize processing plus flow cost on a single machine, Oper. Res. 28(1980)1155–1167.

    Article  Google Scholar 

  27. J. Weglarz, J. Blasewicz, J. Cellary and R. Slowinski, An automatic revised simplex method for constrained resource network scheduling, ACM Trans. Math. Software 3(1977)295–300.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fuqua School of Business, Duke University, 27706, Durham, NC, USA

    Richard L. Daniels & Joseph B. Mazzola

Authors
  1. Richard L. Daniels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph B. Mazzola
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by National Science Foundation grant SES90-22940.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daniels, R.L., Mazzola, J.B. A tabu-search heuristic for the flexible-resource flow shop scheduling problem. Ann Oper Res 41, 207–230 (1993). https://doi.org/10.1007/BF02023075

Download citation

  • Issue Date:

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

Keywords

Search

Navigation