To exploit a heterogeneous computing (HC) environment, an application task may be decomposed into subtasks that have data dependencies. Subtask matching and scheduling consists of assigning subtasks to machines, ordering subtask execution for each machine, and ordering intermachine data transfers. T
โฆ LIBER โฆ
A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell
โ Scribed by Jagabandhu Sridhar; Chandrasekharan Rajendran
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 351 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0360-8352
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Task Matching and Scheduling in Heteroge
โ
Lee Wang; Howard Jay Siegel; Vwani P. Roychowdhury; Anthony A. Maciejewski
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 446 KB
A simulated annealing algorithm for the
โ
Atabak Elmi; Maghsud Solimanpur; Seyda Topaloglu; Afshin Elmi
๐
Article
๐
2011
๐
Elsevier Science
๐
English
โ 444 KB
This paper addresses the problem of scheduling parts in job shop cellular manufacturing systems by considering exceptional parts that need to visit machines in different cells and reentrant parts which need to visit some machines more than once in non-consecutive manner. Initially, an integer linear
A genetic algorithm for integrating lot-
โ
Riyaz Sikora
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 891 KB
A genetic-algorithm-based optimal schedu
โ
Chunhua Yang; Weihua Gui; Lingshuang Kong; Xiaoli Wang
๐
Article
๐
2008
๐
John Wiley and Sons
๐
English
โ 238 KB
๐ 1 views
A BEM-based genetic algorithm for identi
โ
Panayiotis Miltiadou; Luiz C. Wrobel
๐
Article
๐
2002
๐
John Wiley and Sons
๐
English
โ 596 KB
A multipopulation parallel genetic simul
โ
Hui Cheng; Xingwei Wang; Shengxiang Yang; Min Huang
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 444 KB