Analysis of a manufacturing cell under a set of cyclic constraints

Author

Julia, Stephane ; Valette, Robert ; Tazza, Maurizio

Author_Institution

Lab. d´´Autom. et d´´Anal. des Syst., CNRS, Toulouse, France

Volume

1

fYear

1995

fDate

13-16 Aug 1995

Firstpage

23

Abstract

The objective of this paper is to obtain a good balance between efficiency and flexibility for Flexible Manufacturing cells with a cyclic feeding policy. The approach presented is based on a p-t-timed Petri net with durations attached to places (wait and slack times) and to transitions (operation times). The routing of the parts and the assignment of resources are collectively carried out to take full advantage of the flexibility of the system. Linear programming in mixed variables is used to compute minimal and maximal bounds for the period and a token player algorithm with backtracking to compute a feasible schedule

Keywords

Petri nets; constraint handling; flexible manufacturing systems; linear programming; production control; backtracking; cyclic constraints; cyclic feeding policy; flexible manufacturing cells; linear programming; maximal bounds; minimal bounds; mixed variables; operation times; p-t-timed Petri net; resource assignment; routing; slack times; token player algorithm; wait times; Flexible manufacturing systems; Job shop scheduling; Linear programming; Processor scheduling; Production; Pulp manufacturing; Routing; Scheduling algorithm; Steady-state; Tin; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1995., Proceedings., Proceedings of the 38th Midwest Symposium on

Conference_Location

Rio de Janeiro

Print_ISBN

0-7803-2972-4

Type

conf

DOI

10.1109/MWSCAS.1995.504369

Filename

504369