Evolutionary Computing of Petri Net Structure for Cyclic Job Shop Scheduling
Summary :
This paper considers Cyclic Job-Shop Scheduling Problems (CJSSP) extended from the Job-Shop Scheduling Problem (JSSP). We propose an evolutionary computing method to solve the problem approximately by generating the Petri net structure for scheduling. The crossover proposed in this paper employs structural analysis of Petri net model, that is, the crossover improves the cycle time by breaking the bottle-neck circuit obtained by solving a linear programming problem. Experimental evaluation shows the effectiveness of our approach.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.11 pp.3235-3243
- Publication Date
- 2006/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e89-a.11.3235
- Type of Manuscript
- Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
- Category
- Concurrent Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Morikazu NAKAMURA, Koji HACHIMAN, Hiroki TOHME, Takeo OKAZAKI, Shiro TAMAKI, "Evolutionary Computing of Petri Net Structure for Cyclic Job Shop Scheduling" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 11, pp. 3235-3243, November 2006, doi: 10.1093/ietfec/e89-a.11.3235.
Abstract: This paper considers Cyclic Job-Shop Scheduling Problems (CJSSP) extended from the Job-Shop Scheduling Problem (JSSP). We propose an evolutionary computing method to solve the problem approximately by generating the Petri net structure for scheduling. The crossover proposed in this paper employs structural analysis of Petri net model, that is, the crossover improves the cycle time by breaking the bottle-neck circuit obtained by solving a linear programming problem. Experimental evaluation shows the effectiveness of our approach.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.11.3235/_p
Copy
@ARTICLE{e89-a_11_3235,
author={Morikazu NAKAMURA, Koji HACHIMAN, Hiroki TOHME, Takeo OKAZAKI, Shiro TAMAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Evolutionary Computing of Petri Net Structure for Cyclic Job Shop Scheduling},
year={2006},
volume={E89-A},
number={11},
pages={3235-3243},
abstract={This paper considers Cyclic Job-Shop Scheduling Problems (CJSSP) extended from the Job-Shop Scheduling Problem (JSSP). We propose an evolutionary computing method to solve the problem approximately by generating the Petri net structure for scheduling. The crossover proposed in this paper employs structural analysis of Petri net model, that is, the crossover improves the cycle time by breaking the bottle-neck circuit obtained by solving a linear programming problem. Experimental evaluation shows the effectiveness of our approach.},
keywords={},
doi={10.1093/ietfec/e89-a.11.3235},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Evolutionary Computing of Petri Net Structure for Cyclic Job Shop Scheduling
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3235
EP - 3243
AU - Morikazu NAKAMURA
AU - Koji HACHIMAN
AU - Hiroki TOHME
AU - Takeo OKAZAKI
AU - Shiro TAMAKI
PY - 2006
DO - 10.1093/ietfec/e89-a.11.3235
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2006
AB - This paper considers Cyclic Job-Shop Scheduling Problems (CJSSP) extended from the Job-Shop Scheduling Problem (JSSP). We propose an evolutionary computing method to solve the problem approximately by generating the Petri net structure for scheduling. The crossover proposed in this paper employs structural analysis of Petri net model, that is, the crossover improves the cycle time by breaking the bottle-neck circuit obtained by solving a linear programming problem. Experimental evaluation shows the effectiveness of our approach.
ER -
English
