2006Unpublished venueRequires access

A Genetic Algorithm for Solving Dynamic Scheduling Problems in Distributed Manufacturing Systems

Yanhong Wang, Lixin Yan, Hongyu Zhu, Yin Chaowan

Open publisher page 10 citations

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

About this research paper

What this paper is about

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

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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

Key concepts: Genetic algorithm scheduling, Dynamic priority scheduling, Computer science, Fair-share scheduling, Distributed manufacturing, Scheduling (production processes), Job shop scheduling, Distributed computing

Related papers

Back to paper searchBrowse research topicsOriginal source
A Genetic Algorithm for Solving Dynamic Scheduling Problems in Distributed Manufacturing Systems — Research Paper | ScholarLens