On-Line Scheduling for Jobs with Arbitrary Release Times on Parallel Related Uniform Machines
Open Access
- 1 January 2016
- journal article
- Published by Scientific Research Publishing, Inc. in Intelligent Information Management
- Vol. 08 (04), 98-102
- https://doi.org/10.4236/iim.2016.84008
Abstract
A parallel related uniform machine system consists of m machines with different processing speeds. The speed of any machine is independent on jobs. In this paper, we consider online scheduling for jobs with arbitrary release times on the parallel uniform machine system. The jobs appear over list in terms of order. An order includes the processing size and releasing time of a job. For this model, an algorithm with competitive ratio of 12 is addressed in this paper.Keywords
This publication has 1 reference indexed in Scilit:
- Improved algorithm for a generalized on-line scheduling problem on identical machinesEuropean Journal of Operational Research, 2007