A Genetic Algorithm for Solving Dynamic Scheduling Problems in Distributed Manufacturing Systems
Yanhong Wang, Lixin Yan, Hongyu Zhu, Yin Chaowan
Abstract
Yanhong Wang, Lixin Yan, Hongyu Zhu, Yin Chaowan
Abstract
It has been proven that the distributed manufacturing system, if managed properly, can enable enterprises to reduce manufacturing costs, increase product quality and make better use of manufacturing resources. However, the dynamic scheduling in distributed manufacturing environments can be much more complex than that in the single integrated enterprise cases. In this paper, a distributed scheduling method is developed, which is composed of an iterative coordination mechanism and a modified genetic algorithm. The complicated scheduling problem is divided into several sub-problems to make the problem easier. The scheduling objective is to achieve a multiple performance index, i.e. minimizing the manufacturing cost and meeting the due date. The capability of the proposed method has been tested with satisfactory results through several numerical experiments
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It has been proven that the distributed manufacturing system, if managed properly, can enable enterprises to reduce manufacturing costs, increase product quality and make better use of manufacturing resources. However, the dynamic scheduling in distributed manufacturing environments can be much more complex than that in the single integrated enterprise cases. In this paper, a distributed scheduling method is developed, which is composed of an iterative coordination mechanism and a modified genetic algorithm. The complicated scheduling problem is divided into several sub-problems to make the problem easier. The scheduling objective is to achieve a multiple performance index, i.e. minimizing the manufacturing cost and meeting the due date. The capability of the proposed method has been tested with satisfactory results through several numerical experiments
Key concepts: Genetic algorithm scheduling, Dynamic priority scheduling, Computer science, Fair-share scheduling, Distributed manufacturing, Scheduling (production processes), Job shop scheduling, Distributed computing