Scheduling split-jobs on parallel machines

Share/Save/Bookmark

Hurink, J.L. and Kern, W. and Nawijn, W.M. (2000) Scheduling split-jobs on parallel machines. [Report]

[img]
Preview
PDF
111Kb
Abstract: In classical shop scheduling, the tasks corresponding to a job may not be executed in parallel, i.e., their processing times may not overlap. In case these tasks are processes, independent of each other, this assumption is no longer justified. We consider corresponding scheduling problems where each job splits into a number of pairwise independent processes that have to be executed on dedicated machines.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65718
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page