๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Modeling job shop scheduling with batches and setup times by timed Petri nets

โœ Scribed by Hehua Zhang; Ming Gu

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
810 KB
Volume
49
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Petri net modeling and scheduling for cy
Petri net modeling and scheduling for cyclic job shops with blocking
โœ Ju-Seog Song; Tae-Eog Lee ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 618 KB

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 prop

Single machine scheduling with past-sequ
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs
โœ Chuanli Zhao; Hengyong Tang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func

Scheduling with two job classes and setu
Scheduling with two job classes and setup times to minimize the number of tardy jobs
โœ Jatinder N.D. Gupta; Johnny C. Ho ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 969 KB

This paper considers the problem of minimizing the number of tardy jobs to be processed on a single machine with two job classes where a job's setup time depends on its job class. This is an increasinbly important problem due to the growing popularity of group technology manufacturing techniques, wh