A look-ahead heuristic for scheduling jobs with release dates on a single machine
Computers and Operations Research
Better Bounds for Online Scheduling
SIAM Journal on Computing
Online scheduling with hard deadlines
Journal of Algorithms
SIAM Journal on Discrete Mathematics
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
Minimizing Makespan in Batch Machine Scheduling
Algorithmica
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
Mathematics of Operations Research
How much can lookahead help in online single machine scheduling
Information Processing Letters
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
Information Processing Letters
Online interval scheduling on a single machine with finite lookahead
Computers and Operations Research
Hi-index | 5.23 |
This paper studies online scheduling of unit length jobs on a parallel batching machine with the help of lookahead. The objective is to maximize the number of early jobs. Denote by b the size of each batch with b=~ in the unbounded batching and b