A heuristic Gupta-based flexible flow-shop scheduling algorithm

Author

Hong, Tzung-Pei ; Wang, Shjue-Liang ; Shyue-liang Wang

Author_Institution

Dept. of Inf. Manage., I-Shou Univ., Kaohsiung, Taiwan

Volume

1

fYear

2000

fDate

2000

Firstpage

319

Abstract

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. C. Sriskandarajah and S.P. Sethi (1989) proposed a heuristic algorithm for solving flexible flow-shop problems for two machine centers. In this paper, we extend their algorithm to solve flexible flow-shop problems for more than two machine centers. The heuristic Gupta algorithm is adopted as the kernel for achieving this purpose. Since this problem is NP-complete, optimal solutions seem unnecessary, especially when the number of jobs is large

Keywords

computational complexity; heuristic programming; production control; scheduling; NP-complete problem; flexible flow-shop scheduling algorithm; heuristic Gupta algorithm; machine operation centers; Finishing; Heuristic algorithms; Information management; Job shop scheduling; Kernel; Milling machines; NP-complete problem; Processor scheduling; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 2000 IEEE International Conference on

Conference_Location

Nashville, TN

ISSN

1062-922X

Print_ISBN

0-7803-6583-6

Type

conf

DOI

10.1109/ICSMC.2000.885010

Filename

885010