A Fuzzy CDS-based Scheduling Algorithm for More Than Two Machine Centers
Tzung-Pei Hong*, Tzu-Ting Wang** and Shyue-Liang Wang*
*Department of Information Management, I-Shou University Kaohsiung, 84008, Taiwan R.O.C.
**Institute of Information Engineering, I-Shou University Kaohsiung, 84008, Taiwan R.O.C.
Received:February 4, 2001Accepted:March 4, 2001Published:July 20, 2001
Keywords:scheduling, flexible flow shop, fuzzy set, membership function, LPT scheduling, CDS scheduling
In simple flow shop problems, each machine operation center includes just one machine. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Flexible flow shops can thus be thought of as generalizations of simple flow shops. In Ref.14), we have demonstrated how fuzzy concepts can easily be used in the Sriskandarajak and Sethi’s algorithm for managing uncertain scheduling on two-machine centers. This paper extends application to fuzzy flexible flow-shops with more than two machine centers. A new fuzzy heuristic flexible flowshop scheduling algorithm is then designed since optimal solutions seem unnecessary for uncertain environments. We first use fuzzy LPT algorithm to allocate jobs into the groups and then use the fuzzy CDS algorithm to deal with sequencing the tasks. The proposed method thus provides a flexible way to more fit real world applications.
Cite this article as:T. Hong, T. Wang, and S. Wang, “A Fuzzy CDS-based Scheduling Algorithm for More Than Two Machine Centers,” J. Adv. Comput. Intell. Intell. Inform., Vol.5 No.4, pp. 239-245, 2001.Data files: