Skip to main content
SpringerLink
Log in

A taboo search approach for deadlock-free scheduling of automated manufacturing systems

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

Abstract

This paper addresses the scheduling problem of a class of automated manufacturing systems. A new manufacturing system model is proposed. In this model, a set of jobs is to be processed and each job requires a sequence of operations. Each operation may need more than one resource. Upon the completion of an operation, resources needed in the next operation of the same job cannot be released and the remaining resources cannot be released until the start of the next operation. The scheduling problem consists in sequencing the operations on the resources in order to avoid deadlocks and to minimize the makespan. The classical disjunctive graph representation is extended to model the scheduling problem. A taboo search algorithm is then proposed using an original neighborhood structure defined by two basic moves: the permutation of disjunctive arcs of critical paths and a deadlock recovery move if the former fails. Numerical results presented in the paper show the efficiency of the proposed 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

  • Akers, S. B. and Friedman J. (1955) A non-numerical approach to production scheduling problems. Operations Research, 3, 429-442.

    Google Scholar 

  • Banaszak, Z. A. and Krogh, B. H. (1990) Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows. IEEE Transactions on Robotics and Automation, 6, 724-734.

    Google Scholar 

  • Blazewicz, J. and Finke, G. (1994) Scheduling with resource management in manufacturing systems. European Journal of Operational Research, 76, 1-14.

    Google Scholar 

  • Blazewicz, J., Domschke, W. and Pesch, E. (1996) The job shop scheduling problem: Concentional and new solution techniques. European Journal of Operational Research, 93, 1-33.

    Google Scholar 

  • Brucker, P. (1988) An efficient algorithm for the job-shop problem with two jobs. Computing, 40, 353-359.

    Google Scholar 

  • Camus, H. (1997) Conduite de systèmes flexibles de production manufacturière par composition de régimes permanents cycliques: modélisation et évaluation de performances à l'aide des réseaux de Petri. Ph.D. Thesis, Ecole centrale de Lille, France.

    Google Scholar 

  • Chu, F. and Xie, X. L. (1997) Deadlock analysis of Petri nets using siphons and mathematical programming. IEEE Transactions on Robotics and Automation, 13, 793-804.

    Google Scholar 

  • Damasceno, B. C. and Xie, X. L. (1998) Scheduling and deadlock avoidance of a flexible manufacturing system. Proceedings of the IEEE Conference on Systems, Man and Cybernetic, pp. 564-569, San Diego, USA.

  • Damasceno, B. C. and Xie, X. L. (1999) Petri nets and deadlock-free scheduling of multiple-resource operations. Proceedings of the IEEE Conference on Systems, Man and Cybernetic, Tokyo, Japan.

  • Damasceno, B. C. (1999) Ordonnancement des systèmes de production multi-ressources avec la prise en compte de blocage, Ph.D. Thesis, Université de Metz, France.

    Google Scholar 

  • Ezpeleta, J., Colom, J. M. and Martinez, J. (1995) A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Transactions on Robotics and Automation, 11, 173-184.

    Google Scholar 

  • Fanti, M. P., Maione, B., Mascolo, S. and Turchiano, B. (1997) Event-based feedback control for deadlock avoidance in flexible production systems. IEEE Transactions on Robotics and Automation, 13, 347-363.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Glover, F. (1995) Tabu search fundamentals and uses. Revised and Expanded, Technical Report, Graduate School of Business, University of Colorado, Bolder, CO.

    Google Scholar 

  • GOTHA (1993). Les problèmes d'ordonnancement. Recherche Opérationnelle/Operations Research, 27, 77-150.

    Google Scholar 

  • Hall, N. G. and Sriskandarajah, C. (1996) A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510-525.

    Google Scholar 

  • Hillion, H., Proth, J. M. and Xie, X. L. (1987) A heuristic algorithm for the periodic scheduling and sequencing job-shop problem. Proceedings of the IEEE Conference on Decision and Control, Los-Angeles.

  • Jain, A. S. (1998) A multi-level hybrid framework for the deterministic job-shop scheduling problem. Ph.D. Thesis, University of Dundee, Scotland.

    Google Scholar 

  • Jeng, M. D., Chen, S. C. and Lin, C. S. (1996) A search approach based on the Petri nets theory for FMS scheduling. Proceedings of the 13th IFAC World Congress, San Francisco, vol. B, 55-60.

    Google Scholar 

  • Lee, D. Y. and DiCesare, F. (1994) Scheduling flexible manufacturing systems using Petri nets and heuristic search, IEEE Transactions on Robotics and Automation, 10, 123-132.

    Google Scholar 

  • Mati, Y., Rezg, N. and Xie, X. L. (2000a) A shortest path approach for deadlock-free scheduling of automated manufacturing systems. Proceedings of MCPL'2000, Grenoble, France, July 2000.

  • Mati, Y., Rezg, N. and Xie X. L. (2000b) Geometric approach and taboo search for scheduling flexible manufacturing systems. Submitted to IEEE Transactions on Robotics and Automation. Also available as a Research Report INRIA, France, 2000.

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

    Google Scholar 

  • Osman, I. H. and Laporte G. (1996) Metaheuristics: a bibliography. Annals of Operations Research, 63, 513-623.

    Google Scholar 

  • Proth, J. M. and Xie, X. L. (1996) Petri Nets: A Tool for Design and Management of Manufacturing Systems, John Wiley & Sons.

  • Ramaswamy, S. E. and Joshi, S. B. (1996) Deadlock-free schedules for automated manufacturing workstations. IEEE Transactions on Robotics and Automation, 12, 391-400.

    Google Scholar 

  • Sethi, S. P., Sriskandarajah, C., Sorger, G., Blazewicz, J. and Kubiak, W. (1992) Sequencing of Parts and Robot Moves in a Robotic Cell. International Journal of Flexible Manufacturing Systems, 4, 331-358.

    Google Scholar 

  • Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K. (1992) Job Shop Scheduling by Simulated Annealing. Operations Research, 40(1), 113-125.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA/MACSI Team and LGIPM ENIM - Ile du Saulcy, 57045, Metz, France

    Yazid Mati, Nidhal Rezg & Xiaolan Xie

Authors
  1. Yazid Mati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nidhal Rezg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaolan Xie
    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

Mati, Y., Rezg, N. & Xie, X. A taboo search approach for deadlock-free scheduling of automated manufacturing systems. Journal of Intelligent Manufacturing 12, 535–552 (2001). https://doi.org/10.1023/A:1012260622596

Download citation

  • Issue Date:

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

Search

Navigation