Cyclic Scheduling of Flexible Job-shop with Time Window Constraints and Resource Capacity Constraints

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.