This paper demonstrates solving the flexible flow shop scheduling problem (FFSP) with considering limited waiting time constraint, sequence dependent setup times and different ready time to minimize maximum completion time (i.e. makespan). Since the problem studied is NP-hard, metaheuristic algorithms are proper to solve this class of problems. Hence, in this 1 / 4

In recent years Cellular Manufacturing has become an effective tool for improving productivity. Attainment of full benefits of Cellular Manufacturing depends firstly on the design of the machine cells and part families, secondly on the method of operations which takes full advantage of cell properties. Inappropriate methods of loading and scheduling can even lead to the failure of the Cellular ...

This paper proposes a suitable on-line testing technique during the synthesis of complex electronic structures. Online testability is addressed by exploiting time redundancy in the scheduled data flow graph. On-line testability constraints are taken into account at the scheduling and allocation tasks. The technique implements non-concurrent; semiconcurrent or fully concurrent on-line tests acco...

System virtualization provides low-cost, flexible and powerful executing environment for virtualized data centers, which plays an important role in the infrastructure of Cloud computing. However, the virtualization also brings some challenges, particularly to the resource management and task scheduling. This paper proposes an efficient dynamic task scheduling scheme for virtualized data centers...

An increasing bandwidth demand has mandated a shift to the time and wavelength division multiplexing (TWDM) techniques in optical access networks (OAN). Typical TWDM scheduling schemes consider scheduling of the optical line terminal receiver only. In this paper we have identified an additional collision domain that is present in TWDM schemes that offer security, in addition to bandwidth flexib...