Cyclic job shop scheduling problems with blocking | Annals of Operations Research Skip to main content
Springer Nature Link
Log in

Cyclic job shop scheduling problems with blocking

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

Abstract

A tabu search algorithm for a cyclic job shop problem with blocking is presented. Operations are blocking if they must stay on a machine after finishing when the next machine is occupied by another job. During this stay the machine is blocked for other jobs. For this problem traditional tabu search moves often lead to infeasible solutions. Recovering procedures are developed which construct nearby feasible solutions. Computational results are presented for the approach.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Beasley, J. E. (2005). Benchmark problems. http://people.brunel.ac.uk/~mastjjb/jeb/info.html.

  • Brucker, P. (2004). Scheduling algorithms (4th edn.) Berlin: Springer.

    Google Scholar 

  • Brucker, P., & Kampmeyer, T. (2005). Tabu search algorithms for cyclic machine scheduling problems. Journal of Scheduling, 8, 303–322.

    Article  Google Scholar 

  • Brucker, P., & Kampmeyer, T. (2007, to appear). A general model for cyclic machine scheduling problems. Discrete Applied Mathematics.

  • Carlier, J., & Chrétienne, P. (1988). Les Problèmes d’ordonnancement. Paris: Masson.

    Google Scholar 

  • Dasdan, A., Irani, S. S., & Gupta, R. K. (1999). Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In Proceedings of the 36th ACM/IEEE conference on design automation conference (pp. 37–42). Annual ACM IEEE design automation conference, NY, USA. New York: ACM.

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Hanen, C. (1994). Study of a NP-hard cyclic scheduling problem: the recurrent job-shop. European Journal of Operations Research, 72, 82–101.

    Article  Google Scholar 

  • Kampmeyer, T. (2006). Cyclic scheduling problems. Ph.D. thesis, University of Osnabrück.

  • Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operations Research, 143, 498–517.

    Article  Google Scholar 

  • McCormick, S. T., Pinedo, M., Shenker, S., et al. (1989). Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37(6), 925–935.

    Article  Google Scholar 

  • Nieberg, T. (2002). Tabusuche für Flow-Shop und Job-Shop Probleme mit begrenztem Zwischenspeicher. Master’s thesis, University of Osnabrück.

  • Song, J. S., & Lee, T. E. (1998). Petri net modeling and scheduling for cyclic job shops with problems. Computers Industrial Engineering, 34(2), 281–295.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Mathematik/Informatik, Universität Osnabrück, 49069, Osnabrück, Germany

    Peter Brucker

  2. Bayer Technology Services GmbH, Bldg. B610, 51368, Leverkusen, Germany

    Thomas Kampmeyer

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Kampmeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Kampmeyer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Kampmeyer, T. Cyclic job shop scheduling problems with blocking. Ann Oper Res 159, 161–181 (2008). https://doi.org/10.1007/s10479-007-0276-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0276-z

Keywords

Search

Navigation