By Topic

Cyclic flow shop scheduling based on timed event graph extended with disjunctive constraints

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
$33 $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

4 Author(s)
Si-Cheng Ren ; Inst. of Autom., Chinese Acad. of Sci., Beijing, China ; De Xu ; Fang Wang ; Min Tan

The cyclic flow shop is one flow shop that repetitively produces the product mix. We propose that the cyclic flow shops can be modeled as time event graphs extended with disjunctive constraints. Based on the timed event graph models, mixed-integer programs are established to find the optimal schedule under with the system functions with the minimal cycle time. Three different cases of cyclic flow shops are discussed respectively.

Published in:

2005 IEEE International Conference on Industrial Technology

Date of Conference:

14-17 Dec. 2005