Abstract
This paper deals with the cyclic scheduling of flexible job-shop with time window constraints and resource capacity constraints. For time window constraints, the duration for processing products on machines and the duration for translating products from one machine to another by transfers are taken into account; for the resource capacity constraints, the confined operation space of machines and the length-limited transfers are considered. The example applied in this paper is a flexible job-shop of two kinds of products with demanded products ratio, which can be described as a P-time strongly connected event graph (PTSCEG). The mixed integer programming (MIP) is used to give proper constraints of token's cyclic activities in PTSCEG. Using CPLEX 12.5, the computational time is acceptable for 1- cyclic scheduling of small or medium sized cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
