The purpose of this study is to construct a solution algorithm for the two-machine permutation flowshop problem based on the dynasearch. The dynasearch is an efficient local search algorithm that employs a special neighborhood structure called dynasearch swap neighborhood. Its primary advantage is that the neighborhood of a solution can be explored in polynomial time although it is composed of an exponential number of solutions. The dynasearch for machine scheduling was originally developed for the single-machine total weighted tardiness problem. Then, it was extended to the problem with idle time and setup times. This study further extends the dynasearch to the two-machine permutation flowshop problem and its effectiveness is examined by numerical experiments for both total weighted tardiness and total weighted earliness-tardiness objectives.
On automated manufacturing system, it is commonly difficult to execute real production according to the schedule planned in advance because of the external fluctuations such as order change and delayed delivery of materials, and internal uncertain factors such as machine failure and process delay existing in real shop floor. In this study, a new concept of agent-based Real-Virtual Fusion Manufacturing System (RVF-MS) is proposed, which aims to adaptively and effectively consider both the external and internal fluctuations by realizing the fusion between real production shop floor (real system) and manufacturing simulation (virtual system). In this paper, a method of constructing virtual system in dynamic manufacturing environment is proposed, and effectiveness of the proposal is verified by experiments about production planning problem on flexible flow shop using model plant.