Track: Optimization
Abstract
Flexible Job-shop Scheduling Problem (FJSP), which closely represent contemporary manufacturing systems, is regarded as one of the most challenging and crucial scheduling problems. A job-shop scheduling problem that attempts to mimic real-life manufacturing is incomplete without consideration of machine-related issues such as setting up and maintenance; and job-related issues such as transportation of jobs between machines. Consideration of these factors for FJSP has gained attention in recent times. The majority of the papers, however, deal with only a few of these issues. The proposed work considers the FJSP with issues of maintenance, setup and transportation time, termed as the complex FJSP. This work proposes a multi-agent based approach for solving the complex FJSP.