Ordinal Semi On-Line Scheduling for Jobs with Arbitrary Release Times on Identical Parallel Machines

HTML  XML Download Download as PDF (Size: 331KB)  PP. 245-254  
DOI: 10.4236/iim.2017.96014    744 Downloads   1,362 Views  Citations
Author(s)

ABSTRACT

In this paper, we investigate the problem of semi-on-line scheduling n jobs on m identical parallel machines under the assumption that the ordering of the jobs by processing time is known and the jobs have arbitrary release times. Our aim is to minimize the maximum completion time. An ordinal algorithm is investigated and its worst case ratio is analyzed.

Share and Cite:

Ji, S. , Li, R. and Zhou, Y. (2017) Ordinal Semi On-Line Scheduling for Jobs with Arbitrary Release Times on Identical Parallel Machines. Intelligent Information Management, 9, 245-254. doi: 10.4236/iim.2017.96014.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.