Geometric approach and taboo search for scheduling flexible manufacturing systems

This paper addresses the scheduling and deadlock avoidance of a class of automated manufacturing systems. In such systems, a set of jobs is to be performed on a set of resources and each job requires several operations. An operation may require several types of resources with several units of each type. Further, upon the completion of an operation, its related resources cannot be released until resources needed for the next operation become available. One important characteristic of such systems is the possibility of deadlock. The scheduling problem deals with the allocation of resources such that jobs are completed within a minimal makespan and deadlocks are avoided. We extend the classical geometric approach to solve the two-job case of our model. A greedy algorithm based on this result and the taboo search heuristic are then developed for the general case. Numerical results show that the proposed algorithm is fast and provides good schedules.

[1]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[2]  Javier Martínez,et al.  A Petri net based deadlock prevention policy for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..

[3]  Bruce H. Krogh,et al.  Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows , 1990, IEEE Trans. Robotics Autom..

[4]  Jean-Marie Proth,et al.  Petri nets : a tool for design and management of manufacturing systems , 1996 .

[5]  Sanjay B. Joshi,et al.  Deadlock-free schedules for automated manufacturing workstations , 1996, IEEE Trans. Robotics Autom..

[6]  Wieslaw Kubiak,et al.  Sequencing of parts and robot moves in a robotic cell , 1989 .

[7]  Bérénice Camargo Damasceno.  Ordonnancement des systèmes de production multi-ressources avec la prise en compte de blocage , 1999 .

[8]  Xiao-lan Xie,et al.  A heuristic algorithm for the periodic scheduling and sequencing job-shop problem , 1987, 26th IEEE Conference on Decision and Control.

[9]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[10]  Hervé Camus.  Conduite de systèmes flexibles de production manufacturière par composition de régimes permanents cycliques : modélisation et évalution de performances à l'aide des réseaux de Petri , 1997 .

[11]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[12]  P. Bruckner,et al.  An efficient algorithm for the job-shop problem with two jobs , 1988 .

[13]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[14]  Gerd Finke,et al.  Scheduling with resource management in manufacturing systems , 1994 .

[15]  Xiaolan Xie,et al.  Petri nets and deadlock-free scheduling of multiple-resource operations , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[16]  Maria Pia Fanti,et al.  Event-based feedback control for deadlock avoidance in flexible production systems , 1997, IEEE Trans. Robotics Autom..

[17]  Frank DiCesare,et al.  Scheduling flexible manufacturing systems using Petri nets and heuristic search , 1994, IEEE Trans. Robotics Autom..

[18]  Feng Chu,et al.  Deadlock analysis of Petri nets using siphons and mathematical programming , 1997, IEEE Trans. Robotics Autom..

[19]  Xiaolan Xie,et al.  Scheduling and deadlock avoidance of a flexible manufacturing system , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[20]  MuDer Jeng,et al.  A Search Approach Based on the Petri Net Theory for FMS Scheduling , 1996 .

[21]  Gotha.  Les problèmes d'ordonnancement , 1993 .

[22]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .