his study addresses cooperative batch scheduling problems based on both serial (s-batch) and parallel (p-batch) scheduling. A mixed-integer linear programming model was formulated to describe such a bid construction scheme (BCS) developed solve them. In s-batch p-batch scheduling, the sheet strips function as bidders auctioned resources, with different forming batches over multiple rounds of au...

Opportunistic scheduling utilizes idle workstations to execute batch jobs. Other than ensuring that each batch user receives a fair allocation of service, no work addressing opportunistic scheduling of batch jobs has been done. In this paper we propose two simple scheduling policies to be used in conjunction with the Condor Up-Down scheduling algorithm. We show that an order of magnitude reduct...

Previously proposed wavelength scheduling algorithms in optical burst switching networks process each reservation request individually and in a greedy manner. In this paper we propose a new family of wavelength scheduling algorithms that process a batch of reservation requests together instead of processing them one by one. When a control burst with a reservation request arrives to a free batch...

A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time...