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

@article{Kahraman2010MultiprocessorTS,
  title={Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach},
  author={Cengiz Kahraman and Orhan Engin and Ihsan Kaya and R. Elif {\"O}zt{\"u}rk},
  journal={Appl. Soft Comput.},
  year={2010},
  volume={10},
  pages={1293-1300}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Data for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

  • C. Oğuz
  • Koç University
  • 2006
Highly Influential
5 Excerpts

Branch and bound algorithm for flow shop with multiple processors

  • S. A. Brah, J. L. Hunsucker
  • European Journal of operations Research 51
  • 1991
Highly Influential
3 Excerpts

A comparison of multiprocessor task scheduling algorithms with communication costs

  • C. J. Liao Tseng
  • Computers & Operations Research
  • 2008

Anoteonagreedyheuristic forflowshopmakespanmin - imizationwithnomachine idle - time

  • G. Mosheiov Baraz
  • European Journal of Operational Research
  • 2007

Hybrid flow shop scheduling as a multi - mode multi project scheduling problem with batching requirements : a real world application

  • O. Engin Alaykıran, A. Döyen
  • International Journal of Production Economics
  • 2007

Similar Papers

Loading similar papers…