Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach

Kahraman C., Engin O., KAYA İ., Öztürk E.

APPLIED SOFT COMPUTING, vol.10, no.4, pp.1293-1300, 2010 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 10 Issue: 4
  • Publication Date: 2010
  • Doi Number: 10.1016/j.asoc.2010.03.008
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1293-1300
  • Keywords: Hybrid flow shop, Multiprocessor tasks scheduling problems, Parallel greedy algorithm, GENETIC ALGORITHM, BOUND ALGORITHM, 2-STAGE, BRANCH, OPTIMIZATION, MODEL
  • Yıldız Technical University Affiliated: No


Hybrid flow shop scheduling problems have a special structure combining some elements of both the flow shop and the parallel machine scheduling problems. Multiprocessor task scheduling problem can be stated as finding a schedule for a general task graph to execute on a multiprocessor system so that the schedule length can be minimized. Hybrid Flow Shop Scheduling with Multiprocessor Task (HFSMT) problem is known to be NP-hard. In this study we present an effective parallel greedy algorithm to solve HFSMT problem. Parallel greedy algorithm (PGA) is applied by two phases iteratively, called destruction and construction. Four constructive heuristic methods are proposed to solve HFSMT problems. A preliminary test is performed to set the best values of control parameters, namely population size, subgroups number, and iteration number. The best values of control parameters and operators are determined by a full factorial experimental design using our PGA program. Computational results are compared with the earlier works of Oguz et al. [1,3], and Oguz [2]. The results indicate that the proposed parallel greedy algorithm approach is very effective in terms of reduced total completion time or makespan (C(max)) for the attempted problems. (C) 2010 Elsevier B. V. All rights reserved.