A hybrid CFGTSA based approach for scheduling problem: A case study of an automobile industry

Felix T. S. Chan; Vikas Kumar; Hing Chan; S.h. Chung

doi:10.1109/ICSMC.2006.385107

A hybrid CFGTSA based approach for scheduling problem: A case study of an automobile industry

Felix T. S. Chan, Vikas Kumar, Hing Chan, S.h. Chung

Research output: Contribution to conference › Other

1 Citation (Scopus)

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
Pages	5041-5046
Number of pages	6
DOIs	https://doi.org/10.1109/ICSMC.2006.385107
Publication status	Published - 1 Oct 2006
Event	2006 IEEE International Conference on Systems, Man and Cybernetics - Taipei, Taiwan, United Kingdom Duration: 8 Oct 2006 → 11 Oct 2006

Conference

Conference	2006 IEEE International Conference on Systems, Man and Cybernetics
Country/Territory	United Kingdom
City	Taipei, Taiwan
Period	8/10/06 → 11/10/06

Keywords

CFGTSA
Chaotic theory
GA
SA
Scheduling
TS

Access to Document

10.1109/ICSMC.2006.385107

Cite this

@conference{42be71c506d54a4fb7d619347e6b2005,

title = "A hybrid CFGTSA based approach for scheduling problem: A case study of an automobile industry",

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.",

keywords = "CFGTSA, Chaotic theory, GA, SA, Scheduling, TS",

author = "Chan, {Felix T. S.} and Vikas Kumar and Hing Chan and S.h. Chung",

year = "2006",

month = oct,

day = "1",

doi = "10.1109/ICSMC.2006.385107",

language = "English",

pages = "5041--5046",

note = "2006 IEEE International Conference on Systems, Man and Cybernetics ; Conference date: 08-10-2006 Through 11-10-2006",

}

TY - CONF

T1 - A hybrid CFGTSA based approach for scheduling problem: A case study of an automobile industry

AU - Chan, Felix T. S.

AU - Kumar, Vikas

AU - Chan, Hing

AU - Chung, S.h.

PY - 2006/10/1

Y1 - 2006/10/1

N2 - 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.

AB - 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.

KW - CFGTSA

KW - Chaotic theory

KW - GA

KW - SA

KW - Scheduling

KW - TS

U2 - 10.1109/ICSMC.2006.385107

DO - 10.1109/ICSMC.2006.385107

M3 - Other

SP - 5041

EP - 5046

T2 - 2006 IEEE International Conference on Systems, Man and Cybernetics

Y2 - 8 October 2006 through 11 October 2006

ER -