Abstract
In the global competitive world swift, reliable and cost effective production subject to uncertain situations, through an appropriate management of the available resources, has turned out to be the necessity for surviving in the market. This inspired the development of the more efficient and robust methods to counteract the existing complexities prevailing in the market. The present paper proposes a hybrid CFGTSA algorithm inheriting the salient features of GA, TS, SA, and chaotic theory to solve the complex scheduling problems commonly faced by most of the manufacturing industries. The proposed CFGTSA algorithm has been tested on a scheduling problem of an automobile industry, and its efficacy has been shown by comparing the results with GA, SA, TS, GTS, and hybrid TSA algorithms.
Original language | English |
---|---|
Title of host publication | 2006 IEEE International Conference on Systems, Man and Cybernetics |
Publisher | IEEE |
Pages | 5041-5046 |
Number of pages | 6 |
Volume | 6 |
ISBN (Print) | 1424401003, 9781424401000 |
DOIs | |
Publication status | Published - 1 Jan 2007 |
Externally published | Yes |
Event | 2006 IEEE International Conference on Systems, Man and Cybernetics - Taipei, Taiwan Duration: 8 Oct 2006 → 11 Oct 2006 |
Conference
Conference | 2006 IEEE International Conference on Systems, Man and Cybernetics |
---|---|
Country/Territory | Taiwan |
City | Taipei |
Period | 8/10/06 → 11/10/06 |
Keywords
- CFGTSA
- Chaotic theory
- GA
- SA
- Scheduling
- TS
ASJC Scopus subject areas
- General Engineering