Scheduling split-jobs on parallel machines

Research output: Book/ReportReportOther research output

16 Downloads (Pure)


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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Publication statusPublished - 2000

Publication series

PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • MSC-90B35
  • IR-65718
  • EWI-3350

Cite this

Hurink, J. L., Kern, W., & Nawijn, W. M. (2000). Scheduling split-jobs on parallel machines. Enschede: University of Twente, Department of Applied Mathematics.