Abstract
Flexible manufacturing system control is an NP-hard problem. A cyclic approach has been demonstrated to be adequate for an infinite scheduling problem because of maximal throughput reachability. However, it is not the only optimization criterion in general. In this article we consider the minimization of the work in process (WIP) as an economical and productivity factor. We propose a new cyclic scheduling algorithm giving the maximal throughput (a hard constraint) while minimizing WIP. This algorithm is based on progressive operations placing. A controlled beam search approach has been developed to determine at each step the schedule of the next operations. After presenting the main principles of the algorithm, we compare our approach to several most known cyclic scheduling algorithms using a significant existing example from the literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellman, R., Dynamic Programming, Princeton University Press, Princeton, NJ (1957).
Campos, J., “Performance Bounds for Synchronized Queueing Networks,” Ph.D. thesis, Departamento de Ingeniera Electrica e Informatica, Universidad de Zaragoza, Spain (December 1990).
Campos, J., Chiola, G. J., Colom, J. M., and Silva, M., “Properties and Performance Bounds for Timed Marked Graphs,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, Vol. 39, No.5, pp. 386–401 (May 1992).
Camus, H., Ohl, H., Korbaa, O., and Gentina, J.-C., “Cyclic Schedules in Flexible Manufacturing Systems with Groups of Identical Machines,” Proceedings of CIMAT'96, Grenoble, France, pp. 345–350 (May 1996a).
Camus, H., Ohl, H., Korbaa, O., and Gentina, J.-C., “Cyclic Schedules in Flexible Manufacturing Systems with Flexibilities in Operating Sequences,” First International Workshop on Manufacturing and Petri Nets, 17th International Conference on Application and Theory of Petri Nets, Osaka, Japan, pp. 97–116 (June 1996b).
Chrétienne, P., Coffman, Jr., E. G., Lenstra, J. K., and Liu, Z., Scheduling Theory and its Applications, Wiley & Sons, New York, NY (1995).
Commoner, F., Holt, A.W., Even, S., and Pnueli, A., “Marked Directed Graphs,” Journal of Computer and System Sciences, Vol. 5, No.5, pp. 511–523 (1971).
Dubois, D. and Stecke, Kathryn E., “Using Petri Nets to Represent Production Processes,” Proceedings of the 22nd IEEE Conference on Decision and Control, San Antonio, Texas, pp. 1062–1067 (December 1983).
Erschler, J., Levêque, D., and Roubellat, F., “Periodic Loading of Flexible Manufacturing Systems,” IFIP Congress, APMS, Bordeaux, France, pp. 327–339 (1982).
Hanen, C., “Study of NP-hard Scheduling Problems: The Recurrent Job-Shop,” European Journal of Operational Research, Vol. 72, pp. 82–101 (1994).
Hillion, H. P., “Modélisation et Analyse des Systèmes de Production Discrets par les Réseaux de Petri Temporisés,” Ph.D. thesis, Université Pierre et Marie Curie (Paris VI) (January 1989).
Hillion, H. P. and Proth, J.-M., “Performance Evaluation of Job-Shop Systems using Timed Event-Graphs,” IEEE Transactions on Automatic Control, Vol. 34, No.1, pp. 3–9 (1989).
Korbaa, O., Camus, H., and Gentina, J.-C., “FMS Cyclic Scheduling with Overlapping Production Cycles,” International Conference on Application and Theory on Petri Nets, Workshop on Manufacturing and Petri Nets, Toulouse, France, pp. 35–52 (June 1997).
Laftit, S., Proth, J.-M., and Xie, X., “Optimization of Invariant Criteria for Event Graphs,” IEEE Transactions on Automatic Control, Vol. 37, No.5, pp. 547–555 (May 1992).
Magott, J., “New NP-complete Problems in Performance Evaluation and Concurrent Systems using Petri Nets,” IEEE Transactions on Software Engineering, Vol. SE-13, No.5, pp. 578–581 (May 1987).
Murata, T., “Petri Nets: Properties, Analysis, and Applications,” Proceedings of the IEEE, Vol. 77, No.4, pp. 541–580 (April 1989).
Ohl, H., Camus, H., Castelain, E., and Gentina, J.-C., “A Heuristic Algorithm for the Computation of Cyclic Schedules and the Necessary WIP to Obtain Optimum Cycle Time,” Proceedings of Computer Integrated Manufacturing and Automation Technology, Troy, NY, pp. 339–344 (October 1994).
Onaga, K., Silva, M., and Watanabe, T., “On Periodic Schedules for Deterministically Timed Petri Net Systems,” 4th International Workshop: Petri Nets and Performance Models, IEEE Computer Society, Melbourne, Australia, pp. 210–215 (1991).
Ramamoorthy, C. V. and Ho, G. S., “Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets,” IEEE Transactions on Software Engineering, Vol. SE-6, No.5, pp. 440–449 (1980).
Serafini, P. and Ukovitch, W., “A Mathematical Model for Periodic Scheduling Problems,” Journal of Discrete Mathematics, Vol. 2, No.4, pp. 550–581 (November 1989).
Sifakis, J., “Structural Properties of Petri Nets,” in Lecture Notes in Computer Science, No. 64, Springer Verlag (1978).
Valentin, C., “Modeling and Analysis Methods for a Class of Hybrid Dynamic Systems,” Proceedings of Automation of Mixed Process: Dynamical Hybrid Systems, Brussels, Belgium, pp. 221–226 (November 1994).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Korbaa, O., Camus, H. & Gentina, JC. A New Cyclic Scheduling Algorithm for Flexible Manufacturing Systems. International Journal of Flexible Manufacturing Systems 14, 173–187 (2002). https://doi.org/10.1023/A:1014490603776
Issue Date:
DOI: https://doi.org/10.1023/A:1014490603776