We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Modeling and scheduling of real-life assembly job shop with timed colored Petri net

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Daxin Zang ; Software Eng. Inst., Beijing Univ. of Aeronaut. & Astronaut., Beijing, China ; Xiaoding Shi ; Maozhong Jin

This paper analyzes the requirement of a real-life assembly job-shop scheduling, which is different from the classical scheduling problems, ensuring not only the sequences having the minimization makespan as possible, but also the operations processed with the a period. Solving the conflicts of the equipments on which many process will be operated be used at the same time in actual production. First modeling the kind of assembly job-shop schedule problem by timed colored Petri nets, then resolves it in a Branch and Bound way with heuristic rules which gives a near optimization. At the end of the paper, a practical example is described, and the results show that the proposed method is effective.

Published in:

Service Systems and Service Management (ICSSSM), 2010 7th International Conference on

Date of Conference:

28-30 June 2010