In: Transactions of the Society of Instrument and Control Engineers, Vol. 25, No. 6, pages 714-716. June 1989. In Japanese.
Abstract: Job-shop type, time-optimal scheduling problems for repetitive processes are modelled by the Petri net with timed places. Assuming the stationary periodic solution, the optimal or the suboptimal solution is obtained by LP and the branch-and-bound method.
Keywords: timed-place net; scheduling; repetitive process; job-shop scheduling; branch-and-bound method.
Back to the Petri Nets Bibliography