A look-ahead heuristic for scheduling jobs with release dates on a single machine
Computers and Operations Research
A simple semi on-line algorithm for P2//Cmax with a buffer
Information Processing Letters
On-Line Load Balancing in a Hierarchical Server Topology
SIAM Journal on Computing
The Power of Reordering for Online Minimum Makespan Scheduling
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Online scheduling on two uniform machines to minimize the makespan
Theoretical Computer Science
Online parallel machines scheduling with two hierarchies
Theoretical Computer Science
New algorithms for online rectangle filling with k-lookahead
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization
Online scheduling of two job types on a set of multipurpose machines with unit processing times
Computers and Operations Research
Online and semi-online scheduling of two machines under a grade of service provision
Operations Research Letters
Semi on-line algorithms for the partition problem
Operations Research Letters
Online minimum makespan scheduling with a buffer
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Semi-online hierarchical scheduling problems with buffer or rearrangements
Information Processing Letters
Hi-index | 5.23 |
In this paper, we consider two semi-online scheduling problems of parallel machines with two GoS (grade of service) levels and unit processing time, in which the objective is to minimize the makespan. Assume that the GoS levels of the first s machines are 2 and that of the last (m-s) machines are 1 where m is the number of machines. The first problem is the lookahead version where an online algorithm is able to foresee the information of the next k jobs. The second problem is the buffer version where a buffer is available for storing at most g jobs. For the both versions, we prove that the lookahead ability or the buffer is useless for designing algorithm when k