Skip to main content
SpringerLink
Log in

An analysis of heuristics for the parallel-machine flexible-resource scheduling problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider the parallel-machine flexible-resource scheduling (PMFRS) problem in which a set of jobs must be scheduled over a set of parallel machines, where the processing time of each job is a function of the amount of allocated resource. Resource flexibility provides the capability to dynamically reassign a renewable resource across machines to break processing bottlenecks and improve system performance as measured by schedule makespan. The PMFRS problem has many important applications, including production scheduling of manufacturing cells where a cross-trained work force can be dynamically reallocated among cells. The problem is also NP-hard, motivating the development of effective heuristics that approximately determine the allocation of resource to jobs, the sequence of jobs on each machine, and the associated job start times that minimize system makespan. This paper explores heuristics for the PMFRS problem, and in particular the application of tabu-search methodology to this problem setting. We review an existing heuristic (SBH), define two tabu-search heuristics, and discuss extensive computational experience with the procedures. The computational results indicate that the heuristics are effective in obtaining approximate solutions to the PMFRS problem. In particular, the approach that uses tabu-search methodology in tandem with SBH consistently yields high-quality solutions with modest computational effort.

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. I. Adiri and Z. Yehudai, Scheduling on machines with variable service rates, Computers and Operations Research 14(1987)289–297.

    Article  Google Scholar 

  2. R. Ahmadi and U. Bagchi, Scheduling multi-job customer orders in multi-machine environments, Working Paper, University of California, Los Angeles, 1992.

    Google Scholar 

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

    Article  Google Scholar 

  4. J.W. Barnes and M. Laguna, Solving the multiple-machine weighted flow time problem using tabu search, IIE Transactions 25(1993)121–128.

    Google Scholar 

  5. J. Blazewicz, J.K. Lenstra and A.H.G. Rinooy Kan, Scheduling subject to resource constraints: Classification and complexity, Discrete Applied Mathematics 5(1983)11–24.

    Article  Google Scholar 

  6. T.C.E. Cheng and C.C.S. Sin, A state-of-the-art review of parallel-machine scheduling research, European Journal of Operational Research 47(1990)271–292.

    Article  Google Scholar 

  7. R.L. Daniels, Resource allocation and multi-project scheduling, in: Advances in Project Scheduling, R. Slowinski and J. Weglarz, eds., Elsevier, Amsterdam, 1989.

    Google Scholar 

  8. R.L. Daniels, B.J. Hoopes and J.B. Mazzola, Scheduling parallel manufacturing cells with resource flexibility, Management Science 42(1996)1260–1276.

    Google Scholar 

  9. R.L. Daniels and J.B. Mazzola, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Annals of Operations Research 41(1993)207–230.

    Article  Google Scholar 

  10. R.L. Daniels and J.B. Mazzola, Flow shop scheduling with resource flexibility, Operations Research 42(1994)504–522.

    Google Scholar 

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

    Google Scholar 

  12. G. Dobson and U.S. Karmarkar, Simultaneous resource scheduling to minimize weighted flow times, Operations Research 37(1989)592–600.

    Google Scholar 

  13. G.S. Fishman and L.R. Moore, An exhaustive analysis of multiplicative congruential random number generators with modulus 231 − 1, SIAM Journal on Scientific and Statistical Computation, 7(1986)24–45.

    Article  Google Scholar 

  14. M.R. Garey and D.S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal of Computing 4(1975)397–411.

    Article  Google Scholar 

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

    Google Scholar 

  16. F. Glover, Tabu Search — Part II, ORSA Journal on Computing 2(1990)4–32.

    Google Scholar 

  17. F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Annals of Operations Research 41(1993)3–28.

    Article  Google Scholar 

  18. A.M.A. Hariri and C.N. Potts, Heuristics for scheduling unrelated parallel machines, Computers and Operations Research 18(1991)323–331.

    Article  Google Scholar 

  19. S.R. Lawrence and T.E. Morton, Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics, European Journal of Operational Research 64(1993)168–187.

    Article  Google Scholar 

  20. S.S. Panwalker and R. Rajagopalan, Single-machine sequencing with controllable processing times, European Journal of Operational Research 59(1992)298–302.

    Article  Google Scholar 

  21. J. Skorin-Kapov and A.J. Vakharia, Scheduling a flow-line manufacturing cell: A tabu search approach, International Journal of Production Research 31(1993)1721–1734.

    Google Scholar 

  22. R. Slowinski and J. Weglarz, Solving the general project scheduling problem with multiple constrained resources by mathematical programming, Lecture Notes in Control and Information Systems 7(1978)278–289.

  23. E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research 47(1990)65–74.

    Article  Google Scholar 

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

    Article  Google Scholar 

  25. F.B. Talbot, Resource-constrained project scheduling with time-resource tradeoffs: The nonpre-emptive case, Management Science 28(1982)1197–1210.

    Google Scholar 

  26. M.A. Trick, Scheduling multiple variable-speed machines, Operations Research 42(1994)234–248.

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

Download references

Authors
  1. Richard L. Daniels
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barbara J. Hoopes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joseph B. Mazzola
    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

Daniels, R.L., Hoopes, B.J. & Mazzola, J.B. An analysis of heuristics for the parallel-machine flexible-resource scheduling problem. Annals of Operations Research 70, 439–472 (1997). https://doi.org/10.1023/A:1018946810121

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018946810121

Keywords

Search

Navigation