Petri net modeling and scheduling for cyclic job shops with blocking

✍ Scribed by Ju-Seog Song; Tae-Eog Lee

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 618 KB
• Volume: 34
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/s0360-8352(97)00325-2

✦ Synopsis

AbstractÐCyclic scheduling is an eective scheduling method in the repetitive discrete manufacturing environment. We investigate the scheduling problem for general cyclic job shops with blocking where each machine has an input buer of ®nite capacity. We develop Petri net models for the shops. We propose a sequential buer control policy that restricts the jobs to enter the input buer of the next machine in a speci®ed sequence. We show that the scheduling model of a cyclic shop with ®nite buers under such a buer control policy can be transformed into a scheduling model of a cyclic shop with no buer that can be modeled as a timed marked graph. In addition, we characterize the structural properties for deadlock detection. Finally, we present a mixed integer programming model to ®nd an optimal deadlock-free schedule that minimizes the cycle time.