Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474711 | Computers & Operations Research | 2012 | 7 Pages |
Abstract
New parallel objective function determination methods for the job shop scheduling problem are proposed in this paper, considering makespan and the sum of jobs execution times criteria, however, the methods proposed can be applied also to another popular objective functions such as jobs tardiness or flow time. Parallel Random Access Machine (PRAM) model is applied for the theoretical analysis of algorithm efficiency. The methods need a fine-grained parallelization, therefore the approach proposed is especially devoted to parallel computing systems with fast shared memory (e.g. GPGPU, General-Purpose computing on Graphics Processing Units).
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Wojciech Bożejko,