On-line Partitioning for On-line Scheduling with Resource Conflicts
 	 	
 	 Piotr Borowiecki
   	
	 Department of Discrete Mathematics and Theoretical Computer Science
	 University of Zielona Góra, Poland
      
         
    
    
   ABSTRACT
     Within this paper, we consider the problem of on-line partitioning the sequence of jobs
     which are competing for non-sharable resources.
     As a result of partitioning we get the subsets of jobs that form separate instances
     of the on-line scheduling problem.
     The objective is to generate a partition into the minimum number of instances such that
     the response time of any job in each instance is bounded by a given constant. 
     Our research is motivated by applications in scheduling multiprocessor jobs on dedicated
     processors and channel assignment in WDM networks.