In: Engineering Costs and Production Economics, Vol. 17, No. 1-4, pages 149-154. August 1989.
Abstract: The authors study the job-shop problem with repetitive demands in steady state. The control is given by the sequencing of the jobs on the machines. Petri nets are used to model and evaluate the system. The authors suggest an algorithm to give the optimal set of sequences, i.e. the set which provides the maximal productivity with the minimal number of transportation resources.
Keywords: timed net for the scheduling of job-shop systems; scheduling (of) >job-shop system; productivity; transportation resources.
Back to the Petri Nets Bibliography