Paper:
Views over last 60 days: 353
Fuzzy Flexible-Flow Shops at Two Machine Centers
Tzung-Pei Hong* and Wei-Chou Chen**
*Department of Information Management
**Institute of Information Engineering, I-Shou University Kaohsiung, 84008, Taiwan, R.O.C.
Received:May 6, 1998Accepted:August 19, 1998Published:August 20, 1998
Keywords:Scheduling, Flexible-flow shop, Fuzzy set, Membership function, LPT, Johnson algorithm
Abstract
In simple-flow shop problems, each machine operation center has one machine. If a machine center has more than one machine, scheduling becomes a flexible shop flow problem. Flexible shop flows are thus generalizations of simple shop flow. Processing time for each job was previously assumed to be known exactly, but in many real-world applications, processing times vary dynamically due to human or operating factors. We apply fuzzy concepts to represent uncertainty in processing times for flexible-flow shops with two machine centers, then propose a fuzzy heuristic algorithm for job scheduling. We first use a fuzzy LPT algorithm to allocate jobs, then use a fuzzy Johnson algorithm to deal with task sequencing. The proposed method lets jobs be scheduled more flexibly than conventionally.
Cite this article as:T. Hong and W. Chen, “Fuzzy Flexible-Flow Shops at Two Machine Centers,” J. Adv. Comput. Intell. Intell. Inform., Vol.2 No.4, pp. 142-149, 1998.Data files:
